{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C5VWNWW255YTVLJNVJUDZYRVEH","short_pith_number":"pith:C5VWNWW2","schema_version":"1.0","canonical_sha256":"176b66dadaef713aad2daa683ce23521fe272a2cbd5d066751ac2b2b884fb687","source":{"kind":"arxiv","id":"1702.02821","version":2},"attestation_state":"computed","paper":{"title":"Phase Transitions of the Typical Algorithmic Complexity of the Random Satisfiability Problem Studied with Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.AI","cs.CC"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alexander K. Hartmann, Hendrik Schawe, Roman Bleim","submitted_at":"2017-02-09T13:18:08Z","abstract_excerpt":"Here we study the NP-complete $K$-SAT problem. Although the worst-case complexity of NP-complete problems is conjectured to be exponential, there exist parametrized random ensembles of problems where solutions can typically be found in polynomial time for suitable ranges of the parameter. In fact, random $K$-SAT, with $\\alpha=M/N $ as control parameter, can be solved quickly for small enough values of $\\alpha$. It shows a phase transition between a satisfiable phase and an unsatisfiable phase. For branch and bound algorithms, which operate in the space of feasible Boolean configurations, the e"},"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":"1702.02821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-02-09T13:18:08Z","cross_cats_sorted":["cond-mat.stat-mech","cs.AI","cs.CC"],"title_canon_sha256":"2a57c1a5eb7254385831190ec16f97558c9c0c35650eca0a0ffca8b4b196a066","abstract_canon_sha256":"14f0047ae9e215868afa7e8dcf5a506f2947f0d8867cf1e53fcc6e2f8a382ba7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:01.576857Z","signature_b64":"EIl5UWAeHPvyvlVR96/iYfrro+9+32VVrESJ1NnCQJJg3Pbc66AFENbbyNG120BpZy7Rgpo6MkvYcUr3/SmUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"176b66dadaef713aad2daa683ce23521fe272a2cbd5d066751ac2b2b884fb687","last_reissued_at":"2026-05-17T23:41:01.576128Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:01.576128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase Transitions of the Typical Algorithmic Complexity of the Random Satisfiability Problem Studied with Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.AI","cs.CC"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alexander K. Hartmann, Hendrik Schawe, Roman Bleim","submitted_at":"2017-02-09T13:18:08Z","abstract_excerpt":"Here we study the NP-complete $K$-SAT problem. Although the worst-case complexity of NP-complete problems is conjectured to be exponential, there exist parametrized random ensembles of problems where solutions can typically be found in polynomial time for suitable ranges of the parameter. In fact, random $K$-SAT, with $\\alpha=M/N $ as control parameter, can be solved quickly for small enough values of $\\alpha$. It shows a phase transition between a satisfiable phase and an unsatisfiable phase. For branch and bound algorithms, which operate in the space of feasible Boolean configurations, the e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02821","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":"1702.02821","created_at":"2026-05-17T23:41:01.576256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02821v2","created_at":"2026-05-17T23:41:01.576256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02821","created_at":"2026-05-17T23:41:01.576256+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5VWNWW255YT","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5VWNWW255YTVLJN","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5VWNWW2","created_at":"2026-05-18T12:31:08.081275+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/C5VWNWW255YTVLJNVJUDZYRVEH","json":"https://pith.science/pith/C5VWNWW255YTVLJNVJUDZYRVEH.json","graph_json":"https://pith.science/api/pith-number/C5VWNWW255YTVLJNVJUDZYRVEH/graph.json","events_json":"https://pith.science/api/pith-number/C5VWNWW255YTVLJNVJUDZYRVEH/events.json","paper":"https://pith.science/paper/C5VWNWW2"},"agent_actions":{"view_html":"https://pith.science/pith/C5VWNWW255YTVLJNVJUDZYRVEH","download_json":"https://pith.science/pith/C5VWNWW255YTVLJNVJUDZYRVEH.json","view_paper":"https://pith.science/paper/C5VWNWW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02821&json=true","fetch_graph":"https://pith.science/api/pith-number/C5VWNWW255YTVLJNVJUDZYRVEH/graph.json","fetch_events":"https://pith.science/api/pith-number/C5VWNWW255YTVLJNVJUDZYRVEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5VWNWW255YTVLJNVJUDZYRVEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5VWNWW255YTVLJNVJUDZYRVEH/action/storage_attestation","attest_author":"https://pith.science/pith/C5VWNWW255YTVLJNVJUDZYRVEH/action/author_attestation","sign_citation":"https://pith.science/pith/C5VWNWW255YTVLJNVJUDZYRVEH/action/citation_signature","submit_replication":"https://pith.science/pith/C5VWNWW255YTVLJNVJUDZYRVEH/action/replication_record"}},"created_at":"2026-05-17T23:41:01.576256+00:00","updated_at":"2026-05-17T23:41:01.576256+00:00"}