{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VTFFJX4YHB55A5ZZ2LQMNCKJX3","short_pith_number":"pith:VTFFJX4Y","schema_version":"1.0","canonical_sha256":"acca54df98387bd07739d2e0c68949beef0bb0300858ff2284475bf17f0d1a33","source":{"kind":"arxiv","id":"1009.5791","version":1},"attestation_state":"computed","paper":{"title":"Fast Pseudo-Random Fingerprints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Yoram Bachrach","submitted_at":"2010-09-29T07:32:27Z","abstract_excerpt":"We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather then maintaining the full stream of $b$ items of a universe $[u]$, such methods only maintain a concise fingerprint of the stream, and perform computations using the fingerprints. The computations are done approximately, and the required fingerprint size $k$ depends on the desired accuracy $\\epsilon$ and confidence $\\delta$. Our technique maintains a single bit per hash function, rather than a single integer, thus requiring a fin"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1009.5791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T07:32:27Z","cross_cats_sorted":[],"title_canon_sha256":"87630cc4c1c0f069069b651f0b52c4e108e50bb630bd267ada061c0e6d469ef1","abstract_canon_sha256":"3ff4bcea4fef15d6e33c92cd8fb62b13f8792594fe47142cddab41000f504b06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:08.905406Z","signature_b64":"U67j0k3apR6PrWfWrx6hAKZe1wVAmzEyt1j3TwoEwTJ9Yx06Nu8/iWOu0DAKO7ydWV8bOU+r4WMTFLtfXoeeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acca54df98387bd07739d2e0c68949beef0bb0300858ff2284475bf17f0d1a33","last_reissued_at":"2026-05-18T04:40:08.904961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:08.904961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Pseudo-Random Fingerprints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Yoram Bachrach","submitted_at":"2010-09-29T07:32:27Z","abstract_excerpt":"We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather then maintaining the full stream of $b$ items of a universe $[u]$, such methods only maintain a concise fingerprint of the stream, and perform computations using the fingerprints. The computations are done approximately, and the required fingerprint size $k$ depends on the desired accuracy $\\epsilon$ and confidence $\\delta$. Our technique maintains a single bit per hash function, rather than a single integer, thus requiring a fin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5791","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1009.5791","created_at":"2026-05-18T04:40:08.905024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5791v1","created_at":"2026-05-18T04:40:08.905024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5791","created_at":"2026-05-18T04:40:08.905024+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTFFJX4YHB55","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTFFJX4YHB55A5ZZ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTFFJX4Y","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VTFFJX4YHB55A5ZZ2LQMNCKJX3","json":"https://pith.science/pith/VTFFJX4YHB55A5ZZ2LQMNCKJX3.json","graph_json":"https://pith.science/api/pith-number/VTFFJX4YHB55A5ZZ2LQMNCKJX3/graph.json","events_json":"https://pith.science/api/pith-number/VTFFJX4YHB55A5ZZ2LQMNCKJX3/events.json","paper":"https://pith.science/paper/VTFFJX4Y"},"agent_actions":{"view_html":"https://pith.science/pith/VTFFJX4YHB55A5ZZ2LQMNCKJX3","download_json":"https://pith.science/pith/VTFFJX4YHB55A5ZZ2LQMNCKJX3.json","view_paper":"https://pith.science/paper/VTFFJX4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5791&json=true","fetch_graph":"https://pith.science/api/pith-number/VTFFJX4YHB55A5ZZ2LQMNCKJX3/graph.json","fetch_events":"https://pith.science/api/pith-number/VTFFJX4YHB55A5ZZ2LQMNCKJX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTFFJX4YHB55A5ZZ2LQMNCKJX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTFFJX4YHB55A5ZZ2LQMNCKJX3/action/storage_attestation","attest_author":"https://pith.science/pith/VTFFJX4YHB55A5ZZ2LQMNCKJX3/action/author_attestation","sign_citation":"https://pith.science/pith/VTFFJX4YHB55A5ZZ2LQMNCKJX3/action/citation_signature","submit_replication":"https://pith.science/pith/VTFFJX4YHB55A5ZZ2LQMNCKJX3/action/replication_record"}},"created_at":"2026-05-18T04:40:08.905024+00:00","updated_at":"2026-05-18T04:40:08.905024+00:00"}