{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:A4Y3EWLQNLRVDSQ7SUYGRM5ZSB","short_pith_number":"pith:A4Y3EWLQ","canonical_record":{"source":{"id":"1609.01699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T19:07:00Z","cross_cats_sorted":[],"title_canon_sha256":"e3a2bbcbd46222bb20ef8ccd267da98a67bf66a70afb905b46a67060919f1183","abstract_canon_sha256":"ee37d8a7bcbe5fa076db0254937939b064370fdc687a5405fa7e30b2a0c0a069"},"schema_version":"1.0"},"canonical_sha256":"0731b259706ae351ca1f953068b3b9906b321f5b9ec577d56408b490f26f703e","source":{"kind":"arxiv","id":"1609.01699","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01699","created_at":"2026-05-18T01:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01699v1","created_at":"2026-05-18T01:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01699","created_at":"2026-05-18T01:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"A4Y3EWLQNLRV","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A4Y3EWLQNLRVDSQ7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A4Y3EWLQ","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:A4Y3EWLQNLRVDSQ7SUYGRM5ZSB","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T19:07:00Z","cross_cats_sorted":[],"title_canon_sha256":"e3a2bbcbd46222bb20ef8ccd267da98a67bf66a70afb905b46a67060919f1183","abstract_canon_sha256":"ee37d8a7bcbe5fa076db0254937939b064370fdc687a5405fa7e30b2a0c0a069"},"schema_version":"1.0"},"canonical_sha256":"0731b259706ae351ca1f953068b3b9906b321f5b9ec577d56408b490f26f703e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:38.969520Z","signature_b64":"Q2CuR09s5As/8IYyQuZAN0oifOmlGyuQZdTy85YtaRN6o1qjCsRL/uyi55MWif7LSHI8rX2W64gj8fCP7lFjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0731b259706ae351ca1f953068b3b9906b321f5b9ec577d56408b490f26f703e","last_reissued_at":"2026-05-18T01:05:38.968940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:38.968940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01699","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-18T01:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gRT3gKcvcoW8JEPBD2T3cW8/ccHmSebkJacOboA5gINTgONBOiKvEUQO0RB5ZJiY4ZvnZysNsLWXnNtG5k23Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:46:49.174401Z"},"content_sha256":"c6a95c75dc54371e2c7ecf13df92dfd3e4bc1bb48e2fa25c3095577c4af606f2","schema_version":"1.0","event_id":"sha256:c6a95c75dc54371e2c7ecf13df92dfd3e4bc1bb48e2fa25c3095577c4af606f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:A4Y3EWLQNLRVDSQ7SUYGRM5ZSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Poisson approximation of counts of subgraphs in random intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dudley Stark, Katarzyna Rybarczyk","submitted_at":"2016-09-06T19:07:00Z","abstract_excerpt":"Random intersection graphs are characterized by three parameters: $n$, $m$ and $p$, where $n$ is the number of vertices, $m$ is the number of objects, and $p$ is the probability that a given object is associated with a given vertex. Two vertices in a random intersection graph are adjacent if and only if they have an associated object in common. When $m=\\lfloor n^\\alpha\\rfloor$ for constant $\\alpha$, we provide a condition, called {\\em strictly $\\alpha$-balanced}, for the Poisson convergence of the number of induced copies of a fixed subgraph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01699","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-18T01:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKIWFmoHuSTYG0Q4HZoblKEuQAHxfSvnUs6vT1u7GMEE+9eCZfBK1+CBRAQqFZlafymDuZmiXppQXdw8xqBtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:46:49.174956Z"},"content_sha256":"2913afae99d23ebc6c907c13ae647e7bcbebbf29a3fe0afea47413379ab5532e","schema_version":"1.0","event_id":"sha256:2913afae99d23ebc6c907c13ae647e7bcbebbf29a3fe0afea47413379ab5532e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/bundle.json","state_url":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/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-11T20:46:49Z","links":{"resolver":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB","bundle":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/bundle.json","state":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:A4Y3EWLQNLRVDSQ7SUYGRM5ZSB","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":"ee37d8a7bcbe5fa076db0254937939b064370fdc687a5405fa7e30b2a0c0a069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T19:07:00Z","title_canon_sha256":"e3a2bbcbd46222bb20ef8ccd267da98a67bf66a70afb905b46a67060919f1183"},"schema_version":"1.0","source":{"id":"1609.01699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01699","created_at":"2026-05-18T01:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01699v1","created_at":"2026-05-18T01:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01699","created_at":"2026-05-18T01:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"A4Y3EWLQNLRV","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A4Y3EWLQNLRVDSQ7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A4Y3EWLQ","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:2913afae99d23ebc6c907c13ae647e7bcbebbf29a3fe0afea47413379ab5532e","target":"graph","created_at":"2026-05-18T01:05:38Z","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 intersection graphs are characterized by three parameters: $n$, $m$ and $p$, where $n$ is the number of vertices, $m$ is the number of objects, and $p$ is the probability that a given object is associated with a given vertex. Two vertices in a random intersection graph are adjacent if and only if they have an associated object in common. When $m=\\lfloor n^\\alpha\\rfloor$ for constant $\\alpha$, we provide a condition, called {\\em strictly $\\alpha$-balanced}, for the Poisson convergence of the number of induced copies of a fixed subgraph.","authors_text":"Dudley Stark, Katarzyna Rybarczyk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T19:07:00Z","title":"Poisson approximation of counts of subgraphs in random intersection graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01699","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:c6a95c75dc54371e2c7ecf13df92dfd3e4bc1bb48e2fa25c3095577c4af606f2","target":"record","created_at":"2026-05-18T01:05:38Z","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":"ee37d8a7bcbe5fa076db0254937939b064370fdc687a5405fa7e30b2a0c0a069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T19:07:00Z","title_canon_sha256":"e3a2bbcbd46222bb20ef8ccd267da98a67bf66a70afb905b46a67060919f1183"},"schema_version":"1.0","source":{"id":"1609.01699","kind":"arxiv","version":1}},"canonical_sha256":"0731b259706ae351ca1f953068b3b9906b321f5b9ec577d56408b490f26f703e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0731b259706ae351ca1f953068b3b9906b321f5b9ec577d56408b490f26f703e","first_computed_at":"2026-05-18T01:05:38.968940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:38.968940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q2CuR09s5As/8IYyQuZAN0oifOmlGyuQZdTy85YtaRN6o1qjCsRL/uyi55MWif7LSHI8rX2W64gj8fCP7lFjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:38.969520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6a95c75dc54371e2c7ecf13df92dfd3e4bc1bb48e2fa25c3095577c4af606f2","sha256:2913afae99d23ebc6c907c13ae647e7bcbebbf29a3fe0afea47413379ab5532e"],"state_sha256":"0651607c20f025195e8e8e8682781bdcac5ffbe92d20856ea4d33ed185dac365"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"op6tMaGXZ3V/BbR613jv0NczeiAoa+TmY5i5TMxPfrCT30Oxd54ZUGQEmKHFg3iiKPM/qG2BuKSvfkpksjsQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:46:49.177720Z","bundle_sha256":"cde887eab8e551ec5af7caf0d01c55c46b942e18116c5180fe8c053d83e3845f"}}