{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3ODMCUYLLH6R7VI2S77UCXI5F5","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":"8fe295e07a463cf2f82547f3a34b3f286867c56b4b71399e2d3f7219d1db80d6","cross_cats_sorted":["cond-mat.other","cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-16T19:01:04Z","title_canon_sha256":"31025e5d3c7cf2b90f01701b3074cb59a0408736692d28cef85635e6cd5383fe"},"schema_version":"1.0","source":{"id":"2212.08678","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.08678","created_at":"2026-07-05T07:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"2212.08678v4","created_at":"2026-07-05T07:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.08678","created_at":"2026-07-05T07:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"3ODMCUYLLH6R","created_at":"2026-07-05T07:56:46Z"},{"alias_kind":"pith_short_16","alias_value":"3ODMCUYLLH6R7VI2","created_at":"2026-07-05T07:56:46Z"},{"alias_kind":"pith_short_8","alias_value":"3ODMCUYL","created_at":"2026-07-05T07:56:46Z"}],"graph_snapshots":[{"event_id":"sha256:5fe6d202822f9c10acab2cc9ab45ba9f755bff29a2274d01ca1fe83ab34791fe","target":"graph","created_at":"2026-07-05T07:56:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.08678/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial optimization - a field of research addressing problems that feature strongly in a wealth of scientific and industrial contexts - has been identified as one of the core potential fields of applicability of quantum computers. It is still unclear, however, to what extent quantum algorithms can actually outperform classical algorithms for this type of problems. In this work, by resorting to computational learning theory and cryptographic notions, we prove that quantum computers feature an in-principle super-polynomial advantage over classical computers in approximating solutions to c","authors_text":"Frederik Wilde, Jean-Pierre Seifert, Jens Eisert, Niklas Pirnay, Vincent Ulitzsch","cross_cats":["cond-mat.other","cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-16T19:01:04Z","title":"An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.08678","kind":"arxiv","version":4},"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:2fe4303949f68278ab5833a5551b9fe1eb7a4b073e51b42da681f349387bc06f","target":"record","created_at":"2026-07-05T07:56:46Z","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":"8fe295e07a463cf2f82547f3a34b3f286867c56b4b71399e2d3f7219d1db80d6","cross_cats_sorted":["cond-mat.other","cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-16T19:01:04Z","title_canon_sha256":"31025e5d3c7cf2b90f01701b3074cb59a0408736692d28cef85635e6cd5383fe"},"schema_version":"1.0","source":{"id":"2212.08678","kind":"arxiv","version":4}},"canonical_sha256":"db86c1530b59fd1fd51a97ff415d1d2f642d36c16376732ecbd4625fe8dfb937","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db86c1530b59fd1fd51a97ff415d1d2f642d36c16376732ecbd4625fe8dfb937","first_computed_at":"2026-07-05T07:56:46.074667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:56:46.074667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vrhUtsSxIF2U3o/dXDzZ1HSiXOoUSlz133rLdqhKhwRz9CsylDNtIqvYdmDcZMexsgfFiSlSyJ2Tf9u3CoIXCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:56:46.075119Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.08678","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fe4303949f68278ab5833a5551b9fe1eb7a4b073e51b42da681f349387bc06f","sha256:5fe6d202822f9c10acab2cc9ab45ba9f755bff29a2274d01ca1fe83ab34791fe"],"state_sha256":"ea075a40ccbde2dfb7c250269405bad996d4e46a54283fd980443e660fb22e6a"}