{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P6KHWVJFWHAHQ2GVPYZSBOSAM3","short_pith_number":"pith:P6KHWVJF","schema_version":"1.0","canonical_sha256":"7f947b5525b1c07868d57e3320ba4066eca9258066f2d8c3917e077e719dd80d","source":{"kind":"arxiv","id":"2404.05551","version":1},"attestation_state":"computed","paper":{"title":"Improving Quantum and Classical Decomposition Methods for Vehicle Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Axel Plinge, Christian Ufrecht, Christopher Mutschler, Daniel D. Scherer, Friedrich Wagner, Laura S. Herzog, Lilly Palackal","submitted_at":"2024-04-08T14:19:25Z","abstract_excerpt":"Quantum computing is a promising technology to address combinatorial optimization problems, for example via the quantum approximate optimization algorithm (QAOA). Its potential, however, hinges on scaling toy problems to sizes relevant for industry. In this study, we address this challenge by an elaborate combination of two decomposition methods, namely graph shrinking and circuit cutting. Graph shrinking reduces the problem size before encoding into QAOA circuits, while circuit cutting decomposes quantum circuits into fragments for execution on medium-scale quantum computers. Our shrinking me"},"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":"2404.05551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-04-08T14:19:25Z","cross_cats_sorted":[],"title_canon_sha256":"37e074a7995c00e85af42890f94ec781bae9729d5d013ca4fe492b8cb723322c","abstract_canon_sha256":"060791fdbfc7cd87b3d62ec6d0e7415432cd3f4a9b2d199efd2708ba08f73320"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:05:42.315515Z","signature_b64":"l2Q2e1p4wQH4vx6UgULFKag5s6Sl5I/YsRTV6z8CaizmQqtAnqLDaqGnc7ALA/pLvxP2VEKuKr6w1uUXQJVADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f947b5525b1c07868d57e3320ba4066eca9258066f2d8c3917e077e719dd80d","last_reissued_at":"2026-07-05T08:05:42.315055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:05:42.315055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Quantum and Classical Decomposition Methods for Vehicle Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Axel Plinge, Christian Ufrecht, Christopher Mutschler, Daniel D. Scherer, Friedrich Wagner, Laura S. Herzog, Lilly Palackal","submitted_at":"2024-04-08T14:19:25Z","abstract_excerpt":"Quantum computing is a promising technology to address combinatorial optimization problems, for example via the quantum approximate optimization algorithm (QAOA). Its potential, however, hinges on scaling toy problems to sizes relevant for industry. In this study, we address this challenge by an elaborate combination of two decomposition methods, namely graph shrinking and circuit cutting. Graph shrinking reduces the problem size before encoding into QAOA circuits, while circuit cutting decomposes quantum circuits into fragments for execution on medium-scale quantum computers. Our shrinking me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05551","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.05551/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":"2404.05551","created_at":"2026-07-05T08:05:42.315113+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.05551v1","created_at":"2026-07-05T08:05:42.315113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05551","created_at":"2026-07-05T08:05:42.315113+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6KHWVJFWHAH","created_at":"2026-07-05T08:05:42.315113+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6KHWVJFWHAHQ2GV","created_at":"2026-07-05T08:05:42.315113+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6KHWVJF","created_at":"2026-07-05T08:05:42.315113+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.14955","citing_title":"Three ways to share a QPU: Scheduling strategies for hybrid Quantum-HPC applications","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P6KHWVJFWHAHQ2GVPYZSBOSAM3","json":"https://pith.science/pith/P6KHWVJFWHAHQ2GVPYZSBOSAM3.json","graph_json":"https://pith.science/api/pith-number/P6KHWVJFWHAHQ2GVPYZSBOSAM3/graph.json","events_json":"https://pith.science/api/pith-number/P6KHWVJFWHAHQ2GVPYZSBOSAM3/events.json","paper":"https://pith.science/paper/P6KHWVJF"},"agent_actions":{"view_html":"https://pith.science/pith/P6KHWVJFWHAHQ2GVPYZSBOSAM3","download_json":"https://pith.science/pith/P6KHWVJFWHAHQ2GVPYZSBOSAM3.json","view_paper":"https://pith.science/paper/P6KHWVJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.05551&json=true","fetch_graph":"https://pith.science/api/pith-number/P6KHWVJFWHAHQ2GVPYZSBOSAM3/graph.json","fetch_events":"https://pith.science/api/pith-number/P6KHWVJFWHAHQ2GVPYZSBOSAM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6KHWVJFWHAHQ2GVPYZSBOSAM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6KHWVJFWHAHQ2GVPYZSBOSAM3/action/storage_attestation","attest_author":"https://pith.science/pith/P6KHWVJFWHAHQ2GVPYZSBOSAM3/action/author_attestation","sign_citation":"https://pith.science/pith/P6KHWVJFWHAHQ2GVPYZSBOSAM3/action/citation_signature","submit_replication":"https://pith.science/pith/P6KHWVJFWHAHQ2GVPYZSBOSAM3/action/replication_record"}},"created_at":"2026-07-05T08:05:42.315113+00:00","updated_at":"2026-07-05T08:05:42.315113+00:00"}