{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7M75T4NLLII3TNON3Y7FXCEXLY","short_pith_number":"pith:7M75T4NL","schema_version":"1.0","canonical_sha256":"fb3fd9f1ab5a11b9b5cdde3e5b88975e044494e75726b1bd5c67bda2b6acbeef","source":{"kind":"arxiv","id":"1502.00395","version":1},"attestation_state":"computed","paper":{"title":"Threshold Functions in Random s-Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.CO","math.PR"],"primary_cat":"physics.soc-ph","authors_text":"Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","submitted_at":"2015-02-02T08:32:01Z","abstract_excerpt":"Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an undirected edge in between if and only if they have at least $s$ common items. In particular, in a uniform random $s$-intersection graph, each vertex independently selects a fixed number of items uniformly at random from a common item pool, while in a binomial random $s$-intersection graph, each item in some item pool is independently attached to each vertex with t"},"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":"1502.00395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-02-02T08:32:01Z","cross_cats_sorted":["cs.DM","cs.SI","math.CO","math.PR"],"title_canon_sha256":"80c79a81e74e9a594875696cb0a0305c0051dbf2ab4210b12abcd69560c73a43","abstract_canon_sha256":"1b32ae1b1503f6e67890166dc31c4999f76521b5bbfbc62bc468f9a2955349e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:06.072438Z","signature_b64":"VKRBY9VcCOuIq+BjJ7BG1y97q11uQjtW14Cc0lO0tVvCsNkWnW5U11tmK7kSHBCrIG3wi5UD6Mz83xMa1VPtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb3fd9f1ab5a11b9b5cdde3e5b88975e044494e75726b1bd5c67bda2b6acbeef","last_reissued_at":"2026-05-18T02:28:06.072000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:06.072000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold Functions in Random s-Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.CO","math.PR"],"primary_cat":"physics.soc-ph","authors_text":"Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","submitted_at":"2015-02-02T08:32:01Z","abstract_excerpt":"Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an undirected edge in between if and only if they have at least $s$ common items. In particular, in a uniform random $s$-intersection graph, each vertex independently selects a fixed number of items uniformly at random from a common item pool, while in a binomial random $s$-intersection graph, each item in some item pool is independently attached to each vertex with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00395","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":"1502.00395","created_at":"2026-05-18T02:28:06.072083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00395v1","created_at":"2026-05-18T02:28:06.072083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00395","created_at":"2026-05-18T02:28:06.072083+00:00"},{"alias_kind":"pith_short_12","alias_value":"7M75T4NLLII3","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7M75T4NLLII3TNON","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7M75T4NL","created_at":"2026-05-18T12:29:10.953037+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/7M75T4NLLII3TNON3Y7FXCEXLY","json":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY.json","graph_json":"https://pith.science/api/pith-number/7M75T4NLLII3TNON3Y7FXCEXLY/graph.json","events_json":"https://pith.science/api/pith-number/7M75T4NLLII3TNON3Y7FXCEXLY/events.json","paper":"https://pith.science/paper/7M75T4NL"},"agent_actions":{"view_html":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY","download_json":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY.json","view_paper":"https://pith.science/paper/7M75T4NL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00395&json=true","fetch_graph":"https://pith.science/api/pith-number/7M75T4NLLII3TNON3Y7FXCEXLY/graph.json","fetch_events":"https://pith.science/api/pith-number/7M75T4NLLII3TNON3Y7FXCEXLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY/action/storage_attestation","attest_author":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY/action/author_attestation","sign_citation":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY/action/citation_signature","submit_replication":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY/action/replication_record"}},"created_at":"2026-05-18T02:28:06.072083+00:00","updated_at":"2026-05-18T02:28:06.072083+00:00"}