{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6ZYTCNPF3GTARP25JLVHVJCWE6","short_pith_number":"pith:6ZYTCNPF","schema_version":"1.0","canonical_sha256":"f6713135e5d9a608bf5d4aea7aa456279e86083f1d86952ccddfc373f3c0bf37","source":{"kind":"arxiv","id":"1302.4627","version":2},"attestation_state":"computed","paper":{"title":"Large cliques in sparse random intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Mindaugas Bloznelis, Valentas Kurauskas","submitted_at":"2013-02-19T14:50:30Z","abstract_excerpt":"Given positive integers n and m, and a probability measure P on {0, 1, ..., m} the random intersection graph G(n,m,P) on vertex set V = {1,2, ..., n} and with attribute set W = {w_1, w_2, ..., w_m} is defined as follows. Let S_1, S_2, ..., S_n be independent random subsets of W such that for any v \\in V and any S \\subseteq W we have \\pr(S_v = S) = P(|S|) / \\binom (m, |S|). The edge set of G(n,m,P) consists of those pairs {u,v} V for which S_u and S_v intersect.\n  We study the asymptotic order of the clique number \\omega(G(n,m,P)) in random intersection graphs with bounded expected degrees. For"},"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":"1302.4627","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-19T14:50:30Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"d1c7675ab72ba00f654ad1adb3a04cbbaa18c3e172e91df69d54102f0d9314d3","abstract_canon_sha256":"4f29c46a8c1f6dee422604e12a26d9de84b372d34f9f2812c63daee4d380510d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:03.074092Z","signature_b64":"EovK+qaMZb4Zhi5KuGHyfDrG/LxFB5+8RBrOZ3LNhxztJsPawDP+7xGx+tpLcBnhO5/VIZmk63qjTZOZb9+xAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6713135e5d9a608bf5d4aea7aa456279e86083f1d86952ccddfc373f3c0bf37","last_reissued_at":"2026-05-18T00:28:03.073427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:03.073427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large cliques in sparse random intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Mindaugas Bloznelis, Valentas Kurauskas","submitted_at":"2013-02-19T14:50:30Z","abstract_excerpt":"Given positive integers n and m, and a probability measure P on {0, 1, ..., m} the random intersection graph G(n,m,P) on vertex set V = {1,2, ..., n} and with attribute set W = {w_1, w_2, ..., w_m} is defined as follows. Let S_1, S_2, ..., S_n be independent random subsets of W such that for any v \\in V and any S \\subseteq W we have \\pr(S_v = S) = P(|S|) / \\binom (m, |S|). The edge set of G(n,m,P) consists of those pairs {u,v} V for which S_u and S_v intersect.\n  We study the asymptotic order of the clique number \\omega(G(n,m,P)) in random intersection graphs with bounded expected degrees. For"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4627","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":"1302.4627","created_at":"2026-05-18T00:28:03.073525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4627v2","created_at":"2026-05-18T00:28:03.073525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4627","created_at":"2026-05-18T00:28:03.073525+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZYTCNPF3GTA","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZYTCNPF3GTARP25","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZYTCNPF","created_at":"2026-05-18T12:27:36.564083+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/6ZYTCNPF3GTARP25JLVHVJCWE6","json":"https://pith.science/pith/6ZYTCNPF3GTARP25JLVHVJCWE6.json","graph_json":"https://pith.science/api/pith-number/6ZYTCNPF3GTARP25JLVHVJCWE6/graph.json","events_json":"https://pith.science/api/pith-number/6ZYTCNPF3GTARP25JLVHVJCWE6/events.json","paper":"https://pith.science/paper/6ZYTCNPF"},"agent_actions":{"view_html":"https://pith.science/pith/6ZYTCNPF3GTARP25JLVHVJCWE6","download_json":"https://pith.science/pith/6ZYTCNPF3GTARP25JLVHVJCWE6.json","view_paper":"https://pith.science/paper/6ZYTCNPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4627&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZYTCNPF3GTARP25JLVHVJCWE6/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZYTCNPF3GTARP25JLVHVJCWE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZYTCNPF3GTARP25JLVHVJCWE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZYTCNPF3GTARP25JLVHVJCWE6/action/storage_attestation","attest_author":"https://pith.science/pith/6ZYTCNPF3GTARP25JLVHVJCWE6/action/author_attestation","sign_citation":"https://pith.science/pith/6ZYTCNPF3GTARP25JLVHVJCWE6/action/citation_signature","submit_replication":"https://pith.science/pith/6ZYTCNPF3GTARP25JLVHVJCWE6/action/replication_record"}},"created_at":"2026-05-18T00:28:03.073525+00:00","updated_at":"2026-05-18T00:28:03.073525+00:00"}