{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YZHO35DJC4SC36T46SH426SUUL","short_pith_number":"pith:YZHO35DJ","canonical_record":{"source":{"id":"1101.3884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-20T12:42:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cc3b776b7ea783d665d3409ccc2e9bfc23e90e1050826138c99b3d759b83d7ba","abstract_canon_sha256":"dc57c293609014c135c3cc411e67e43c87ad14b88a57a70c0e050e8cf36551b7"},"schema_version":"1.0"},"canonical_sha256":"c64eedf46917242dfa7cf48fcd7a54a2ed1c23b75cab2ce1565850a58ecf1472","source":{"kind":"arxiv","id":"1101.3884","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3884","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3884v1","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3884","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"YZHO35DJC4SC","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YZHO35DJC4SC36T4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YZHO35DJ","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YZHO35DJC4SC36T46SH426SUUL","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-20T12:42:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cc3b776b7ea783d665d3409ccc2e9bfc23e90e1050826138c99b3d759b83d7ba","abstract_canon_sha256":"dc57c293609014c135c3cc411e67e43c87ad14b88a57a70c0e050e8cf36551b7"},"schema_version":"1.0"},"canonical_sha256":"c64eedf46917242dfa7cf48fcd7a54a2ed1c23b75cab2ce1565850a58ecf1472","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:34.889880Z","signature_b64":"gMnH9+I/Pcdh/R+6zUpY6Qx0352XK8T6Pr2fuzAm+648EXPsaL8ECzSsaqHdh5NpwIr7A5dYmgKEH0rzYfhbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c64eedf46917242dfa7cf48fcd7a54a2ed1c23b75cab2ce1565850a58ecf1472","last_reissued_at":"2026-05-18T01:01:34.889368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:34.889368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3884","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-18T01:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34NdIHAD89oR1CV/30w3iBe+FmI2JS+IeyD1itgGl+3RWA6ifDs36u+LAWwhLI93abVxNZTmdAUhLrU2UL/JAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:54:15.244807Z"},"content_sha256":"d7b3cb50f5ee6f630bf12060bbcea459d3c1999b7b24be907d6eb911e0dc33c7","schema_version":"1.0","event_id":"sha256:d7b3cb50f5ee6f630bf12060bbcea459d3c1999b7b24be907d6eb911e0dc33c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YZHO35DJC4SC36T46SH426SUUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation algorithms for QMA-complete problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Julia Kempe, Sevag Gharibian","submitted_at":"2011-01-20T12:42:53Z","abstract_excerpt":"Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and initiate its study. We present two main results. The first shows that a non-trivial approximation ratio can be obtained in the class NP using product states. The second result (which builds on the first one), gives a polynomial time (classical) algorithm providing a similar approximation ratio for dense instances of the problem. The latter result is based on an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3884","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-18T01:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJnpN+3wevqMiTX2B2l+Udr8v9SbqJEqGwSYPvHZlZqxHiH93UDHJSJvxtJq2M1wLukhRhj3puiLtRcpYuu1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:54:15.245453Z"},"content_sha256":"6823944d129aeeff694c5728fdd5589a866ea26e20fccae5b79e2b0ee640e36b","schema_version":"1.0","event_id":"sha256:6823944d129aeeff694c5728fdd5589a866ea26e20fccae5b79e2b0ee640e36b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZHO35DJC4SC36T46SH426SUUL/bundle.json","state_url":"https://pith.science/pith/YZHO35DJC4SC36T46SH426SUUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZHO35DJC4SC36T46SH426SUUL/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-31T12:54:15Z","links":{"resolver":"https://pith.science/pith/YZHO35DJC4SC36T46SH426SUUL","bundle":"https://pith.science/pith/YZHO35DJC4SC36T46SH426SUUL/bundle.json","state":"https://pith.science/pith/YZHO35DJC4SC36T46SH426SUUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZHO35DJC4SC36T46SH426SUUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YZHO35DJC4SC36T46SH426SUUL","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":"dc57c293609014c135c3cc411e67e43c87ad14b88a57a70c0e050e8cf36551b7","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-20T12:42:53Z","title_canon_sha256":"cc3b776b7ea783d665d3409ccc2e9bfc23e90e1050826138c99b3d759b83d7ba"},"schema_version":"1.0","source":{"id":"1101.3884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3884","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3884v1","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3884","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"YZHO35DJC4SC","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YZHO35DJC4SC36T4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YZHO35DJ","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:6823944d129aeeff694c5728fdd5589a866ea26e20fccae5b79e2b0ee640e36b","target":"graph","created_at":"2026-05-18T01:01:34Z","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":"Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and initiate its study. We present two main results. The first shows that a non-trivial approximation ratio can be obtained in the class NP using product states. The second result (which builds on the first one), gives a polynomial time (classical) algorithm providing a similar approximation ratio for dense instances of the problem. The latter result is based on an","authors_text":"Julia Kempe, Sevag Gharibian","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-20T12:42:53Z","title":"Approximation algorithms for QMA-complete problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3884","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:d7b3cb50f5ee6f630bf12060bbcea459d3c1999b7b24be907d6eb911e0dc33c7","target":"record","created_at":"2026-05-18T01:01:34Z","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":"dc57c293609014c135c3cc411e67e43c87ad14b88a57a70c0e050e8cf36551b7","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-20T12:42:53Z","title_canon_sha256":"cc3b776b7ea783d665d3409ccc2e9bfc23e90e1050826138c99b3d759b83d7ba"},"schema_version":"1.0","source":{"id":"1101.3884","kind":"arxiv","version":1}},"canonical_sha256":"c64eedf46917242dfa7cf48fcd7a54a2ed1c23b75cab2ce1565850a58ecf1472","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c64eedf46917242dfa7cf48fcd7a54a2ed1c23b75cab2ce1565850a58ecf1472","first_computed_at":"2026-05-18T01:01:34.889368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:34.889368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gMnH9+I/Pcdh/R+6zUpY6Qx0352XK8T6Pr2fuzAm+648EXPsaL8ECzSsaqHdh5NpwIr7A5dYmgKEH0rzYfhbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:34.889880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7b3cb50f5ee6f630bf12060bbcea459d3c1999b7b24be907d6eb911e0dc33c7","sha256:6823944d129aeeff694c5728fdd5589a866ea26e20fccae5b79e2b0ee640e36b"],"state_sha256":"3abf690cdb7b8efd1e6036d5c1b592d9d883d58ca992686bf610d1cd3a418337"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sxb269buXlDIk7MpEzxWx5eYE74WSfCIoQF0zQbIMd8MgdGhBCqLcLdhRPF1YNk4d8U1NDiFZ5X3UfAPlF9SDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:54:15.249141Z","bundle_sha256":"0c7db15311aeaf965a7073ce14cd53df5aad714621a96b496e87cdf831f8539a"}}