{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GUKN5M5KWUCQKSHHLJAHFRBEV7","short_pith_number":"pith:GUKN5M5K","schema_version":"1.0","canonical_sha256":"3514deb3aab5050548e75a4072c424afde5ac4bfcfefd247cd61c9d57a97d61c","source":{"kind":"arxiv","id":"1309.6651","version":1},"attestation_state":"computed","paper":{"title":"Inside the clustering threshold for random linear equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.DM","authors_text":"Michael Molloy, Pu Gao","submitted_at":"2013-09-19T15:01:43Z","abstract_excerpt":"We study a random system of $cn$ linear equations over $n$ variables in GF(2), where each equation contains exactly $r$ variables; this is equivalent to $r$-XORSAT. \\cite{ikkm,amxor} determined the clustering threshold, $c^*_r$: if $c=c^*_r+\\e$ for any constant $\\e>0$, then \\aas the solutions partition into well-connected, well-separated {\\em clusters} (with probability tending to 1 as $n\\rightarrow\\infty$). This is part of a general clustering phenomenon which is hypothesized to arise in most of the commonly studied models of random constraint satisfaction problems, via sophisticated but most"},"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.6651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-19T15:01:43Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"68937c6800c5649f71e254faf73053925d9ffdc516a40bfaaf390bd68f53609c","abstract_canon_sha256":"06d3c928f594c24499eed500421e02a75e48e273fc4dbe826d687643a0026114"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.995267Z","signature_b64":"pSXHtGs42anxvN/ARED6oJTN9cdK3rMGChN+smprM9MTjWKcF5593teyKbfl65YkAFG8l503wLQxn0ED13CsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3514deb3aab5050548e75a4072c424afde5ac4bfcfefd247cd61c9d57a97d61c","last_reissued_at":"2026-05-18T03:12:10.994383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.994383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inside the clustering threshold for random linear equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.DM","authors_text":"Michael Molloy, Pu Gao","submitted_at":"2013-09-19T15:01:43Z","abstract_excerpt":"We study a random system of $cn$ linear equations over $n$ variables in GF(2), where each equation contains exactly $r$ variables; this is equivalent to $r$-XORSAT. \\cite{ikkm,amxor} determined the clustering threshold, $c^*_r$: if $c=c^*_r+\\e$ for any constant $\\e>0$, then \\aas the solutions partition into well-connected, well-separated {\\em clusters} (with probability tending to 1 as $n\\rightarrow\\infty$). This is part of a general clustering phenomenon which is hypothesized to arise in most of the commonly studied models of random constraint satisfaction problems, via sophisticated but most"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6651","kind":"arxiv","version":1},"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.6651","created_at":"2026-05-18T03:12:10.994530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6651v1","created_at":"2026-05-18T03:12:10.994530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6651","created_at":"2026-05-18T03:12:10.994530+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUKN5M5KWUCQ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUKN5M5KWUCQKSHH","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUKN5M5K","created_at":"2026-05-18T12:27:45.050594+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/GUKN5M5KWUCQKSHHLJAHFRBEV7","json":"https://pith.science/pith/GUKN5M5KWUCQKSHHLJAHFRBEV7.json","graph_json":"https://pith.science/api/pith-number/GUKN5M5KWUCQKSHHLJAHFRBEV7/graph.json","events_json":"https://pith.science/api/pith-number/GUKN5M5KWUCQKSHHLJAHFRBEV7/events.json","paper":"https://pith.science/paper/GUKN5M5K"},"agent_actions":{"view_html":"https://pith.science/pith/GUKN5M5KWUCQKSHHLJAHFRBEV7","download_json":"https://pith.science/pith/GUKN5M5KWUCQKSHHLJAHFRBEV7.json","view_paper":"https://pith.science/paper/GUKN5M5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6651&json=true","fetch_graph":"https://pith.science/api/pith-number/GUKN5M5KWUCQKSHHLJAHFRBEV7/graph.json","fetch_events":"https://pith.science/api/pith-number/GUKN5M5KWUCQKSHHLJAHFRBEV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUKN5M5KWUCQKSHHLJAHFRBEV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUKN5M5KWUCQKSHHLJAHFRBEV7/action/storage_attestation","attest_author":"https://pith.science/pith/GUKN5M5KWUCQKSHHLJAHFRBEV7/action/author_attestation","sign_citation":"https://pith.science/pith/GUKN5M5KWUCQKSHHLJAHFRBEV7/action/citation_signature","submit_replication":"https://pith.science/pith/GUKN5M5KWUCQKSHHLJAHFRBEV7/action/replication_record"}},"created_at":"2026-05-18T03:12:10.994530+00:00","updated_at":"2026-05-18T03:12:10.994530+00:00"}