{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7M75T4NLLII3TNON3Y7FXCEXLY","short_pith_number":"pith:7M75T4NL","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"},"canonical_sha256":"fb3fd9f1ab5a11b9b5cdde3e5b88975e044494e75726b1bd5c67bda2b6acbeef","source":{"kind":"arxiv","id":"1502.00395","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00395","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00395v1","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00395","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"7M75T4NLLII3","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7M75T4NLLII3TNON","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7M75T4NL","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7M75T4NLLII3TNON3Y7FXCEXLY","target":"record","payload":{"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"},"canonical_sha256":"fb3fd9f1ab5a11b9b5cdde3e5b88975e044494e75726b1bd5c67bda2b6acbeef","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"},"source_kind":"arxiv","source_id":"1502.00395","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEh5stkTBtSBKfmec8aOhWUSqe7ENM3uPf+F+2uxD/Bpya4h7DaggP61+3qVP6nubd4SkRVP5qAn7S5HLj7GAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:59:17.816739Z"},"content_sha256":"4d83220ee5450871b915c80c7a2f2110cd5950a0312237242bc9f0e5704a049c","schema_version":"1.0","event_id":"sha256:4d83220ee5450871b915c80c7a2f2110cd5950a0312237242bc9f0e5704a049c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7M75T4NLLII3TNON3Y7FXCEXLY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DhHNvGjsfehRoL9wBRJhgfYcAVGXbS2AxMoFWZOYIP1awvj/2OFm5HcYUPrlvsrZumpiCYUMcTrk/VkXKa7MCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:59:17.817488Z"},"content_sha256":"d49ffbebd57094a5e526dc4db3f4f9fad8573a784ca4b0e987f83769473a65bf","schema_version":"1.0","event_id":"sha256:d49ffbebd57094a5e526dc4db3f4f9fad8573a784ca4b0e987f83769473a65bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY/bundle.json","state_url":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7M75T4NLLII3TNON3Y7FXCEXLY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T03:59:17Z","links":{"resolver":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY","bundle":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY/bundle.json","state":"https://pith.science/pith/7M75T4NLLII3TNON3Y7FXCEXLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7M75T4NLLII3TNON3Y7FXCEXLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7M75T4NLLII3TNON3Y7FXCEXLY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1b32ae1b1503f6e67890166dc31c4999f76521b5bbfbc62bc468f9a2955349e1","cross_cats_sorted":["cs.DM","cs.SI","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-02-02T08:32:01Z","title_canon_sha256":"80c79a81e74e9a594875696cb0a0305c0051dbf2ab4210b12abcd69560c73a43"},"schema_version":"1.0","source":{"id":"1502.00395","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00395","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00395v1","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00395","created_at":"2026-05-18T02:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"7M75T4NLLII3","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7M75T4NLLII3TNON","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7M75T4NL","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:d49ffbebd57094a5e526dc4db3f4f9fad8573a784ca4b0e987f83769473a65bf","target":"graph","created_at":"2026-05-18T02:28:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","cross_cats":["cs.DM","cs.SI","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-02-02T08:32:01Z","title":"Threshold Functions in Random s-Intersection Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00395","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4d83220ee5450871b915c80c7a2f2110cd5950a0312237242bc9f0e5704a049c","target":"record","created_at":"2026-05-18T02:28:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1b32ae1b1503f6e67890166dc31c4999f76521b5bbfbc62bc468f9a2955349e1","cross_cats_sorted":["cs.DM","cs.SI","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-02-02T08:32:01Z","title_canon_sha256":"80c79a81e74e9a594875696cb0a0305c0051dbf2ab4210b12abcd69560c73a43"},"schema_version":"1.0","source":{"id":"1502.00395","kind":"arxiv","version":1}},"canonical_sha256":"fb3fd9f1ab5a11b9b5cdde3e5b88975e044494e75726b1bd5c67bda2b6acbeef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb3fd9f1ab5a11b9b5cdde3e5b88975e044494e75726b1bd5c67bda2b6acbeef","first_computed_at":"2026-05-18T02:28:06.072000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:06.072000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VKRBY9VcCOuIq+BjJ7BG1y97q11uQjtW14Cc0lO0tVvCsNkWnW5U11tmK7kSHBCrIG3wi5UD6Mz83xMa1VPtAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:06.072438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00395","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d83220ee5450871b915c80c7a2f2110cd5950a0312237242bc9f0e5704a049c","sha256:d49ffbebd57094a5e526dc4db3f4f9fad8573a784ca4b0e987f83769473a65bf"],"state_sha256":"e87f7c7b71d3691c8d25c13b97dbb4f14cc60e34e9878756db6811c6629b6b4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q0Uxbi5s+VWbXXOLcg0rMs8GFE5Jcqyt3+IjuTdFdDo55WCmz5JCOL85zgtHZW6xVvtvU4PPl4kb9nhUoomDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:59:17.821904Z","bundle_sha256":"36f91446620c2aa70a920472297a1fb20a9d2f90685d9bbfcce26660a54ea95f"}}