{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WMFNEPKI5LBXK76F7DT5XR4ZPV","short_pith_number":"pith:WMFNEPKI","canonical_record":{"source":{"id":"1210.8099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-30T17:50:49Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"0f56fc60226cd21f750dbf9dadc5dfd263f17a1066eda366e49298db0c523f52","abstract_canon_sha256":"e9f50bec0d48c306526a5b4c7e094d2e9cb77ddc71f3937ca5f4aad96a9acad0"},"schema_version":"1.0"},"canonical_sha256":"b30ad23d48eac3757fc5f8e7dbc7997d51404cb5bdb1931b78d2ba482161c11d","source":{"kind":"arxiv","id":"1210.8099","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8099","created_at":"2026-05-18T03:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8099v1","created_at":"2026-05-18T03:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8099","created_at":"2026-05-18T03:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"WMFNEPKI5LBX","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WMFNEPKI5LBXK76F","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WMFNEPKI","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WMFNEPKI5LBXK76F7DT5XR4ZPV","target":"record","payload":{"canonical_record":{"source":{"id":"1210.8099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-30T17:50:49Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"0f56fc60226cd21f750dbf9dadc5dfd263f17a1066eda366e49298db0c523f52","abstract_canon_sha256":"e9f50bec0d48c306526a5b4c7e094d2e9cb77ddc71f3937ca5f4aad96a9acad0"},"schema_version":"1.0"},"canonical_sha256":"b30ad23d48eac3757fc5f8e7dbc7997d51404cb5bdb1931b78d2ba482161c11d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:57.048100Z","signature_b64":"bWHnJBD6CpehAq+Lz1IdXAm/+z0eiB4ael8ihOVSCaVuk+eZml6+P5xZfJ5HKJGN0MwLKCpKuRwMAfwujcsBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b30ad23d48eac3757fc5f8e7dbc7997d51404cb5bdb1931b78d2ba482161c11d","last_reissued_at":"2026-05-18T03:41:57.047258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:57.047258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.8099","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-18T03:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tz6Y/jMXssZ0btrKTGoImgL9izA4YSWEwV6NfnGJ+jgd1bjQ/A4t0cn27u19zaXwTN7ao+qMxiEiSsUag2bnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:43:58.302056Z"},"content_sha256":"8373100ed2acc00f667f30d5a31ac0861ea47237b9e1735283ce31e9c4068bce","schema_version":"1.0","event_id":"sha256:8373100ed2acc00f667f30d5a31ac0861ea47237b9e1735283ce31e9c4068bce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WMFNEPKI5LBXK76F7DT5XR4ZPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Atypical Survey of Typical-Case Heuristic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.CC","authors_text":"Lane A. Hemaspaandra, Ryan Williams","submitted_at":"2012-10-30T17:50:49Z","abstract_excerpt":"Heuristic approaches often do so well that they seem to pretty much always give the right answer. How close can heuristic algorithms get to always giving the right answer, without inducing seismic complexity-theoretic consequences? This article first discusses how a series of results by Berman, Buhrman, Hartmanis, Homer, Longpr\\'{e}, Ogiwara, Sch\\\"{o}ening, and Watanabe, from the early 1970s through the early 1990s, explicitly or implicitly limited how well heuristic algorithms can do on NP-hard problems. In particular, many desirable levels of heuristic success cannot be obtained unless sever"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8099","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-18T03:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pVVz0hMcqe/AHTgfzsWEcurfg0kG5fSnDmAlz6Nt/G2JZNFqysC+P7sCEB0g7rDEgXwLlvoQYAuofg7RBexFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:43:58.302699Z"},"content_sha256":"80bb431be63c99134947b2453e5069f8e1b6a678f60f981ba11cf06282137899","schema_version":"1.0","event_id":"sha256:80bb431be63c99134947b2453e5069f8e1b6a678f60f981ba11cf06282137899"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMFNEPKI5LBXK76F7DT5XR4ZPV/bundle.json","state_url":"https://pith.science/pith/WMFNEPKI5LBXK76F7DT5XR4ZPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMFNEPKI5LBXK76F7DT5XR4ZPV/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-05-27T13:43:58Z","links":{"resolver":"https://pith.science/pith/WMFNEPKI5LBXK76F7DT5XR4ZPV","bundle":"https://pith.science/pith/WMFNEPKI5LBXK76F7DT5XR4ZPV/bundle.json","state":"https://pith.science/pith/WMFNEPKI5LBXK76F7DT5XR4ZPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMFNEPKI5LBXK76F7DT5XR4ZPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WMFNEPKI5LBXK76F7DT5XR4ZPV","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":"e9f50bec0d48c306526a5b4c7e094d2e9cb77ddc71f3937ca5f4aad96a9acad0","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-30T17:50:49Z","title_canon_sha256":"0f56fc60226cd21f750dbf9dadc5dfd263f17a1066eda366e49298db0c523f52"},"schema_version":"1.0","source":{"id":"1210.8099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8099","created_at":"2026-05-18T03:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8099v1","created_at":"2026-05-18T03:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8099","created_at":"2026-05-18T03:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"WMFNEPKI5LBX","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WMFNEPKI5LBXK76F","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WMFNEPKI","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:80bb431be63c99134947b2453e5069f8e1b6a678f60f981ba11cf06282137899","target":"graph","created_at":"2026-05-18T03:41:57Z","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":"Heuristic approaches often do so well that they seem to pretty much always give the right answer. How close can heuristic algorithms get to always giving the right answer, without inducing seismic complexity-theoretic consequences? This article first discusses how a series of results by Berman, Buhrman, Hartmanis, Homer, Longpr\\'{e}, Ogiwara, Sch\\\"{o}ening, and Watanabe, from the early 1970s through the early 1990s, explicitly or implicitly limited how well heuristic algorithms can do on NP-hard problems. In particular, many desirable levels of heuristic success cannot be obtained unless sever","authors_text":"Lane A. Hemaspaandra, Ryan Williams","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-30T17:50:49Z","title":"An Atypical Survey of Typical-Case Heuristic Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8099","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:8373100ed2acc00f667f30d5a31ac0861ea47237b9e1735283ce31e9c4068bce","target":"record","created_at":"2026-05-18T03:41:57Z","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":"e9f50bec0d48c306526a5b4c7e094d2e9cb77ddc71f3937ca5f4aad96a9acad0","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-30T17:50:49Z","title_canon_sha256":"0f56fc60226cd21f750dbf9dadc5dfd263f17a1066eda366e49298db0c523f52"},"schema_version":"1.0","source":{"id":"1210.8099","kind":"arxiv","version":1}},"canonical_sha256":"b30ad23d48eac3757fc5f8e7dbc7997d51404cb5bdb1931b78d2ba482161c11d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b30ad23d48eac3757fc5f8e7dbc7997d51404cb5bdb1931b78d2ba482161c11d","first_computed_at":"2026-05-18T03:41:57.047258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:57.047258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bWHnJBD6CpehAq+Lz1IdXAm/+z0eiB4ael8ihOVSCaVuk+eZml6+P5xZfJ5HKJGN0MwLKCpKuRwMAfwujcsBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:57.048100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.8099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8373100ed2acc00f667f30d5a31ac0861ea47237b9e1735283ce31e9c4068bce","sha256:80bb431be63c99134947b2453e5069f8e1b6a678f60f981ba11cf06282137899"],"state_sha256":"3bcea063bfc7c4d123369f0c8d42b2d3f75c4a711c72e4802e59fa2384b61b3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQFJOsJP0zb69RQIUTz5er41OsHydfZRQM+dNug8892AtagUwZPXkhXpnmmJP1Y5xEgQxgN4+8I14EycaKBfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:43:58.305821Z","bundle_sha256":"46b8266b94f4b0f26dc09cb5e1d58ec0a836417cffea2da7ec308c93a27c6b17"}}