{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7DPNC4H7WTGDCEFBTPGWB24337","short_pith_number":"pith:7DPNC4H7","schema_version":"1.0","canonical_sha256":"f8ded170ffb4cc3110a19bcd60eb9bdfde73bfddaa971f2fc9897c7922746c65","source":{"kind":"arxiv","id":"1208.0526","version":1},"attestation_state":"computed","paper":{"title":"Optimization hardness as transient chaos in an analog approach to constraint satisfaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.DS","nlin.CD","physics.comp-ph"],"primary_cat":"cs.CC","authors_text":"Maria Ercsey-Ravasz, Zoltan Toroczkai","submitted_at":"2012-08-02T16:01:29Z","abstract_excerpt":"Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for $k\\geq 3$) implies efficient solutions to a large number of hard optimization problems [2,3]. Here we propose a mapping of k-SAT into a deterministic continuous-time dynamical system with a unique correspondence between its attractors and the k-SAT solution clusters. We show that beyond a constraint density threshold, the analog trajectories become transiently chaotic [4-7], and the boundaries between the basins of attraction [8] of the solution"},"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":"1208.0526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-08-02T16:01:29Z","cross_cats_sorted":["cs.NE","math.DS","nlin.CD","physics.comp-ph"],"title_canon_sha256":"5c9a8e97ce38262b6562c8c524505e2e9272da9c2b0172b9127ef378869dbdcd","abstract_canon_sha256":"754a2b302efe200b611c7d70d15254783453b07e5994c5c333008799e19129cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:33.912087Z","signature_b64":"GBpHGIh7TIsH4aZGh4EgCw+AvBz+aa2nqv6AKAREvErA1UXctdO0yMuazvACnsiyybFM8yNR+7n2z4PRxv2aAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8ded170ffb4cc3110a19bcd60eb9bdfde73bfddaa971f2fc9897c7922746c65","last_reissued_at":"2026-05-18T03:49:33.911155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:33.911155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization hardness as transient chaos in an analog approach to constraint satisfaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.DS","nlin.CD","physics.comp-ph"],"primary_cat":"cs.CC","authors_text":"Maria Ercsey-Ravasz, Zoltan Toroczkai","submitted_at":"2012-08-02T16:01:29Z","abstract_excerpt":"Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for $k\\geq 3$) implies efficient solutions to a large number of hard optimization problems [2,3]. Here we propose a mapping of k-SAT into a deterministic continuous-time dynamical system with a unique correspondence between its attractors and the k-SAT solution clusters. We show that beyond a constraint density threshold, the analog trajectories become transiently chaotic [4-7], and the boundaries between the basins of attraction [8] of the solution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0526","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":"1208.0526","created_at":"2026-05-18T03:49:33.911341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0526v1","created_at":"2026-05-18T03:49:33.911341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0526","created_at":"2026-05-18T03:49:33.911341+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DPNC4H7WTGD","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DPNC4H7WTGDCEFB","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DPNC4H7","created_at":"2026-05-18T12:26:56.085431+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/7DPNC4H7WTGDCEFBTPGWB24337","json":"https://pith.science/pith/7DPNC4H7WTGDCEFBTPGWB24337.json","graph_json":"https://pith.science/api/pith-number/7DPNC4H7WTGDCEFBTPGWB24337/graph.json","events_json":"https://pith.science/api/pith-number/7DPNC4H7WTGDCEFBTPGWB24337/events.json","paper":"https://pith.science/paper/7DPNC4H7"},"agent_actions":{"view_html":"https://pith.science/pith/7DPNC4H7WTGDCEFBTPGWB24337","download_json":"https://pith.science/pith/7DPNC4H7WTGDCEFBTPGWB24337.json","view_paper":"https://pith.science/paper/7DPNC4H7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0526&json=true","fetch_graph":"https://pith.science/api/pith-number/7DPNC4H7WTGDCEFBTPGWB24337/graph.json","fetch_events":"https://pith.science/api/pith-number/7DPNC4H7WTGDCEFBTPGWB24337/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DPNC4H7WTGDCEFBTPGWB24337/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DPNC4H7WTGDCEFBTPGWB24337/action/storage_attestation","attest_author":"https://pith.science/pith/7DPNC4H7WTGDCEFBTPGWB24337/action/author_attestation","sign_citation":"https://pith.science/pith/7DPNC4H7WTGDCEFBTPGWB24337/action/citation_signature","submit_replication":"https://pith.science/pith/7DPNC4H7WTGDCEFBTPGWB24337/action/replication_record"}},"created_at":"2026-05-18T03:49:33.911341+00:00","updated_at":"2026-05-18T03:49:33.911341+00:00"}