{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SORCLLD377X6ZDMZFOGIAEB2SD","short_pith_number":"pith:SORCLLD3","canonical_record":{"source":{"id":"2001.08271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-22T20:42:02Z","cross_cats_sorted":[],"title_canon_sha256":"1cf938d83bb8a8103fac1553a8b33b0fd2244fb753edf1622933bc64908b1c31","abstract_canon_sha256":"1c84d14e0e55f84822c3b76c4f635f3f36cce4f53651dd5033d877df66b0039f"},"schema_version":"1.0"},"canonical_sha256":"93a225ac7bffefec8d992b8c80103a90d035ad94531bea2560ea14b4880fc1a4","source":{"kind":"arxiv","id":"2001.08271","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.08271","created_at":"2026-07-05T01:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"2001.08271v2","created_at":"2026-07-05T01:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.08271","created_at":"2026-07-05T01:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"SORCLLD377X6","created_at":"2026-07-05T01:42:52Z"},{"alias_kind":"pith_short_16","alias_value":"SORCLLD377X6ZDMZ","created_at":"2026-07-05T01:42:52Z"},{"alias_kind":"pith_short_8","alias_value":"SORCLLD3","created_at":"2026-07-05T01:42:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SORCLLD377X6ZDMZFOGIAEB2SD","target":"record","payload":{"canonical_record":{"source":{"id":"2001.08271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-22T20:42:02Z","cross_cats_sorted":[],"title_canon_sha256":"1cf938d83bb8a8103fac1553a8b33b0fd2244fb753edf1622933bc64908b1c31","abstract_canon_sha256":"1c84d14e0e55f84822c3b76c4f635f3f36cce4f53651dd5033d877df66b0039f"},"schema_version":"1.0"},"canonical_sha256":"93a225ac7bffefec8d992b8c80103a90d035ad94531bea2560ea14b4880fc1a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:42:52.792444Z","signature_b64":"dkMIf2GX0FBhQAd4L/ce7yJP4x/e250HNFtH+DXeMUovf13ifgRZRWMYFxUQ4apbuNGbCrCUQRnKc9OwV6maBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93a225ac7bffefec8d992b8c80103a90d035ad94531bea2560ea14b4880fc1a4","last_reissued_at":"2026-07-05T01:42:52.792026Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:42:52.792026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.08271","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-07-05T01:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eHBeN3aKmIg5NM+mdnWJSrYHDhtgArv82LuXWNK0YFXbDL+JC/GN/MrJ5MJLYdGxzByw/2O4eEGofKcsH1RsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:44:11.076798Z"},"content_sha256":"49f98d383576757b643910f1310bcab1d1cbebb2dc9fd89335307ac6586a4452","schema_version":"1.0","event_id":"sha256:49f98d383576757b643910f1310bcab1d1cbebb2dc9fd89335307ac6586a4452"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SORCLLD377X6ZDMZFOGIAEB2SD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"To quantum or not to quantum: towards algorithm selection in near-term quantum optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Charles Moussa, Henri Calandra, Vedran Dunjko","submitted_at":"2020-01-22T20:42:02Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) constitutes one of the often mentioned candidates expected to yield a quantum boost in the era of near-term quantum computing. In practice, quantum optimization will have to compete with cheaper classical heuristic methods, which have the advantage of decades of empirical domain-specific enhancements. Consequently, to achieve optimal performance we will face the issue of algorithm selection, well-studied in practical computing. Here we introduce this problem to the quantum optimization domain.\n  Specifically, we study the problem of detecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.08271","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.08271/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YSvDSN9V1RmPBE/EEzjnhBzO68rt14ng+egb5vuOxLAUzoA+7Ozliyt6ymXpR9jv487Y5G/w1TFokYcUK2c/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:44:11.077338Z"},"content_sha256":"1d33f92c5708c2a850b6136b3bf3f118753a1d985242ea72b1cfc28525ba7d94","schema_version":"1.0","event_id":"sha256:1d33f92c5708c2a850b6136b3bf3f118753a1d985242ea72b1cfc28525ba7d94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD/bundle.json","state_url":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SORCLLD377X6ZDMZFOGIAEB2SD/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-08-12T20:44:11Z","links":{"resolver":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD","bundle":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD/bundle.json","state":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SORCLLD377X6ZDMZFOGIAEB2SD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SORCLLD377X6ZDMZFOGIAEB2SD","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":"1c84d14e0e55f84822c3b76c4f635f3f36cce4f53651dd5033d877df66b0039f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-22T20:42:02Z","title_canon_sha256":"1cf938d83bb8a8103fac1553a8b33b0fd2244fb753edf1622933bc64908b1c31"},"schema_version":"1.0","source":{"id":"2001.08271","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.08271","created_at":"2026-07-05T01:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"2001.08271v2","created_at":"2026-07-05T01:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.08271","created_at":"2026-07-05T01:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"SORCLLD377X6","created_at":"2026-07-05T01:42:52Z"},{"alias_kind":"pith_short_16","alias_value":"SORCLLD377X6ZDMZ","created_at":"2026-07-05T01:42:52Z"},{"alias_kind":"pith_short_8","alias_value":"SORCLLD3","created_at":"2026-07-05T01:42:52Z"}],"graph_snapshots":[{"event_id":"sha256:1d33f92c5708c2a850b6136b3bf3f118753a1d985242ea72b1cfc28525ba7d94","target":"graph","created_at":"2026-07-05T01:42:52Z","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/2001.08271/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) constitutes one of the often mentioned candidates expected to yield a quantum boost in the era of near-term quantum computing. In practice, quantum optimization will have to compete with cheaper classical heuristic methods, which have the advantage of decades of empirical domain-specific enhancements. Consequently, to achieve optimal performance we will face the issue of algorithm selection, well-studied in practical computing. Here we introduce this problem to the quantum optimization domain.\n  Specifically, we study the problem of detecti","authors_text":"Charles Moussa, Henri Calandra, Vedran Dunjko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-22T20:42:02Z","title":"To quantum or not to quantum: towards algorithm selection in near-term quantum optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.08271","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:49f98d383576757b643910f1310bcab1d1cbebb2dc9fd89335307ac6586a4452","target":"record","created_at":"2026-07-05T01:42:52Z","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":"1c84d14e0e55f84822c3b76c4f635f3f36cce4f53651dd5033d877df66b0039f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-22T20:42:02Z","title_canon_sha256":"1cf938d83bb8a8103fac1553a8b33b0fd2244fb753edf1622933bc64908b1c31"},"schema_version":"1.0","source":{"id":"2001.08271","kind":"arxiv","version":2}},"canonical_sha256":"93a225ac7bffefec8d992b8c80103a90d035ad94531bea2560ea14b4880fc1a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93a225ac7bffefec8d992b8c80103a90d035ad94531bea2560ea14b4880fc1a4","first_computed_at":"2026-07-05T01:42:52.792026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:42:52.792026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dkMIf2GX0FBhQAd4L/ce7yJP4x/e250HNFtH+DXeMUovf13ifgRZRWMYFxUQ4apbuNGbCrCUQRnKc9OwV6maBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:42:52.792444Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.08271","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49f98d383576757b643910f1310bcab1d1cbebb2dc9fd89335307ac6586a4452","sha256:1d33f92c5708c2a850b6136b3bf3f118753a1d985242ea72b1cfc28525ba7d94"],"state_sha256":"3ebb0418cb75016e15c459e73f5be2eb489e4e7b7f19d03feb00f4410275c8ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HY4ACMFLdmEq4jY6H5UKN9O4oVxfmhU66DrN8K+4CAbpyh9QE+uOUSksFblTb0CxMpxwTicXC/sLOpOhtIBVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T20:44:11.081999Z","bundle_sha256":"84c6c931e7d02bdf6983bdd28da8ecfab6b846734c21afa3e1801236e8ba8377"}}