{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PRF3HEFOG4XIW4B2EQYELZ4LTC","short_pith_number":"pith:PRF3HEFO","schema_version":"1.0","canonical_sha256":"7c4bb390ae372e8b703a243045e78b98a7f755ec05c88125b7fa68ed1377f01b","source":{"kind":"arxiv","id":"1107.5377","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.5377","created_at":"2026-05-18T01:33:40.698200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5377v2","created_at":"2026-05-18T01:33:40.698200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5377","created_at":"2026-05-18T01:33:40.698200+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRF3HEFOG4XI","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRF3HEFOG4XIW4B2","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRF3HEFO","created_at":"2026-05-18T12:26:39.201973+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/PRF3HEFOG4XIW4B2EQYELZ4LTC","json":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC.json","graph_json":"https://pith.science/api/pith-number/PRF3HEFOG4XIW4B2EQYELZ4LTC/graph.json","events_json":"https://pith.science/api/pith-number/PRF3HEFOG4XIW4B2EQYELZ4LTC/events.json","paper":"https://pith.science/paper/PRF3HEFO"},"agent_actions":{"view_html":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC","download_json":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC.json","view_paper":"https://pith.science/paper/PRF3HEFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5377&json=true","fetch_graph":"https://pith.science/api/pith-number/PRF3HEFOG4XIW4B2EQYELZ4LTC/graph.json","fetch_events":"https://pith.science/api/pith-number/PRF3HEFOG4XIW4B2EQYELZ4LTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/action/storage_attestation","attest_author":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/action/author_attestation","sign_citation":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/action/citation_signature","submit_replication":"https://pith.science/pith/PRF3HEFOG4XIW4B2EQYELZ4LTC/action/replication_record"}},"created_at":"2026-05-18T01:33:40.698200+00:00","updated_at":"2026-05-18T01:33:40.698200+00:00"}