{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:V2I5WMD4AQQJLLJ3I3ZFQEM4BY","short_pith_number":"pith:V2I5WMD4","schema_version":"1.0","canonical_sha256":"ae91db307c042095ad3b46f258119c0e093038c1bd5349cc264f51b5620248ee","source":{"kind":"arxiv","id":"1309.7375","version":2},"attestation_state":"computed","paper":{"title":"Random subcube intersection graphs I: cliques and covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Klas Markstr\\\"om, Victor Falgas-Ravry","submitted_at":"2013-09-27T21:54:31Z","abstract_excerpt":"We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their intersection is non-empty. Our motivation for considering such graphs is to model `random compatibility' between vertices in a large network. For both of the models considered in this paper, we determine the thresholds for covering the underlying hypercube $Q_d$ and for the appearance of s-cliques. In addition we pose some open problems."},"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":"1309.7375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-27T21:54:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2693865fa874dd9f34b4a8289d1ade0a19827a15e7194bc1f360e6d64284c89a","abstract_canon_sha256":"7defc5729fc7d015c2201f42c182cbd9e21d3070f7bc29c35312e23f829a7463"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:27.406262Z","signature_b64":"EwY8deTrN1hJezgWuJ7c2wmu3m2TYLX9c4G9XIBn6IeuVSaJTNGADNgM8YSmUNCI5MBtGNnDXWjr0qnbZM81DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae91db307c042095ad3b46f258119c0e093038c1bd5349cc264f51b5620248ee","last_reissued_at":"2026-05-18T01:58:27.405722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:27.405722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random subcube intersection graphs I: cliques and covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Klas Markstr\\\"om, Victor Falgas-Ravry","submitted_at":"2013-09-27T21:54:31Z","abstract_excerpt":"We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their intersection is non-empty. Our motivation for considering such graphs is to model `random compatibility' between vertices in a large network. For both of the models considered in this paper, we determine the thresholds for covering the underlying hypercube $Q_d$ and for the appearance of s-cliques. In addition we pose some open problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7375","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":"1309.7375","created_at":"2026-05-18T01:58:27.405795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7375v2","created_at":"2026-05-18T01:58:27.405795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7375","created_at":"2026-05-18T01:58:27.405795+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2I5WMD4AQQJ","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2I5WMD4AQQJLLJ3","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2I5WMD4","created_at":"2026-05-18T12:28:02.375192+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/V2I5WMD4AQQJLLJ3I3ZFQEM4BY","json":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY.json","graph_json":"https://pith.science/api/pith-number/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/graph.json","events_json":"https://pith.science/api/pith-number/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/events.json","paper":"https://pith.science/paper/V2I5WMD4"},"agent_actions":{"view_html":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY","download_json":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY.json","view_paper":"https://pith.science/paper/V2I5WMD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7375&json=true","fetch_graph":"https://pith.science/api/pith-number/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/graph.json","fetch_events":"https://pith.science/api/pith-number/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/action/storage_attestation","attest_author":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/action/author_attestation","sign_citation":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/action/citation_signature","submit_replication":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/action/replication_record"}},"created_at":"2026-05-18T01:58:27.405795+00:00","updated_at":"2026-05-18T01:58:27.405795+00:00"}