{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A4Y3EWLQNLRVDSQ7SUYGRM5ZSB","short_pith_number":"pith:A4Y3EWLQ","schema_version":"1.0","canonical_sha256":"0731b259706ae351ca1f953068b3b9906b321f5b9ec577d56408b490f26f703e","source":{"kind":"arxiv","id":"1609.01699","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.01699","created_at":"2026-05-18T01:05:38.969008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.01699v1","created_at":"2026-05-18T01:05:38.969008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01699","created_at":"2026-05-18T01:05:38.969008+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4Y3EWLQNLRV","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4Y3EWLQNLRVDSQ7","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4Y3EWLQ","created_at":"2026-05-18T12:30:04.600751+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/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB","json":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB.json","graph_json":"https://pith.science/api/pith-number/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/graph.json","events_json":"https://pith.science/api/pith-number/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/events.json","paper":"https://pith.science/paper/A4Y3EWLQ"},"agent_actions":{"view_html":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB","download_json":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB.json","view_paper":"https://pith.science/paper/A4Y3EWLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.01699&json=true","fetch_graph":"https://pith.science/api/pith-number/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/graph.json","fetch_events":"https://pith.science/api/pith-number/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/action/storage_attestation","attest_author":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/action/author_attestation","sign_citation":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/action/citation_signature","submit_replication":"https://pith.science/pith/A4Y3EWLQNLRVDSQ7SUYGRM5ZSB/action/replication_record"}},"created_at":"2026-05-18T01:05:38.969008+00:00","updated_at":"2026-05-18T01:05:38.969008+00:00"}