{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2FMDL7R7DOEMWDFGOBYIOZMWVQ","short_pith_number":"pith:2FMDL7R7","schema_version":"1.0","canonical_sha256":"d15835fe3f1b88cb0ca67070876596ac23f2413b05ae36fb8ea0c9ac80357f2d","source":{"kind":"arxiv","id":"1404.4622","version":1},"attestation_state":"computed","paper":{"title":"Set Families with Low Pairwise Intersection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Calvin Beideman, Jeremiah Blocki","submitted_at":"2014-04-17T19:38:20Z","abstract_excerpt":"A $\\left(n,\\ell,\\gamma\\right)$-sharing set family of size $m$ is a family of sets $S_1,\\ldots,S_m\\subseteq [n]$ s.t. each set has size $\\ell$ and each pair of sets shares at most $\\gamma$ elements. We let $m\\left(n,\\ell,\\gamma\\right)$ denote the maximum size of any such set family and we consider the following question: How large can $m\\left(n,\\ell,\\gamma\\right)$ be? $\\left(n,\\ell,\\gamma\\right)$-sharing set families have a rich set of applications including the construction of pseudorandom number generators and usable and secure password management schemes. We analyze the explicit construction"},"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":"1404.4622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-17T19:38:20Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0b480a72a843579656854601a85eb4111b81b1554cfe6c937b3a6806d277291b","abstract_canon_sha256":"d63aefcc5c5b94e0c30bc5c12331eef6a1a85b6633715a679f3f9301b2da2b3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:03.825431Z","signature_b64":"QR70YOsEZgKsSWOl7dsoTwPeKtRsSedy9i2nv0Mo7GJYJ1OuPwSnx3Bb6RpM0uDcd3ddTfLwMH92owCNs4q8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d15835fe3f1b88cb0ca67070876596ac23f2413b05ae36fb8ea0c9ac80357f2d","last_reissued_at":"2026-05-18T02:54:03.824922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:03.824922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set Families with Low Pairwise Intersection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Calvin Beideman, Jeremiah Blocki","submitted_at":"2014-04-17T19:38:20Z","abstract_excerpt":"A $\\left(n,\\ell,\\gamma\\right)$-sharing set family of size $m$ is a family of sets $S_1,\\ldots,S_m\\subseteq [n]$ s.t. each set has size $\\ell$ and each pair of sets shares at most $\\gamma$ elements. We let $m\\left(n,\\ell,\\gamma\\right)$ denote the maximum size of any such set family and we consider the following question: How large can $m\\left(n,\\ell,\\gamma\\right)$ be? $\\left(n,\\ell,\\gamma\\right)$-sharing set families have a rich set of applications including the construction of pseudorandom number generators and usable and secure password management schemes. We analyze the explicit construction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4622","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":"1404.4622","created_at":"2026-05-18T02:54:03.825000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4622v1","created_at":"2026-05-18T02:54:03.825000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4622","created_at":"2026-05-18T02:54:03.825000+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FMDL7R7DOEM","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FMDL7R7DOEMWDFG","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FMDL7R7","created_at":"2026-05-18T12:28:09.283467+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/2FMDL7R7DOEMWDFGOBYIOZMWVQ","json":"https://pith.science/pith/2FMDL7R7DOEMWDFGOBYIOZMWVQ.json","graph_json":"https://pith.science/api/pith-number/2FMDL7R7DOEMWDFGOBYIOZMWVQ/graph.json","events_json":"https://pith.science/api/pith-number/2FMDL7R7DOEMWDFGOBYIOZMWVQ/events.json","paper":"https://pith.science/paper/2FMDL7R7"},"agent_actions":{"view_html":"https://pith.science/pith/2FMDL7R7DOEMWDFGOBYIOZMWVQ","download_json":"https://pith.science/pith/2FMDL7R7DOEMWDFGOBYIOZMWVQ.json","view_paper":"https://pith.science/paper/2FMDL7R7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4622&json=true","fetch_graph":"https://pith.science/api/pith-number/2FMDL7R7DOEMWDFGOBYIOZMWVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/2FMDL7R7DOEMWDFGOBYIOZMWVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FMDL7R7DOEMWDFGOBYIOZMWVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FMDL7R7DOEMWDFGOBYIOZMWVQ/action/storage_attestation","attest_author":"https://pith.science/pith/2FMDL7R7DOEMWDFGOBYIOZMWVQ/action/author_attestation","sign_citation":"https://pith.science/pith/2FMDL7R7DOEMWDFGOBYIOZMWVQ/action/citation_signature","submit_replication":"https://pith.science/pith/2FMDL7R7DOEMWDFGOBYIOZMWVQ/action/replication_record"}},"created_at":"2026-05-18T02:54:03.825000+00:00","updated_at":"2026-05-18T02:54:03.825000+00:00"}