{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:4TWXMULJKFV5BJHBVLSXULTKFN","short_pith_number":"pith:4TWXMULJ","schema_version":"1.0","canonical_sha256":"e4ed765169516bd0a4e1aae57a2e6a2b4dd94d18ef05ee08fd9248e13930cbb3","source":{"kind":"arxiv","id":"cond-mat/0702610","version":2},"attestation_state":"computed","paper":{"title":"The Phase Diagram of 1-in-3 Satisfiability Problem","license":"","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"Andrea Sportiello, Jack Raymond, Lenka Zdeborov\\'a","submitted_at":"2007-02-26T17:29:57Z","abstract_excerpt":"We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and probability of negation of a variable in a clause. Random 1-in-3 Satisfiability and Exact 3-Cover are special cases of this ensemble. We interpolate between these cases from a region where satisfiability can be typically decided for all connectivities in polynomial time to a region where deciding satisfiability is hard, in some interval of connectivities. We derive "},"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":"cond-mat/0702610","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2007-02-26T17:29:57Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"74942636d71a2a46374189e7b03da1abcb40782a0af28a52123008a738967f7a","abstract_canon_sha256":"ddff050fea8a6dbbc30b38121c40766527a5489e6fd75ad6cbeb9b0daaec09ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:54.616840Z","signature_b64":"9NO6RerMNZcV4mL0MtdtZKJ6rAtbKHWWZha8s5Ev/8lq9tMlSaEDFlq/B52uBYttBnc++akGcjcCPH2awh7rBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ed765169516bd0a4e1aae57a2e6a2b4dd94d18ef05ee08fd9248e13930cbb3","last_reissued_at":"2026-05-18T04:08:54.616342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:54.616342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Phase Diagram of 1-in-3 Satisfiability Problem","license":"","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"Andrea Sportiello, Jack Raymond, Lenka Zdeborov\\'a","submitted_at":"2007-02-26T17:29:57Z","abstract_excerpt":"We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and probability of negation of a variable in a clause. Random 1-in-3 Satisfiability and Exact 3-Cover are special cases of this ensemble. We interpolate between these cases from a region where satisfiability can be typically decided for all connectivities in polynomial time to a region where deciding satisfiability is hard, in some interval of connectivities. We derive "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0702610","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":"cond-mat/0702610","created_at":"2026-05-18T04:08:54.616414+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0702610v2","created_at":"2026-05-18T04:08:54.616414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0702610","created_at":"2026-05-18T04:08:54.616414+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TWXMULJKFV5","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TWXMULJKFV5BJHB","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TWXMULJ","created_at":"2026-05-18T12:25:55.427421+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/4TWXMULJKFV5BJHBVLSXULTKFN","json":"https://pith.science/pith/4TWXMULJKFV5BJHBVLSXULTKFN.json","graph_json":"https://pith.science/api/pith-number/4TWXMULJKFV5BJHBVLSXULTKFN/graph.json","events_json":"https://pith.science/api/pith-number/4TWXMULJKFV5BJHBVLSXULTKFN/events.json","paper":"https://pith.science/paper/4TWXMULJ"},"agent_actions":{"view_html":"https://pith.science/pith/4TWXMULJKFV5BJHBVLSXULTKFN","download_json":"https://pith.science/pith/4TWXMULJKFV5BJHBVLSXULTKFN.json","view_paper":"https://pith.science/paper/4TWXMULJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/0702610&json=true","fetch_graph":"https://pith.science/api/pith-number/4TWXMULJKFV5BJHBVLSXULTKFN/graph.json","fetch_events":"https://pith.science/api/pith-number/4TWXMULJKFV5BJHBVLSXULTKFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TWXMULJKFV5BJHBVLSXULTKFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TWXMULJKFV5BJHBVLSXULTKFN/action/storage_attestation","attest_author":"https://pith.science/pith/4TWXMULJKFV5BJHBVLSXULTKFN/action/author_attestation","sign_citation":"https://pith.science/pith/4TWXMULJKFV5BJHBVLSXULTKFN/action/citation_signature","submit_replication":"https://pith.science/pith/4TWXMULJKFV5BJHBVLSXULTKFN/action/replication_record"}},"created_at":"2026-05-18T04:08:54.616414+00:00","updated_at":"2026-05-18T04:08:54.616414+00:00"}