{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:V2I5WMD4AQQJLLJ3I3ZFQEM4BY","short_pith_number":"pith:V2I5WMD4","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"},"canonical_sha256":"ae91db307c042095ad3b46f258119c0e093038c1bd5349cc264f51b5620248ee","source":{"kind":"arxiv","id":"1309.7375","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7375","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7375v2","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7375","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"V2I5WMD4AQQJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"V2I5WMD4AQQJLLJ3","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"V2I5WMD4","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:V2I5WMD4AQQJLLJ3I3ZFQEM4BY","target":"record","payload":{"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"},"canonical_sha256":"ae91db307c042095ad3b46f258119c0e093038c1bd5349cc264f51b5620248ee","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"},"source_kind":"arxiv","source_id":"1309.7375","source_version":2,"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:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2I07MgGOXupIHxMTFKAjEVge/kleZX6oURm4H+jFw50hql8dOnR9Q7Al0R4s9Sa8ii/iUZvP8mJ1wd30phArDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:37:38.406016Z"},"content_sha256":"b2f751072892f9d1fb1ece5ed97853e351c980bd370837f2303c13452e3ee9b6","schema_version":"1.0","event_id":"sha256:b2f751072892f9d1fb1ece5ed97853e351c980bd370837f2303c13452e3ee9b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:V2I5WMD4AQQJLLJ3I3ZFQEM4BY","target":"graph","payload":{"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"},"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:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xgSGpGRYjxl8q6NvneYYy2CfX42PF/83ClX7et9WC8C7lQuj5c5Uf0PPsWKTIR6B87xBmwz8hUMcCk/aBhkOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:37:38.406376Z"},"content_sha256":"5d2edb40fb69a4abdb6085811057a91f2dd69da64ae24a9235b7b1d3ec50f541","schema_version":"1.0","event_id":"sha256:5d2edb40fb69a4abdb6085811057a91f2dd69da64ae24a9235b7b1d3ec50f541"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/bundle.json","state_url":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/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-03T03:37:38Z","links":{"resolver":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY","bundle":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/bundle.json","state":"https://pith.science/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2I5WMD4AQQJLLJ3I3ZFQEM4BY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V2I5WMD4AQQJLLJ3I3ZFQEM4BY","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":"7defc5729fc7d015c2201f42c182cbd9e21d3070f7bc29c35312e23f829a7463","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-27T21:54:31Z","title_canon_sha256":"2693865fa874dd9f34b4a8289d1ade0a19827a15e7194bc1f360e6d64284c89a"},"schema_version":"1.0","source":{"id":"1309.7375","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7375","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7375v2","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7375","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"V2I5WMD4AQQJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"V2I5WMD4AQQJLLJ3","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"V2I5WMD4","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:5d2edb40fb69a4abdb6085811057a91f2dd69da64ae24a9235b7b1d3ec50f541","target":"graph","created_at":"2026-05-18T01:58:27Z","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":"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.","authors_text":"Klas Markstr\\\"om, Victor Falgas-Ravry","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-27T21:54:31Z","title":"Random subcube intersection graphs I: cliques and covering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7375","kind":"arxiv","version":2},"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:b2f751072892f9d1fb1ece5ed97853e351c980bd370837f2303c13452e3ee9b6","target":"record","created_at":"2026-05-18T01:58:27Z","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":"7defc5729fc7d015c2201f42c182cbd9e21d3070f7bc29c35312e23f829a7463","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-27T21:54:31Z","title_canon_sha256":"2693865fa874dd9f34b4a8289d1ade0a19827a15e7194bc1f360e6d64284c89a"},"schema_version":"1.0","source":{"id":"1309.7375","kind":"arxiv","version":2}},"canonical_sha256":"ae91db307c042095ad3b46f258119c0e093038c1bd5349cc264f51b5620248ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae91db307c042095ad3b46f258119c0e093038c1bd5349cc264f51b5620248ee","first_computed_at":"2026-05-18T01:58:27.405722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:27.405722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EwY8deTrN1hJezgWuJ7c2wmu3m2TYLX9c4G9XIBn6IeuVSaJTNGADNgM8YSmUNCI5MBtGNnDXWjr0qnbZM81DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:27.406262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7375","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2f751072892f9d1fb1ece5ed97853e351c980bd370837f2303c13452e3ee9b6","sha256:5d2edb40fb69a4abdb6085811057a91f2dd69da64ae24a9235b7b1d3ec50f541"],"state_sha256":"61d4e164046f6fdf1060d6e4947f826638030d507887435132d0ed68e3546d29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOiwioVUMND+ohfirAZbwfP157Vm0NBJ3JOGuiDRMXsnJziLQm4R4S0ouwU7zCVNtQgGxDXTp6vgLjuYSUvNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:37:38.408335Z","bundle_sha256":"1540c5f1429446bd7ccbacddf69a0aed3a0e677343dcaf3ec9d8c9418cefab95"}}