{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:U3G4ZMG5YIKPWL2KF6RXDML2HG","short_pith_number":"pith:U3G4ZMG5","schema_version":"1.0","canonical_sha256":"a6cdccb0ddc214fb2f4a2fa371b17a39826828bc3dde4c2476d9268f1aef7c22","source":{"kind":"arxiv","id":"0910.5311","version":2},"attestation_state":"computed","paper":{"title":"Equivalence of the random intersection graph and G(n,p)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Katarzyna Rybarczyk","submitted_at":"2009-10-28T09:21:52Z","abstract_excerpt":"We solve the conjecture posed by Fill, Scheinerman and Singer-Cohen and show the equivalence of the sharp threshold functions of the random intersection graph G(n,m,p) with $m >= n^3$ and a graph in which each edge appears independently. Moreover we prove sharper equivalence results under some additional assumptions."},"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":"0910.5311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-28T09:21:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"1e79c44aef801fdb600116711ebc634166431ab3cc9cfe0ba629d6152e6a915b","abstract_canon_sha256":"1ffb380188818889edb9b78fe7d89665c1d3ef76e8ae079c10f4641e528a7c34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:44.496681Z","signature_b64":"q6HCIgkaswyOMU8c5FQ6EpjDdcMA9Tubfe/SkiZIWW7s4jCWW/vDy/B1KRg1fszqJj6O7DKl3KLTE/M/IfFIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6cdccb0ddc214fb2f4a2fa371b17a39826828bc3dde4c2476d9268f1aef7c22","last_reissued_at":"2026-05-18T02:29:44.496255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:44.496255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalence of the random intersection graph and G(n,p)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Katarzyna Rybarczyk","submitted_at":"2009-10-28T09:21:52Z","abstract_excerpt":"We solve the conjecture posed by Fill, Scheinerman and Singer-Cohen and show the equivalence of the sharp threshold functions of the random intersection graph G(n,m,p) with $m >= n^3$ and a graph in which each edge appears independently. Moreover we prove sharper equivalence results under some additional assumptions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5311","kind":"arxiv","version":2},"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":"0910.5311","created_at":"2026-05-18T02:29:44.496325+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.5311v2","created_at":"2026-05-18T02:29:44.496325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5311","created_at":"2026-05-18T02:29:44.496325+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3G4ZMG5YIKP","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3G4ZMG5YIKPWL2K","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3G4ZMG5","created_at":"2026-05-18T12:26:02.257875+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/U3G4ZMG5YIKPWL2KF6RXDML2HG","json":"https://pith.science/pith/U3G4ZMG5YIKPWL2KF6RXDML2HG.json","graph_json":"https://pith.science/api/pith-number/U3G4ZMG5YIKPWL2KF6RXDML2HG/graph.json","events_json":"https://pith.science/api/pith-number/U3G4ZMG5YIKPWL2KF6RXDML2HG/events.json","paper":"https://pith.science/paper/U3G4ZMG5"},"agent_actions":{"view_html":"https://pith.science/pith/U3G4ZMG5YIKPWL2KF6RXDML2HG","download_json":"https://pith.science/pith/U3G4ZMG5YIKPWL2KF6RXDML2HG.json","view_paper":"https://pith.science/paper/U3G4ZMG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.5311&json=true","fetch_graph":"https://pith.science/api/pith-number/U3G4ZMG5YIKPWL2KF6RXDML2HG/graph.json","fetch_events":"https://pith.science/api/pith-number/U3G4ZMG5YIKPWL2KF6RXDML2HG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3G4ZMG5YIKPWL2KF6RXDML2HG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3G4ZMG5YIKPWL2KF6RXDML2HG/action/storage_attestation","attest_author":"https://pith.science/pith/U3G4ZMG5YIKPWL2KF6RXDML2HG/action/author_attestation","sign_citation":"https://pith.science/pith/U3G4ZMG5YIKPWL2KF6RXDML2HG/action/citation_signature","submit_replication":"https://pith.science/pith/U3G4ZMG5YIKPWL2KF6RXDML2HG/action/replication_record"}},"created_at":"2026-05-18T02:29:44.496325+00:00","updated_at":"2026-05-18T02:29:44.496325+00:00"}