{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YRSYGEXVZ7N5N3I7VMGMZ4GOCD","short_pith_number":"pith:YRSYGEXV","canonical_record":{"source":{"id":"1605.04679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-05-16T08:42:42Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"title_canon_sha256":"abd82037ad23c53558d9f5555f7cfdda1d4f64f1e7b2b919eb37635e1ca86576","abstract_canon_sha256":"0235e0077b3da84280f0b5f271b5c3e83a2ba81a6b0b9d3dc4e1d02901560ae5"},"schema_version":"1.0"},"canonical_sha256":"c4658312f5cfdbd6ed1fab0cccf0ce10dc47aab955a28f3fff128018233b714a","source":{"kind":"arxiv","id":"1605.04679","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04679","created_at":"2026-05-18T00:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04679v2","created_at":"2026-05-18T00:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04679","created_at":"2026-05-18T00:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"YRSYGEXVZ7N5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YRSYGEXVZ7N5N3I7","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YRSYGEXV","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YRSYGEXVZ7N5N3I7VMGMZ4GOCD","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-05-16T08:42:42Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"title_canon_sha256":"abd82037ad23c53558d9f5555f7cfdda1d4f64f1e7b2b919eb37635e1ca86576","abstract_canon_sha256":"0235e0077b3da84280f0b5f271b5c3e83a2ba81a6b0b9d3dc4e1d02901560ae5"},"schema_version":"1.0"},"canonical_sha256":"c4658312f5cfdbd6ed1fab0cccf0ce10dc47aab955a28f3fff128018233b714a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:48.908659Z","signature_b64":"vzL6bUVPfg9DdpwMS9Fr4h8MV6d5W+VM04/zK8gMS9YDS5NjHBKS1JLEEuhYkiny+13kV21Fj2RpihsvZmWBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4658312f5cfdbd6ed1fab0cccf0ce10dc47aab955a28f3fff128018233b714a","last_reissued_at":"2026-05-18T00:59:48.907987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:48.907987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04679","source_version":2,"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-18T00:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjpzbvyLkzLYsYv5nUwB/GZbJRFi5ey9skCIXY1piZClI6gwhAiqLXUiQF03kJ83Ja/Z7nlLDcOJjyB1x+xtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:53:06.332306Z"},"content_sha256":"56ec35f5685dcf05b68bc6aab6a730cee2f91ab1be310772eec666e5af7f2f57","schema_version":"1.0","event_id":"sha256:56ec35f5685dcf05b68bc6aab6a730cee2f91ab1be310772eec666e5af7f2f57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YRSYGEXVZ7N5N3I7VMGMZ4GOCD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Typical Performance of Approximation Algorithms for NP-hard Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DS"],"primary_cat":"cond-mat.dis-nn","authors_text":"Koji Hukushima, Satoshi Takabe","submitted_at":"2016-05-16T08:42:42Z","abstract_excerpt":"Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with some theoretical frameworks. Here three approximation algorithms are examined; the linear-programming relaxation, the loopy-belief propagation, and the leaf-removal algorithm. The former two algorithms are analyzed using the statistical-mechanical technique while the average-case analysis of the last one is studied by the generating function method. These algorithms have a threshold in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04679","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"},"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-18T00:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yz2WuiIUZp6zbSU5tMJcmLNNQymTMmtvrKXQ8VdksctXZSZxEllafubBzNKtbKQ84cFdILsoNGELLPUkolU4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:53:06.332870Z"},"content_sha256":"aff231765663db68a13e7936994c566b4d4b839b1ad69c7e6f578ccb1b229e53","schema_version":"1.0","event_id":"sha256:aff231765663db68a13e7936994c566b4d4b839b1ad69c7e6f578ccb1b229e53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YRSYGEXVZ7N5N3I7VMGMZ4GOCD/bundle.json","state_url":"https://pith.science/pith/YRSYGEXVZ7N5N3I7VMGMZ4GOCD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YRSYGEXVZ7N5N3I7VMGMZ4GOCD/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-02T23:53:06Z","links":{"resolver":"https://pith.science/pith/YRSYGEXVZ7N5N3I7VMGMZ4GOCD","bundle":"https://pith.science/pith/YRSYGEXVZ7N5N3I7VMGMZ4GOCD/bundle.json","state":"https://pith.science/pith/YRSYGEXVZ7N5N3I7VMGMZ4GOCD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YRSYGEXVZ7N5N3I7VMGMZ4GOCD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YRSYGEXVZ7N5N3I7VMGMZ4GOCD","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":"0235e0077b3da84280f0b5f271b5c3e83a2ba81a6b0b9d3dc4e1d02901560ae5","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-05-16T08:42:42Z","title_canon_sha256":"abd82037ad23c53558d9f5555f7cfdda1d4f64f1e7b2b919eb37635e1ca86576"},"schema_version":"1.0","source":{"id":"1605.04679","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04679","created_at":"2026-05-18T00:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04679v2","created_at":"2026-05-18T00:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04679","created_at":"2026-05-18T00:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"YRSYGEXVZ7N5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YRSYGEXVZ7N5N3I7","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YRSYGEXV","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:aff231765663db68a13e7936994c566b4d4b839b1ad69c7e6f578ccb1b229e53","target":"graph","created_at":"2026-05-18T00:59:48Z","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 performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with some theoretical frameworks. Here three approximation algorithms are examined; the linear-programming relaxation, the loopy-belief propagation, and the leaf-removal algorithm. The former two algorithms are analyzed using the statistical-mechanical technique while the average-case analysis of the last one is studied by the generating function method. These algorithms have a threshold in","authors_text":"Koji Hukushima, Satoshi Takabe","cross_cats":["cond-mat.stat-mech","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-05-16T08:42:42Z","title":"Typical Performance of Approximation Algorithms for NP-hard Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04679","kind":"arxiv","version":2},"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:56ec35f5685dcf05b68bc6aab6a730cee2f91ab1be310772eec666e5af7f2f57","target":"record","created_at":"2026-05-18T00:59:48Z","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":"0235e0077b3da84280f0b5f271b5c3e83a2ba81a6b0b9d3dc4e1d02901560ae5","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-05-16T08:42:42Z","title_canon_sha256":"abd82037ad23c53558d9f5555f7cfdda1d4f64f1e7b2b919eb37635e1ca86576"},"schema_version":"1.0","source":{"id":"1605.04679","kind":"arxiv","version":2}},"canonical_sha256":"c4658312f5cfdbd6ed1fab0cccf0ce10dc47aab955a28f3fff128018233b714a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4658312f5cfdbd6ed1fab0cccf0ce10dc47aab955a28f3fff128018233b714a","first_computed_at":"2026-05-18T00:59:48.907987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:48.907987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vzL6bUVPfg9DdpwMS9Fr4h8MV6d5W+VM04/zK8gMS9YDS5NjHBKS1JLEEuhYkiny+13kV21Fj2RpihsvZmWBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:48.908659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04679","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56ec35f5685dcf05b68bc6aab6a730cee2f91ab1be310772eec666e5af7f2f57","sha256:aff231765663db68a13e7936994c566b4d4b839b1ad69c7e6f578ccb1b229e53"],"state_sha256":"edc83c644f94ada8106292bf05196eff62840d13740a4f65c039cd959f486bc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENH31uh7xLSr2AL3Ke+TqdPQSJlSBefq/KC6X1Gb3DcPpHWA/g3x6dvvsLhPUewh7dm5qLGFRwclJDor6HmEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:53:06.335650Z","bundle_sha256":"6882381dc12ae8c0bf9ca4e45f34d74afdcbb8d74258f0ee1d75e169304f7104"}}