{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HOGGQESDQJO3LXOUJN6XYVQMFJ","short_pith_number":"pith:HOGGQESD","schema_version":"1.0","canonical_sha256":"3b8c681243825db5ddd44b7d7c560c2a6d1ff4ab24e18763d4a40455e6aed09d","source":{"kind":"arxiv","id":"1801.06620","version":2},"attestation_state":"computed","paper":{"title":"A high-performance analog Max-SAT solver and its application to Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.AI","math.DS","nlin.CD"],"primary_cat":"cs.CC","authors_text":"Botond Moln\\'ar, M\\'aria Ercsey-Ravasz, Melinda Varga, Zoltan Toroczkai","submitted_at":"2018-01-20T03:54:22Z","abstract_excerpt":"We introduce a continuous-time analog solver for MaxSAT, a quintessential class of NP-hard discrete optimization problems, where the task is to find a truth assignment for a set of Boolean variables satisfying the maximum number of given logical constraints. We show that the scaling of an invariant of the solver's dynamics, the escape rate, as function of the number of unsatisfied clauses can predict the global optimum value, often well before reaching the corresponding state. We demonstrate the performance of the solver on hard MaxSAT competition problems. We then consider the two-color Ramse"},"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":"1801.06620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-20T03:54:22Z","cross_cats_sorted":["cond-mat.stat-mech","cs.AI","math.DS","nlin.CD"],"title_canon_sha256":"b9f0492e43780b7ec696f67b7e79dd21b1c368a20961a2e7fc47b6d185243a68","abstract_canon_sha256":"59b99000450214b86f769c52d4a168d1777072240e7e83e50b119e82dbb91c21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:59.160623Z","signature_b64":"5x4N4/40RZ+y0HRRztMr/vKgNLUDbiaZR/IBRfnL+d+SMAxOKX8c3hn9SViMgSRFErMlz0939nfhUYi8D+79Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b8c681243825db5ddd44b7d7c560c2a6d1ff4ab24e18763d4a40455e6aed09d","last_reissued_at":"2026-05-18T00:24:59.160211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:59.160211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A high-performance analog Max-SAT solver and its application to Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.AI","math.DS","nlin.CD"],"primary_cat":"cs.CC","authors_text":"Botond Moln\\'ar, M\\'aria Ercsey-Ravasz, Melinda Varga, Zoltan Toroczkai","submitted_at":"2018-01-20T03:54:22Z","abstract_excerpt":"We introduce a continuous-time analog solver for MaxSAT, a quintessential class of NP-hard discrete optimization problems, where the task is to find a truth assignment for a set of Boolean variables satisfying the maximum number of given logical constraints. We show that the scaling of an invariant of the solver's dynamics, the escape rate, as function of the number of unsatisfied clauses can predict the global optimum value, often well before reaching the corresponding state. We demonstrate the performance of the solver on hard MaxSAT competition problems. We then consider the two-color Ramse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06620","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":"1801.06620","created_at":"2026-05-18T00:24:59.160272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06620v2","created_at":"2026-05-18T00:24:59.160272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06620","created_at":"2026-05-18T00:24:59.160272+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOGGQESDQJO3","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOGGQESDQJO3LXOU","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOGGQESD","created_at":"2026-05-18T12:32:28.185984+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/HOGGQESDQJO3LXOUJN6XYVQMFJ","json":"https://pith.science/pith/HOGGQESDQJO3LXOUJN6XYVQMFJ.json","graph_json":"https://pith.science/api/pith-number/HOGGQESDQJO3LXOUJN6XYVQMFJ/graph.json","events_json":"https://pith.science/api/pith-number/HOGGQESDQJO3LXOUJN6XYVQMFJ/events.json","paper":"https://pith.science/paper/HOGGQESD"},"agent_actions":{"view_html":"https://pith.science/pith/HOGGQESDQJO3LXOUJN6XYVQMFJ","download_json":"https://pith.science/pith/HOGGQESDQJO3LXOUJN6XYVQMFJ.json","view_paper":"https://pith.science/paper/HOGGQESD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06620&json=true","fetch_graph":"https://pith.science/api/pith-number/HOGGQESDQJO3LXOUJN6XYVQMFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HOGGQESDQJO3LXOUJN6XYVQMFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOGGQESDQJO3LXOUJN6XYVQMFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOGGQESDQJO3LXOUJN6XYVQMFJ/action/storage_attestation","attest_author":"https://pith.science/pith/HOGGQESDQJO3LXOUJN6XYVQMFJ/action/author_attestation","sign_citation":"https://pith.science/pith/HOGGQESDQJO3LXOUJN6XYVQMFJ/action/citation_signature","submit_replication":"https://pith.science/pith/HOGGQESDQJO3LXOUJN6XYVQMFJ/action/replication_record"}},"created_at":"2026-05-18T00:24:59.160272+00:00","updated_at":"2026-05-18T00:24:59.160272+00:00"}