{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "fredman-komlos-szemeredi-static-perfect-hashing-1984",
    "title": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup",
    "summary": "The paper constructed static sparse-set representations with constant worst-case membership query time and linear space, then refined word storage to n plus a sublinear remainder under its stated model.\n\nOrdinary hashing can be fast on average while leaving unlucky queries expensive. Fredman, Komlós and Szemerédi fixed the set in advance and used two levels of placement. A first hash is chosen so the sum of squared bucket sizes stays small. Each bucket then gets enough space for a second hash with no collisions among its stored keys. A query follows a constant number of table probes and compares the stored key with the requested key; reaching an occupied position alone does not prove membership. The paper also separates finding the representation from using it: constant worst-case query time does not imply constant insertion time. A refinement packs auxiliary tables so total storage approaches one universe-sized word per stored item. This is a static dictionary result in a specified word/probe model. Dynamic updates, arbitrary-length key costs, modern succinct bit bounds and production-system behavior are separate questions.",
    "boundary": "The result concerns a static key set and the specified word-RAM/hash-family assumptions. Randomized construction can produce linear-space storage with worst-case constant lookup, but construction and lookup guarantees are different. It does not provide unrestricted dynamic updates, adversarial chosen-key security or free computation on arbitrarily long keys. Implementation constants and practical throughput have not been replayed.",
    "area": "Computer science",
    "topic": "Static dictionary data structures",
    "year": 1984,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "fredman-komlos-szemeredi-static-perfect-hashing-1984",
    "target": {
      "record_id": "urn:uuid:0f2d6c47-664c-4f91-a03f-126ba2f081da",
      "version": 1,
      "content_hash": "sha256:596ceb6fe3afa1b4003675bb05f71a91810d6cbd6df2761ec5d34a6993adf6b5"
    },
    "humans": [
      "Michael L. Fredman",
      "János Komlós",
      "Endre Szemerédi"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "pagh-rodler-cuckoo-hashing-2001",
      "b-tree-1972"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-fredman-komlos-szemeredi-static-perfect-hashing-1984-original",
        "title": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — exact original scientific paper",
        "url": "https://www.cs.umd.edu/~gasarch/BLOGPAPERS/FKS.pdf"
      },
      {
        "id": "wrs24-fredman-komlos-szemeredi-static-perfect-hashing-1984-publisher",
        "title": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — publisher deposit",
        "url": "https://api.crossref.org/works/10.1145%2F828.1884"
      }
    ],
    "points": "140000",
    "published_grade": {
      "id": "fredman-komlos-szemeredi-static-perfect-hashing-1984",
      "entry_id": "fredman-komlos-szemeredi-static-perfect-hashing-1984",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:0f2d6c47-664c-4f91-a03f-126ba2f081da",
        "version": 1,
        "content_hash": "sha256:596ceb6fe3afa1b4003675bb05f71a91810d6cbd6df2761ec5d34a6993adf6b5"
      },
      "what_changed": "The paper constructed static sparse-set representations with constant worst-case membership query time and linear space, then refined word storage to n plus a sublinear remainder under its stated model.",
      "scope": "The paper constructed static sparse-set representations with constant worst-case membership query time and linear space, then refined word storage to n plus a sublinear remainder under its stated model. The result concerns a static key set and the specified word-RAM/hash-family assumptions. Randomized construction can produce linear-space storage with worst-case constant lookup, but construction and lookup guarantees are different. It does not provide unrestricted dynamic updates, adversarial chosen-key security or free computation on arbitrarily long keys. Implementation constants and practical throughput have not been replayed.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:0f2d6c47-664c-4f91-a03f-126ba2f081da",
        "version": 1,
        "content_hash": "sha256:596ceb6fe3afa1b4003675bb05f71a91810d6cbd6df2761ec5d34a6993adf6b5"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Michael L. Fredman",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — exact original scientific paper",
            "url": "https://www.cs.umd.edu/~gasarch/BLOGPAPERS/FKS.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "János Komlós",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — exact original scientific paper",
            "url": "https://www.cs.umd.edu/~gasarch/BLOGPAPERS/FKS.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Endre Szemerédi",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — exact original scientific paper",
            "url": "https://www.cs.umd.edu/~gasarch/BLOGPAPERS/FKS.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — exact original scientific paper",
            "url": "https://www.cs.umd.edu/~gasarch/BLOGPAPERS/FKS.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — publisher deposit",
            "url": "https://api.crossref.org/works/10.1145%2F828.1884"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The result concerns a static key set and the specified word-RAM/hash-family assumptions. Randomized construction can produce linear-space storage with worst-case constant lookup, but construction and lookup guarantees are different. It does not provide unrestricted dynamic updates, adversarial chosen-key security or free computation on arbitrarily long keys. Implementation constants and practical throughput have not been replayed.",
        "domain": "Computer science"
      },
      "sources": [
        {
          "citation": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — exact original scientific paper",
          "url": "https://www.cs.umd.edu/~gasarch/BLOGPAPERS/FKS.pdf"
        },
        {
          "citation": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — publisher deposit",
          "url": "https://api.crossref.org/works/10.1145%2F828.1884"
        }
      ],
      "statement": "# Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup\n\nThe paper constructed static sparse-set representations with constant worst-case membership query time and linear space, then refined word storage to n plus a sublinear remainder under its stated model.\n\nOrdinary hashing can be fast on average while leaving unlucky queries expensive. Fredman, Komlós and Szemerédi fixed the set in advance and used two levels of placement. A first hash is chosen so the sum of squared bucket sizes stays small. Each bucket then gets enough space for a second hash with no collisions among its stored keys. A query follows a constant number of table probes and compares the stored key with the requested key; reaching an occupied position alone does not prove membership. The paper also separates finding the representation from using it: constant worst-case query time does not imply constant insertion time. A refinement packs auxiliary tables so total storage approaches one universe-sized word per stored item. This is a static dictionary result in a specified word/probe model. Dynamic updates, arbitrary-length key costs, modern succinct bit bounds and production-system behavior are separate questions.\n\n## Scientific scope\n\nThe result concerns a static key set and the specified word-RAM/hash-family assumptions. Randomized construction can produce linear-space storage with worst-case constant lookup, but construction and lookup guarantees are different. It does not provide unrestricted dynamic updates, adversarial chosen-key security or free computation on arbitrarily long keys. Implementation constants and practical throughput have not been replayed.\n\n## People and systems\n\nMichael L. Fredman; János Komlós; Endre Szemerédi\n\n\n\n## Original sources\n\n- [Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — exact original scientific paper](https://www.cs.umd.edu/~gasarch/BLOGPAPERS/FKS.pdf)\n- [Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — publisher deposit](https://api.crossref.org/works/10.1145%2F828.1884)\n",
      "summary": "The paper constructed static sparse-set representations with constant worst-case membership query time and linear space, then refined word storage to n plus a sublinear remainder under its stated model.\n\nOrdinary hashing can be fast on average while leaving unlucky queries expensive. Fredman, Komlós and Szemerédi fixed the set in advance and used two levels of placement. A first hash is chosen so the sum of squared bucket sizes stays small. Each bucket then gets enough space for a second hash with no collisions among its stored keys. A query follows a constant number of table probes and compares the stored key with the requested key; reaching an occupied position alone does not prove membership. The paper also separates finding the representation from using it: constant worst-case query time does not imply constant insertion time. A refinement packs auxiliary tables so total storage approaches one universe-sized word per stored item. This is a static dictionary result in a specified word/probe model. Dynamic updates, arbitrary-length key costs, modern succinct bit bounds and production-system behavior are separate questions.",
      "title": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup"
    },
    "record_id": "urn:uuid:0f2d6c47-664c-4f91-a03f-126ba2f081da",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:0f2d6c47-664c-4f91-a03f-126ba2f081da",
      "version": 1,
      "content_hash": "sha256:596ceb6fe3afa1b4003675bb05f71a91810d6cbd6df2761ec5d34a6993adf6b5"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:51477d3c5933de9ddb962a902b1d6ae22df162c23cfed7869b8f52e11b277bfe"
  },
  "target": {
    "record_id": "urn:uuid:0f2d6c47-664c-4f91-a03f-126ba2f081da",
    "version": 1,
    "content_hash": "sha256:596ceb6fe3afa1b4003675bb05f71a91810d6cbd6df2761ec5d34a6993adf6b5"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "fredman-komlos-szemeredi-static-perfect-hashing-1984",
    "entry_id": "fredman-komlos-szemeredi-static-perfect-hashing-1984",
    "revision": 1,
    "title": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup",
    "context": "Computer science",
    "track": "Computer science",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "The paper constructed static sparse-set representations with constant worst-case membership query time and linear space, then refined word storage to n plus a sublinear remainder under its stated model.",
    "scope": "The paper constructed static sparse-set representations with constant worst-case membership query time and linear space, then refined word storage to n plus a sublinear remainder under its stated model. The result concerns a static key set and the specified word-RAM/hash-family assumptions. Randomized construction can produce linear-space storage with worst-case constant lookup, but construction and lookup guarantees are different. It does not provide unrestricted dynamic updates, adversarial chosen-key security or free computation on arbitrarily long keys. Implementation constants and practical throughput have not been replayed.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — exact original scientific paper",
        "url": "https://www.cs.umd.edu/~gasarch/BLOGPAPERS/FKS.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — publisher deposit",
        "url": "https://api.crossref.org/works/10.1145%2F828.1884",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Michael L. Fredman",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "János Komlós",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "Endre Szemerédi",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:0f2d6c47-664c-4f91-a03f-126ba2f081da",
      "version": 1,
      "content_hash": "sha256:596ceb6fe3afa1b4003675bb05f71a91810d6cbd6df2761ec5d34a6993adf6b5"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "140000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}