{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BJ6VZDAUXUSOFN6REQA5YORFNO","short_pith_number":"pith:BJ6VZDAU","schema_version":"1.0","canonical_sha256":"0a7d5c8c14bd24e2b7d12401dc3a256ba0a7ae9fecea1602758be6acfc11f3e2","source":{"kind":"arxiv","id":"1404.6049","version":1},"attestation_state":"computed","paper":{"title":"Statistical physics of hard combinatorial optimization: The vertex cover problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cond-mat.dis-nn","authors_text":"Hai-Jun Zhou, Jin-Hua Zhao","submitted_at":"2014-04-24T08:10:22Z","abstract_excerpt":"Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into"},"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":"1404.6049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2014-04-24T08:10:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"dd08e2e7aae862dcce6970ec10840209c7ee1c5c5403bb77e40e6075165b4c6b","abstract_canon_sha256":"0f2f1a8e9867da3c6f20fddf55bd403e37b8da697a3de44fb691fcebef4fc7fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:45.481053Z","signature_b64":"eqHMP1wLc9dwiyNk6+gtG+xwRaDXEFFc5G/5keitI8WN32MWcw2ebVHwePZ9Dd1tesauEmxMe87Vzvi9XzazAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a7d5c8c14bd24e2b7d12401dc3a256ba0a7ae9fecea1602758be6acfc11f3e2","last_reissued_at":"2026-05-18T02:49:45.480699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:45.480699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical physics of hard combinatorial optimization: The vertex cover problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cond-mat.dis-nn","authors_text":"Hai-Jun Zhou, Jin-Hua Zhao","submitted_at":"2014-04-24T08:10:22Z","abstract_excerpt":"Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6049","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":"1404.6049","created_at":"2026-05-18T02:49:45.480750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6049v1","created_at":"2026-05-18T02:49:45.480750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6049","created_at":"2026-05-18T02:49:45.480750+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJ6VZDAUXUSO","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJ6VZDAUXUSOFN6R","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJ6VZDAU","created_at":"2026-05-18T12:28:22.404517+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/BJ6VZDAUXUSOFN6REQA5YORFNO","json":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO.json","graph_json":"https://pith.science/api/pith-number/BJ6VZDAUXUSOFN6REQA5YORFNO/graph.json","events_json":"https://pith.science/api/pith-number/BJ6VZDAUXUSOFN6REQA5YORFNO/events.json","paper":"https://pith.science/paper/BJ6VZDAU"},"agent_actions":{"view_html":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO","download_json":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO.json","view_paper":"https://pith.science/paper/BJ6VZDAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6049&json=true","fetch_graph":"https://pith.science/api/pith-number/BJ6VZDAUXUSOFN6REQA5YORFNO/graph.json","fetch_events":"https://pith.science/api/pith-number/BJ6VZDAUXUSOFN6REQA5YORFNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/action/storage_attestation","attest_author":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/action/author_attestation","sign_citation":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/action/citation_signature","submit_replication":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/action/replication_record"}},"created_at":"2026-05-18T02:49:45.480750+00:00","updated_at":"2026-05-18T02:49:45.480750+00:00"}