{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SORCLLD377X6ZDMZFOGIAEB2SD","short_pith_number":"pith:SORCLLD3","schema_version":"1.0","canonical_sha256":"93a225ac7bffefec8d992b8c80103a90d035ad94531bea2560ea14b4880fc1a4","source":{"kind":"arxiv","id":"2001.08271","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2001.08271","created_at":"2026-07-05T01:42:52.792086+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.08271v2","created_at":"2026-07-05T01:42:52.792086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.08271","created_at":"2026-07-05T01:42:52.792086+00:00"},{"alias_kind":"pith_short_12","alias_value":"SORCLLD377X6","created_at":"2026-07-05T01:42:52.792086+00:00"},{"alias_kind":"pith_short_16","alias_value":"SORCLLD377X6ZDMZ","created_at":"2026-07-05T01:42:52.792086+00:00"},{"alias_kind":"pith_short_8","alias_value":"SORCLLD3","created_at":"2026-07-05T01:42:52.792086+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD","json":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD.json","graph_json":"https://pith.science/api/pith-number/SORCLLD377X6ZDMZFOGIAEB2SD/graph.json","events_json":"https://pith.science/api/pith-number/SORCLLD377X6ZDMZFOGIAEB2SD/events.json","paper":"https://pith.science/paper/SORCLLD3"},"agent_actions":{"view_html":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD","download_json":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD.json","view_paper":"https://pith.science/paper/SORCLLD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.08271&json=true","fetch_graph":"https://pith.science/api/pith-number/SORCLLD377X6ZDMZFOGIAEB2SD/graph.json","fetch_events":"https://pith.science/api/pith-number/SORCLLD377X6ZDMZFOGIAEB2SD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD/action/storage_attestation","attest_author":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD/action/author_attestation","sign_citation":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD/action/citation_signature","submit_replication":"https://pith.science/pith/SORCLLD377X6ZDMZFOGIAEB2SD/action/replication_record"}},"created_at":"2026-07-05T01:42:52.792086+00:00","updated_at":"2026-07-05T01:42:52.792086+00:00"}