{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BJ6VZDAUXUSOFN6REQA5YORFNO","short_pith_number":"pith:BJ6VZDAU","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"},"canonical_sha256":"0a7d5c8c14bd24e2b7d12401dc3a256ba0a7ae9fecea1602758be6acfc11f3e2","source":{"kind":"arxiv","id":"1404.6049","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6049","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6049v1","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6049","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"BJ6VZDAUXUSO","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BJ6VZDAUXUSOFN6R","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BJ6VZDAU","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BJ6VZDAUXUSOFN6REQA5YORFNO","target":"record","payload":{"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"},"canonical_sha256":"0a7d5c8c14bd24e2b7d12401dc3a256ba0a7ae9fecea1602758be6acfc11f3e2","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"},"source_kind":"arxiv","source_id":"1404.6049","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JK5XckFq21D6gmozh0E8lmo4jebwJRoW3r+BzU8kzx2RSuFfWcBFsuXw8XlNGh33y1PIBMGgAUU62TxJJqRBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:09:54.209971Z"},"content_sha256":"a1d162d2ae77d703f5341985b404b5213d95435620c6f8e8ae2f9fb6f0a383ab","schema_version":"1.0","event_id":"sha256:a1d162d2ae77d703f5341985b404b5213d95435620c6f8e8ae2f9fb6f0a383ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BJ6VZDAUXUSOFN6REQA5YORFNO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"or9SqYuJDP2+rQaSCucaxqLrKZDLhINSyyPB9E075E7QKyOSCS5TdE420dYghmdyOg3tOR0H9+FwJGdM7tqYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:09:54.210306Z"},"content_sha256":"20648405832849c1d7da23ab9dbc28b5007538ac3e919e12cc3012e3cc764614","schema_version":"1.0","event_id":"sha256:20648405832849c1d7da23ab9dbc28b5007538ac3e919e12cc3012e3cc764614"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/bundle.json","state_url":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T22:09:54Z","links":{"resolver":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO","bundle":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/bundle.json","state":"https://pith.science/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJ6VZDAUXUSOFN6REQA5YORFNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BJ6VZDAUXUSOFN6REQA5YORFNO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0f2f1a8e9867da3c6f20fddf55bd403e37b8da697a3de44fb691fcebef4fc7fb","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2014-04-24T08:10:22Z","title_canon_sha256":"dd08e2e7aae862dcce6970ec10840209c7ee1c5c5403bb77e40e6075165b4c6b"},"schema_version":"1.0","source":{"id":"1404.6049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6049","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6049v1","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6049","created_at":"2026-05-18T02:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"BJ6VZDAUXUSO","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BJ6VZDAUXUSOFN6R","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BJ6VZDAU","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:20648405832849c1d7da23ab9dbc28b5007538ac3e919e12cc3012e3cc764614","target":"graph","created_at":"2026-05-18T02:49:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hai-Jun Zhou, Jin-Hua Zhao","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2014-04-24T08:10:22Z","title":"Statistical physics of hard combinatorial optimization: The vertex cover problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6049","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a1d162d2ae77d703f5341985b404b5213d95435620c6f8e8ae2f9fb6f0a383ab","target":"record","created_at":"2026-05-18T02:49:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0f2f1a8e9867da3c6f20fddf55bd403e37b8da697a3de44fb691fcebef4fc7fb","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2014-04-24T08:10:22Z","title_canon_sha256":"dd08e2e7aae862dcce6970ec10840209c7ee1c5c5403bb77e40e6075165b4c6b"},"schema_version":"1.0","source":{"id":"1404.6049","kind":"arxiv","version":1}},"canonical_sha256":"0a7d5c8c14bd24e2b7d12401dc3a256ba0a7ae9fecea1602758be6acfc11f3e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a7d5c8c14bd24e2b7d12401dc3a256ba0a7ae9fecea1602758be6acfc11f3e2","first_computed_at":"2026-05-18T02:49:45.480699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:45.480699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eqHMP1wLc9dwiyNk6+gtG+xwRaDXEFFc5G/5keitI8WN32MWcw2ebVHwePZ9Dd1tesauEmxMe87Vzvi9XzazAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:45.481053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1d162d2ae77d703f5341985b404b5213d95435620c6f8e8ae2f9fb6f0a383ab","sha256:20648405832849c1d7da23ab9dbc28b5007538ac3e919e12cc3012e3cc764614"],"state_sha256":"ea9caa66351fefc75f2604544f0743379bd038d6f3345873fa708af4330d4da6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7q/MS3cQluSuPJ+wG6ZLtb57DcyOxckpl3hK9hMKzPmE/D8J0TrN2umMpPztR+l/raDHeKfeRzypX4h1DQrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:09:54.212307Z","bundle_sha256":"a3513e7e0ae148269ff94044c05437d19abbd0ae63add0fea05c241771dcc5ff"}}