{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MIDMAWYG6VJWCKB3NOTUYX7WKP","short_pith_number":"pith:MIDMAWYG","schema_version":"1.0","canonical_sha256":"6206c05b06f55361283b6ba74c5ff653f14f80bea2e89b47114b91f29bf37cc7","source":{"kind":"arxiv","id":"2402.17520","version":2},"attestation_state":"computed","paper":{"title":"Quantum Computing in Logistics and Supply Chain Management an Overview","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frank Phillipson","submitted_at":"2024-02-27T14:04:08Z","abstract_excerpt":"The work explores the integration of quantum computing into logistics and supply chain management, emphasising its potential for use in complex optimisation problems. The discussion introduces quantum computing principles, focusing on quantum annealing and gate-based quantum computing, with the Quantum Approximate Optimisation Algorithm and Quantum Annealing as key algorithmic approaches. The paper provides an overview of quantum approaches to routing, logistic network design, fleet maintenance, cargo loading, prediction, and scheduling problems. Notably, most solutions in the literature are h"},"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":"2402.17520","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-27T14:04:08Z","cross_cats_sorted":[],"title_canon_sha256":"b951ed70b96c650cb6730163976470ec5861a680d47097cef9e81b5b3b13c9ff","abstract_canon_sha256":"5d3f30de50a4d5063187a983e6637862d2a5971b2ad4a50bbff0bcf8475a9978"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:24.417163Z","signature_b64":"zVgGl/O0e3AgVkQsnjLO/ELjGCLblY0yQeLOWG5ExIPgNSVopQ+ZjgKyeabZwVw16YaGA3LWumARgzObK/EDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6206c05b06f55361283b6ba74c5ff653f14f80bea2e89b47114b91f29bf37cc7","last_reissued_at":"2026-07-05T10:43:24.416611Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:24.416611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Computing in Logistics and Supply Chain Management an Overview","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frank Phillipson","submitted_at":"2024-02-27T14:04:08Z","abstract_excerpt":"The work explores the integration of quantum computing into logistics and supply chain management, emphasising its potential for use in complex optimisation problems. The discussion introduces quantum computing principles, focusing on quantum annealing and gate-based quantum computing, with the Quantum Approximate Optimisation Algorithm and Quantum Annealing as key algorithmic approaches. The paper provides an overview of quantum approaches to routing, logistic network design, fleet maintenance, cargo loading, prediction, and scheduling problems. Notably, most solutions in the literature are h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.17520","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/2402.17520/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":"2402.17520","created_at":"2026-07-05T10:43:24.416699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.17520v2","created_at":"2026-07-05T10:43:24.416699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.17520","created_at":"2026-07-05T10:43:24.416699+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIDMAWYG6VJW","created_at":"2026-07-05T10:43:24.416699+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIDMAWYG6VJWCKB3","created_at":"2026-07-05T10:43:24.416699+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIDMAWYG","created_at":"2026-07-05T10:43:24.416699+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07550","citing_title":"RL-Guided Quantum-ALNS for Constrained VRP","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26233","citing_title":"A fidelity metric for quantum annealing benchmarked by extreme scaling quantum Monte-Carlo simulations","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30415","citing_title":"Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems","ref_index":95,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00682","citing_title":"An Error-aware and Adaptive Method for the Estimation of Quantum Observables on Qudit-Based Quantum Computers","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20321","citing_title":"Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MIDMAWYG6VJWCKB3NOTUYX7WKP","json":"https://pith.science/pith/MIDMAWYG6VJWCKB3NOTUYX7WKP.json","graph_json":"https://pith.science/api/pith-number/MIDMAWYG6VJWCKB3NOTUYX7WKP/graph.json","events_json":"https://pith.science/api/pith-number/MIDMAWYG6VJWCKB3NOTUYX7WKP/events.json","paper":"https://pith.science/paper/MIDMAWYG"},"agent_actions":{"view_html":"https://pith.science/pith/MIDMAWYG6VJWCKB3NOTUYX7WKP","download_json":"https://pith.science/pith/MIDMAWYG6VJWCKB3NOTUYX7WKP.json","view_paper":"https://pith.science/paper/MIDMAWYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.17520&json=true","fetch_graph":"https://pith.science/api/pith-number/MIDMAWYG6VJWCKB3NOTUYX7WKP/graph.json","fetch_events":"https://pith.science/api/pith-number/MIDMAWYG6VJWCKB3NOTUYX7WKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIDMAWYG6VJWCKB3NOTUYX7WKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIDMAWYG6VJWCKB3NOTUYX7WKP/action/storage_attestation","attest_author":"https://pith.science/pith/MIDMAWYG6VJWCKB3NOTUYX7WKP/action/author_attestation","sign_citation":"https://pith.science/pith/MIDMAWYG6VJWCKB3NOTUYX7WKP/action/citation_signature","submit_replication":"https://pith.science/pith/MIDMAWYG6VJWCKB3NOTUYX7WKP/action/replication_record"}},"created_at":"2026-07-05T10:43:24.416699+00:00","updated_at":"2026-07-05T10:43:24.416699+00:00"}