{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "bloom-hash-coding-1970",
    "title": "Bloom: space-time trade-offs in hash coding with allowable errors",
    "summary": "Analyzed approximate membership structures that reduce storage by allowing bounded false-positive membership errors, including the bit-array method now associated with Bloom filters.",
    "boundary": "The record is the exact 1970 Communications of the ACM paper. Conventional hashing, later Bloom-filter terminology, counting and quotient filters, cuckoo hashing and modern implementations remain separate.",
    "area": "Algorithms and data structures",
    "year": 1970,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "bloom-hash-coding-1970",
    "target": {
      "record_id": "urn:uuid:0de5cb62-4fe3-4baa-a0bf-cf075be861f7",
      "version": 1,
      "content_hash": "sha256:b725616ba9ea69bad8a9a82491a8f4335adde62c5067ae7a62f151afabaaf399"
    },
    "humans": [
      "Burton H. Bloom"
    ],
    "authors_complete": true,
    "human_role_note": "The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "princeton-bloom-filter-pdf",
        "title": "Princeton-hosted copy of Bloom hash-coding paper",
        "url": "https://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p422-bloom.pdf"
      },
      {
        "id": "crossref-bloom-hash-coding-1970",
        "title": "Crossref record for Bloom hash-coding paper",
        "url": "https://api.crossref.org/works/10.1145%2F362686.362692"
      }
    ],
    "geography": {
      "country_codes": [
        "US"
      ],
      "location_basis": "Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.",
      "source_url": "https://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p422-bloom.pdf",
      "target": {
        "record_id": "urn:uuid:0de5cb62-4fe3-4baa-a0bf-cf075be861f7",
        "version": 1,
        "content_hash": "sha256:b725616ba9ea69bad8a9a82491a8f4335adde62c5067ae7a62f151afabaaf399"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-09-26",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "Attribution source",
          "url": "https://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p422-bloom.pdf"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "US": "United States"
      }
    },
    "points": "130000",
    "published_grade": {
      "id": "bloom-hash-coding-1970",
      "entry_id": "bloom-hash-coding-1970",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:0de5cb62-4fe3-4baa-a0bf-cf075be861f7",
        "version": 1,
        "content_hash": "sha256:b725616ba9ea69bad8a9a82491a8f4335adde62c5067ae7a62f151afabaaf399"
      },
      "what_changed": "Analyzed approximate membership structures that reduce storage by allowing bounded false-positive membership errors, including the bit-array method now associated with Bloom filters.",
      "scope": "The record is the exact 1970 Communications of the ACM paper. Conventional hashing, later Bloom-filter terminology, counting and quotient filters, cuckoo hashing and modern implementations remain separate.",
      "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:0de5cb62-4fe3-4baa-a0bf-cf075be861f7",
        "version": 1,
        "content_hash": "sha256:b725616ba9ea69bad8a9a82491a8f4335adde62c5067ae7a62f151afabaaf399"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-09-25T00: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": "Burton H. Bloom",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Princeton-hosted copy of Bloom hash-coding paper",
            "url": "https://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p422-bloom.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Princeton-hosted copy of Bloom hash-coding paper",
            "url": "https://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p422-bloom.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Crossref record for Bloom hash-coding paper",
            "url": "https://api.crossref.org/works/10.1145%2F362686.362692"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The record is the exact 1970 Communications of the ACM paper. Conventional hashing, later Bloom-filter terminology, counting and quotient filters, cuckoo hashing and modern implementations remain separate.",
        "domain": "Algorithms and data structures"
      },
      "sources": [
        {
          "citation": "Princeton-hosted copy of Bloom hash-coding paper",
          "url": "https://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p422-bloom.pdf"
        },
        {
          "citation": "Crossref record for Bloom hash-coding paper",
          "url": "https://api.crossref.org/works/10.1145%2F362686.362692"
        }
      ],
      "statement": "# Bloom: space-time trade-offs in hash coding with allowable errors\n\nAnalyzed approximate membership structures that reduce storage by allowing bounded false-positive membership errors, including the bit-array method now associated with Bloom filters.\n\n## Scientific scope\n\nThe record is the exact 1970 Communications of the ACM paper. Conventional hashing, later Bloom-filter terminology, counting and quotient filters, cuckoo hashing and modern implementations remain separate.\n\n## Reading status\n\nThis is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.\n\n## People and systems\n\nBurton H. Bloom\n\nThe named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.\n\n\n\n## Original sources\n\n- [Princeton-hosted copy of Bloom hash-coding paper](https://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p422-bloom.pdf)\n- [Crossref record for Bloom hash-coding paper](https://api.crossref.org/works/10.1145%2F362686.362692)\n",
      "summary": "Analyzed approximate membership structures that reduce storage by allowing bounded false-positive membership errors, including the bit-array method now associated with Bloom filters.",
      "title": "Bloom: space-time trade-offs in hash coding with allowable errors"
    },
    "record_id": "urn:uuid:0de5cb62-4fe3-4baa-a0bf-cf075be861f7",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:0de5cb62-4fe3-4baa-a0bf-cf075be861f7",
      "version": 1,
      "content_hash": "sha256:b725616ba9ea69bad8a9a82491a8f4335adde62c5067ae7a62f151afabaaf399"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:77210a1e0bbf070b7093dae422fbca6385f898c0a105d398987b97647cd7d499"
  },
  "target": {
    "record_id": "urn:uuid:0de5cb62-4fe3-4baa-a0bf-cf075be861f7",
    "version": 1,
    "content_hash": "sha256:b725616ba9ea69bad8a9a82491a8f4335adde62c5067ae7a62f151afabaaf399"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "bloom-hash-coding-1970",
    "entry_id": "bloom-hash-coding-1970",
    "revision": 1,
    "title": "Bloom: space-time trade-offs in hash coding with allowable errors",
    "context": "Algorithms and data structures",
    "track": "ALGORITHM",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-09-25",
    "evidence_cutoff": "2026-09-25",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Analyzed approximate membership structures that reduce storage by allowing bounded false-positive membership errors, including the bit-array method now associated with Bloom filters.",
    "scope": "The record is the exact 1970 Communications of the ACM paper. Conventional hashing, later Bloom-filter terminology, counting and quotient filters, cuckoo hashing and modern implementations remain separate.",
    "evidence_summary": "The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is the exact 1970 Communications of the ACM paper. Conventional hashing, later Bloom-filter terminology, counting and quotient filters, cuckoo hashing and modern implementations remain separate.",
    "references": [
      {
        "title": "Princeton-hosted copy of Bloom hash-coding paper",
        "url": "https://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p422-bloom.pdf",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      },
      {
        "title": "Crossref record for Bloom hash-coding paper",
        "url": "https://api.crossref.org/works/10.1145%2F362686.362692",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      }
    ],
    "roles": [
      {
        "who": "Burton H. Bloom",
        "credit": "SCIENCE",
        "did": "Named source author of the scoped work; individual effort shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:0de5cb62-4fe3-4baa-a0bf-cf075be861f7",
      "version": 1,
      "content_hash": "sha256:b725616ba9ea69bad8a9a82491a8f4335adde62c5067ae7a62f151afabaaf399"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "130000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}