{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PRF3HEFOG4XIW4B2EQYELZ4LTC","short_pith_number":"pith:PRF3HEFO","canonical_record":{"source":{"id":"1107.5377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-27T03:40:36Z","cross_cats_sorted":["cond-mat.dis-nn","math.PR"],"title_canon_sha256":"79bdfdb70263d046fc09df38efeac294e075e2382c1dfb275dc36c2ca1d0afa7","abstract_canon_sha256":"debb36b625d359e815d705cdd76610399d99b3504a97bb62cedade07ed9a9bc3"},"schema_version":"1.0"},"canonical_sha256":"7c4bb390ae372e8b703a243045e78b98a7f755ec05c88125b7fa68ed1377f01b","source":{"kind":"arxiv","id":"1107.5377","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5377","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5377v2","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5377","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"pith_short_12","alias_value":"PRF3HEFOG4XI","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PRF3HEFOG4XIW4B2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PRF3HEFO","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PRF3HEFOG4XIW4B2EQYELZ4LTC","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-27T03:40:36Z","cross_cats_sorted":["cond-mat.dis-nn","math.PR"],"title_canon_sha256":"79bdfdb70263d046fc09df38efeac294e075e2382c1dfb275dc36c2ca1d0afa7","abstract_canon_sha256":"debb36b625d359e815d705cdd76610399d99b3504a97bb62cedade07ed9a9bc3"},"schema_version":"1.0"},"canonical_sha256":"7c4bb390ae372e8b703a243045e78b98a7f755ec05c88125b7fa68ed1377f01b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:40.698628Z","signature_b64":"yiaQyYF17inv1PAgv9/weLI7ICUioUEPm4pydxHIl5xm5lNLJ2v224LufFiyH2gaA02Wtr/OIvNkr7yG2Cj9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c4bb390ae372e8b703a243045e78b98a7f755ec05c88125b7fa68ed1377f01b","last_reissued_at":"2026-05-18T01:33:40.698124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:40.698124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5377","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:33:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dyiHyhXnV7c7VwhysPiXv8/ro5mN8KkLPMIJzmb1x9Ih34HHNPiBYrNTgB+0aczePBw3FaaOtOdWCNx+6Z4+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:20:31.714488Z"},"content_sha256":"a88749326efecea201b2c0720cf67f319d710210d62013edd8f2d4a92bf1d09e","schema_version":"1.0","event_id":"sha256:a88749326efecea201b2c0720cf67f319d710210d62013edd8f2d4a92bf1d09e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PRF3HEFOG4XIW4B2EQYELZ4LTC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The set of solutions of random XORSAT formulae","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math.PR"],"primary_cat":"cs.DM","authors_text":"Andrea Montanari, Matt Kraning, Morteza Ibrahimi, Yash Kanoria","submitted_at":"2011-07-27T03:40:36Z","abstract_excerpt":"The XOR-satisfiability (XORSAT) problem requires finding an assignment of $n$ Boolean variables that satisfy $m$ exclusive OR (XOR) clauses, whereby each clause constrains a subset of the variables. We consider random XORSAT instances, drawn uniformly at random from the ensemble of formulae containing $n$ variables and $m$ clauses of size $k$. This model presents several structural similarities to other ensembles of constraint satisfaction problems, such as $k$-satisfiability ($k$-SAT), hypergraph bicoloring and graph coloring. For many of these ensembles, as the number of constraints per vari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5377","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:33:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULRRN/zkmq0ifiHGWkpRo2tiMdazfwa89MyepE4LuZpwrN1RuPFeL6bi8L4HcSFl7GtflwKOUqkZFzzJnxefBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:20:31.715144Z"},"content_sha256":"3a5208aa0974b527c549c8ed3d4f73eecb9b3712d80ef1d905a6e67c7d863409","schema_version":"1.0","event_id":"sha256:3a5208aa0974b527c549c8ed3d4f73eecb9b3712d80ef1d905a6e67c7d863409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/bundle.json","state_url":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/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-05-31T17:20:31Z","links":{"resolver":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC","bundle":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/bundle.json","state":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PRF3HEFOG4XIW4B2EQYELZ4LTC","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":"debb36b625d359e815d705cdd76610399d99b3504a97bb62cedade07ed9a9bc3","cross_cats_sorted":["cond-mat.dis-nn","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-27T03:40:36Z","title_canon_sha256":"79bdfdb70263d046fc09df38efeac294e075e2382c1dfb275dc36c2ca1d0afa7"},"schema_version":"1.0","source":{"id":"1107.5377","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5377","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5377v2","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5377","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"pith_short_12","alias_value":"PRF3HEFOG4XI","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PRF3HEFOG4XIW4B2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PRF3HEFO","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:3a5208aa0974b527c549c8ed3d4f73eecb9b3712d80ef1d905a6e67c7d863409","target":"graph","created_at":"2026-05-18T01:33:40Z","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":"The XOR-satisfiability (XORSAT) problem requires finding an assignment of $n$ Boolean variables that satisfy $m$ exclusive OR (XOR) clauses, whereby each clause constrains a subset of the variables. We consider random XORSAT instances, drawn uniformly at random from the ensemble of formulae containing $n$ variables and $m$ clauses of size $k$. This model presents several structural similarities to other ensembles of constraint satisfaction problems, such as $k$-satisfiability ($k$-SAT), hypergraph bicoloring and graph coloring. For many of these ensembles, as the number of constraints per vari","authors_text":"Andrea Montanari, Matt Kraning, Morteza Ibrahimi, Yash Kanoria","cross_cats":["cond-mat.dis-nn","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-27T03:40:36Z","title":"The set of solutions of random XORSAT formulae"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5377","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:a88749326efecea201b2c0720cf67f319d710210d62013edd8f2d4a92bf1d09e","target":"record","created_at":"2026-05-18T01:33:40Z","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":"debb36b625d359e815d705cdd76610399d99b3504a97bb62cedade07ed9a9bc3","cross_cats_sorted":["cond-mat.dis-nn","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-27T03:40:36Z","title_canon_sha256":"79bdfdb70263d046fc09df38efeac294e075e2382c1dfb275dc36c2ca1d0afa7"},"schema_version":"1.0","source":{"id":"1107.5377","kind":"arxiv","version":2}},"canonical_sha256":"7c4bb390ae372e8b703a243045e78b98a7f755ec05c88125b7fa68ed1377f01b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c4bb390ae372e8b703a243045e78b98a7f755ec05c88125b7fa68ed1377f01b","first_computed_at":"2026-05-18T01:33:40.698124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:40.698124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yiaQyYF17inv1PAgv9/weLI7ICUioUEPm4pydxHIl5xm5lNLJ2v224LufFiyH2gaA02Wtr/OIvNkr7yG2Cj9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:40.698628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5377","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a88749326efecea201b2c0720cf67f319d710210d62013edd8f2d4a92bf1d09e","sha256:3a5208aa0974b527c549c8ed3d4f73eecb9b3712d80ef1d905a6e67c7d863409"],"state_sha256":"4157560b21c24951987e6952dcabdc3eaff6e28a8b6abdffebf37b02630fbf05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzBl6uGUkZmWftP46pq/irdBDwTYXXdEhXEMUMUTBeMPac/yEnRmO86D/GQiUaCg2r7F6kO3pJH8SZ5xjBHgAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:20:31.718301Z","bundle_sha256":"8d922835feebdd1d0d84c873520dba95f043c9888eb638e94af6cba10821531f"}}