{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RPHRZCPIYPKKBV6BZZKHU2GZK4","short_pith_number":"pith:RPHRZCPI","canonical_record":{"source":{"id":"2507.05373","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-07T18:02:13Z","cross_cats_sorted":[],"title_canon_sha256":"bcc2aa65de91ff37aacde477731507bf40120caac784939f9fa6e17529f962de","abstract_canon_sha256":"db540f65f76580cdc397dba8c0ce816611e1a00ab0f54b2875ef63e81fe7f4c0"},"schema_version":"1.0"},"canonical_sha256":"8bcf1c89e8c3d4a0d7c1ce547a68d95705a8d6c7baa1f33427ea487e3df34d48","source":{"kind":"arxiv","id":"2507.05373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05373","created_at":"2026-07-05T11:33:29Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05373v1","created_at":"2026-07-05T11:33:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05373","created_at":"2026-07-05T11:33:29Z"},{"alias_kind":"pith_short_12","alias_value":"RPHRZCPIYPKK","created_at":"2026-07-05T11:33:29Z"},{"alias_kind":"pith_short_16","alias_value":"RPHRZCPIYPKKBV6B","created_at":"2026-07-05T11:33:29Z"},{"alias_kind":"pith_short_8","alias_value":"RPHRZCPI","created_at":"2026-07-05T11:33:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RPHRZCPIYPKKBV6BZZKHU2GZK4","target":"record","payload":{"canonical_record":{"source":{"id":"2507.05373","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-07T18:02:13Z","cross_cats_sorted":[],"title_canon_sha256":"bcc2aa65de91ff37aacde477731507bf40120caac784939f9fa6e17529f962de","abstract_canon_sha256":"db540f65f76580cdc397dba8c0ce816611e1a00ab0f54b2875ef63e81fe7f4c0"},"schema_version":"1.0"},"canonical_sha256":"8bcf1c89e8c3d4a0d7c1ce547a68d95705a8d6c7baa1f33427ea487e3df34d48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:29.379096Z","signature_b64":"GMR71xne/awVBLLxLVeuSx4ZcCzjT2/UIGPYBy6mlg2YFHdwQXGdViF0DlAP/mC2WB8HIqp1lqIPMofnf2ofBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bcf1c89e8c3d4a0d7c1ce547a68d95705a8d6c7baa1f33427ea487e3df34d48","last_reissued_at":"2026-07-05T11:33:29.378640Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:29.378640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.05373","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-07-05T11:33:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8YRb4fnWFIf82KXUZEJi84R3WiUInTY0V3fNXln1bxjy/hXjSvu+0+OPeWocz+uCp7CPJhE0+ZyE9sAPf1qyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:29:28.235756Z"},"content_sha256":"9b3b37daffa3e0956c861844c159b5c68cca99e24ae42fb9920a07e202f9cd91","schema_version":"1.0","event_id":"sha256:9b3b37daffa3e0956c861844c159b5c68cca99e24ae42fb9920a07e202f9cd91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RPHRZCPIYPKKBV6BZZKHU2GZK4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Large-Scale Vehicle Routing Problems with Hybrid Quantum-Classical Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Maciejunes, Dan Gunlycke, John Stenger, Nikos Chrisochoides","submitted_at":"2025-07-07T18:02:13Z","abstract_excerpt":"We present a two-level decomposition strategy for solving the Vehicle Routing Problem (VRP) using the Quantum Approximate Optimization Algorithm. A Problem-Level Decomposition partitions a 13-node (156-qubit) VRP into smaller Traveling Salesman Problem (TSP) instances. Each TSP is then further cut via Circuit-Level Decomposition, enabling execution on near-term quantum devices. Our approach achieves up to 95\\% reductions in the circuit depth, 96\\% reduction in the number of qubits and a 99.5\\% reduction in the number of 2-qubit gates. We demonstrate this hybrid algorithm on the standard edge e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05373","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/2507.05373/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-05T11:33:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmibVSJWfT3d5qDlGjutSGTm7/TP9Y1EL1wOZSbvU8SsYy8ig6ePyKHyM4mp8fDngmRyWlDJttbXnR/+QX3kCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:29:28.236424Z"},"content_sha256":"86cd83cccbb7aed307a08f9c72c5ceb45c6ec0ac60be1ecaec4e7f38b091bb6c","schema_version":"1.0","event_id":"sha256:86cd83cccbb7aed307a08f9c72c5ceb45c6ec0ac60be1ecaec4e7f38b091bb6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/bundle.json","state_url":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/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-04T14:29:28Z","links":{"resolver":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4","bundle":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/bundle.json","state":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RPHRZCPIYPKKBV6BZZKHU2GZK4","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":"db540f65f76580cdc397dba8c0ce816611e1a00ab0f54b2875ef63e81fe7f4c0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-07T18:02:13Z","title_canon_sha256":"bcc2aa65de91ff37aacde477731507bf40120caac784939f9fa6e17529f962de"},"schema_version":"1.0","source":{"id":"2507.05373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05373","created_at":"2026-07-05T11:33:29Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05373v1","created_at":"2026-07-05T11:33:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05373","created_at":"2026-07-05T11:33:29Z"},{"alias_kind":"pith_short_12","alias_value":"RPHRZCPIYPKK","created_at":"2026-07-05T11:33:29Z"},{"alias_kind":"pith_short_16","alias_value":"RPHRZCPIYPKKBV6B","created_at":"2026-07-05T11:33:29Z"},{"alias_kind":"pith_short_8","alias_value":"RPHRZCPI","created_at":"2026-07-05T11:33:29Z"}],"graph_snapshots":[{"event_id":"sha256:86cd83cccbb7aed307a08f9c72c5ceb45c6ec0ac60be1ecaec4e7f38b091bb6c","target":"graph","created_at":"2026-07-05T11:33:29Z","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/2507.05373/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a two-level decomposition strategy for solving the Vehicle Routing Problem (VRP) using the Quantum Approximate Optimization Algorithm. A Problem-Level Decomposition partitions a 13-node (156-qubit) VRP into smaller Traveling Salesman Problem (TSP) instances. Each TSP is then further cut via Circuit-Level Decomposition, enabling execution on near-term quantum devices. Our approach achieves up to 95\\% reductions in the circuit depth, 96\\% reduction in the number of qubits and a 99.5\\% reduction in the number of 2-qubit gates. We demonstrate this hybrid algorithm on the standard edge e","authors_text":"Andrew Maciejunes, Dan Gunlycke, John Stenger, Nikos Chrisochoides","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-07T18:02:13Z","title":"Solving Large-Scale Vehicle Routing Problems with Hybrid Quantum-Classical Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05373","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:9b3b37daffa3e0956c861844c159b5c68cca99e24ae42fb9920a07e202f9cd91","target":"record","created_at":"2026-07-05T11:33:29Z","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":"db540f65f76580cdc397dba8c0ce816611e1a00ab0f54b2875ef63e81fe7f4c0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-07T18:02:13Z","title_canon_sha256":"bcc2aa65de91ff37aacde477731507bf40120caac784939f9fa6e17529f962de"},"schema_version":"1.0","source":{"id":"2507.05373","kind":"arxiv","version":1}},"canonical_sha256":"8bcf1c89e8c3d4a0d7c1ce547a68d95705a8d6c7baa1f33427ea487e3df34d48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bcf1c89e8c3d4a0d7c1ce547a68d95705a8d6c7baa1f33427ea487e3df34d48","first_computed_at":"2026-07-05T11:33:29.378640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:29.378640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GMR71xne/awVBLLxLVeuSx4ZcCzjT2/UIGPYBy6mlg2YFHdwQXGdViF0DlAP/mC2WB8HIqp1lqIPMofnf2ofBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:29.379096Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.05373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b3b37daffa3e0956c861844c159b5c68cca99e24ae42fb9920a07e202f9cd91","sha256:86cd83cccbb7aed307a08f9c72c5ceb45c6ec0ac60be1ecaec4e7f38b091bb6c"],"state_sha256":"d22737ddf64a32faef827e3cce6d7fcf8cc62e828052e1e748e073dfb314d414"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQ8XIqOzaWtMnuzaDtWMdbJeTPp2tbdhjEdO1dI/YSKlnw7WvgS9XDQH8YFzT2uQ2GYsq8TPsm8/ujrb66I/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T14:29:28.280808Z","bundle_sha256":"f0268ccfbb83eff6e0a6b69f183c1e6c5660e869e7ae7144d96ac88edeff820b"}}