{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AKDN2YXSCQSUBL2WO3TNKSNLYO","short_pith_number":"pith:AKDN2YXS","canonical_record":{"source":{"id":"1502.07591","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-26T15:22:02Z","cross_cats_sorted":["cond-mat.stat-mech","math.CO","math.PR"],"title_canon_sha256":"1c266f9efffdb69023fe75732c1e69e91356953967466e4ccd1ba0ac8702fbf9","abstract_canon_sha256":"c18f45bb1453e9b029bfd17ec9879059bdd218ad78f920032f42bb4282d03807"},"schema_version":"1.0"},"canonical_sha256":"0286dd62f2142540af5676e6d549abc380c01777f1c06edfae2e4a53d50d5721","source":{"kind":"arxiv","id":"1502.07591","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07591","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07591v3","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07591","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"AKDN2YXSCQSU","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AKDN2YXSCQSUBL2W","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AKDN2YXS","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AKDN2YXSCQSUBL2WO3TNKSNLYO","target":"record","payload":{"canonical_record":{"source":{"id":"1502.07591","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-26T15:22:02Z","cross_cats_sorted":["cond-mat.stat-mech","math.CO","math.PR"],"title_canon_sha256":"1c266f9efffdb69023fe75732c1e69e91356953967466e4ccd1ba0ac8702fbf9","abstract_canon_sha256":"c18f45bb1453e9b029bfd17ec9879059bdd218ad78f920032f42bb4282d03807"},"schema_version":"1.0"},"canonical_sha256":"0286dd62f2142540af5676e6d549abc380c01777f1c06edfae2e4a53d50d5721","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:39.907354Z","signature_b64":"TZ3ZtL5/kef3Rtom6epcwB/56f1GkyAFGs7sWEAizhWZMxujIRrZXdrNS0NopHaiGGDsBCSGU9n7D1XbrpxdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0286dd62f2142540af5676e6d549abc380c01777f1c06edfae2e4a53d50d5721","last_reissued_at":"2026-05-18T02:25:39.906980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:39.906980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.07591","source_version":3,"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-18T02:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzgu70Wv6Em3wGSxe7hIx+CX/2HlBY+uJ1CMck6I3glE7ARVpXKgemNPkQPh5rmjGsXFis1jfPhlBPI0JLl4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:44:21.436538Z"},"content_sha256":"bbb77e1d11c463d5fd97e28750074b4886da4758bc0accf36d510afaa3fe7494","schema_version":"1.0","event_id":"sha256:bbb77e1d11c463d5fd97e28750074b4886da4758bc0accf36d510afaa3fe7494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AKDN2YXSCQSUBL2WO3TNKSNLYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The phase transition in random regular exact cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore","submitted_at":"2015-02-26T15:22:02Z","abstract_excerpt":"A $k$-uniform, $d$-regular instance of Exact Cover is a family of $m$ sets $F_{n,d,k} = \\{ S_j \\subseteq \\{1,...,n\\} \\}$, where each subset has size $k$ and each $1 \\le i \\le n$ is contained in $d$ of the $S_j$. It is satisfiable if there is a subset $T \\subseteq \\{1,...,n\\}$ such that $|T \\cap S_j|=1$ for all $j$. Alternately, we can consider it a $d$-regular instance of Positive 1-in-$k$ SAT, i.e., a Boolean formula with $m$ clauses and $n$ variables where each clause contains $k$ variables and demands that exactly one of them is true. We determine the satisfiability threshold for random ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07591","kind":"arxiv","version":3},"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-18T02:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PnXK5UZ1k0N+Gfuxp6cLYxY44KPph/ekVtLT0rdUr1dSxLc0YpILiyjbHIVI3i06s5gx+Bv1TDG7v4cKNAg5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:44:21.436892Z"},"content_sha256":"7021359744227b7d8a2f44c18d453ae1c2d3b082000bd9c2c5a367805178fa10","schema_version":"1.0","event_id":"sha256:7021359744227b7d8a2f44c18d453ae1c2d3b082000bd9c2c5a367805178fa10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKDN2YXSCQSUBL2WO3TNKSNLYO/bundle.json","state_url":"https://pith.science/pith/AKDN2YXSCQSUBL2WO3TNKSNLYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKDN2YXSCQSUBL2WO3TNKSNLYO/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-03T16:44:21Z","links":{"resolver":"https://pith.science/pith/AKDN2YXSCQSUBL2WO3TNKSNLYO","bundle":"https://pith.science/pith/AKDN2YXSCQSUBL2WO3TNKSNLYO/bundle.json","state":"https://pith.science/pith/AKDN2YXSCQSUBL2WO3TNKSNLYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKDN2YXSCQSUBL2WO3TNKSNLYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AKDN2YXSCQSUBL2WO3TNKSNLYO","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":"c18f45bb1453e9b029bfd17ec9879059bdd218ad78f920032f42bb4282d03807","cross_cats_sorted":["cond-mat.stat-mech","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-26T15:22:02Z","title_canon_sha256":"1c266f9efffdb69023fe75732c1e69e91356953967466e4ccd1ba0ac8702fbf9"},"schema_version":"1.0","source":{"id":"1502.07591","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07591","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07591v3","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07591","created_at":"2026-05-18T02:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"AKDN2YXSCQSU","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AKDN2YXSCQSUBL2W","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AKDN2YXS","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:7021359744227b7d8a2f44c18d453ae1c2d3b082000bd9c2c5a367805178fa10","target":"graph","created_at":"2026-05-18T02:25:39Z","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":"A $k$-uniform, $d$-regular instance of Exact Cover is a family of $m$ sets $F_{n,d,k} = \\{ S_j \\subseteq \\{1,...,n\\} \\}$, where each subset has size $k$ and each $1 \\le i \\le n$ is contained in $d$ of the $S_j$. It is satisfiable if there is a subset $T \\subseteq \\{1,...,n\\}$ such that $|T \\cap S_j|=1$ for all $j$. Alternately, we can consider it a $d$-regular instance of Positive 1-in-$k$ SAT, i.e., a Boolean formula with $m$ clauses and $n$ variables where each clause contains $k$ variables and demands that exactly one of them is true. We determine the satisfiability threshold for random ins","authors_text":"Cristopher Moore","cross_cats":["cond-mat.stat-mech","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-26T15:22:02Z","title":"The phase transition in random regular exact cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07591","kind":"arxiv","version":3},"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:bbb77e1d11c463d5fd97e28750074b4886da4758bc0accf36d510afaa3fe7494","target":"record","created_at":"2026-05-18T02:25:39Z","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":"c18f45bb1453e9b029bfd17ec9879059bdd218ad78f920032f42bb4282d03807","cross_cats_sorted":["cond-mat.stat-mech","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-26T15:22:02Z","title_canon_sha256":"1c266f9efffdb69023fe75732c1e69e91356953967466e4ccd1ba0ac8702fbf9"},"schema_version":"1.0","source":{"id":"1502.07591","kind":"arxiv","version":3}},"canonical_sha256":"0286dd62f2142540af5676e6d549abc380c01777f1c06edfae2e4a53d50d5721","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0286dd62f2142540af5676e6d549abc380c01777f1c06edfae2e4a53d50d5721","first_computed_at":"2026-05-18T02:25:39.906980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:39.906980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TZ3ZtL5/kef3Rtom6epcwB/56f1GkyAFGs7sWEAizhWZMxujIRrZXdrNS0NopHaiGGDsBCSGU9n7D1XbrpxdAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:39.907354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07591","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbb77e1d11c463d5fd97e28750074b4886da4758bc0accf36d510afaa3fe7494","sha256:7021359744227b7d8a2f44c18d453ae1c2d3b082000bd9c2c5a367805178fa10"],"state_sha256":"de10c02b45128e6067a7e9885f75933246426b447c3b1b85e4579a6940f32156"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L7iLA/GesxwE4ijw3kgF53m9fU+CcYmNZkZ/3Q99bdnL1zvVCDRaOUrbxv97dxRm8WwqVOBXlEkjTpIK8a+tBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:44:21.438939Z","bundle_sha256":"a98b833210db4c07f8b8b48b8d1b7cda6d16bff853503427e14ae749c57470ab"}}