{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LJRRMMMFFNID65AJIXPTUUOHL6","short_pith_number":"pith:LJRRMMMF","schema_version":"1.0","canonical_sha256":"5a631631852b503f740945df3a51c75fa302d4e0606bab4d79116b0129c0954d","source":{"kind":"arxiv","id":"2501.05624","version":1},"attestation_state":"computed","paper":{"title":"Quantum Annealing Approaches to Solving the Shipment Rerouting Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Arul Rhik Mazumder, Fei Li, Max Zhao","submitted_at":"2025-01-09T23:47:23Z","abstract_excerpt":"In this paper, we study a shipment rerouting problem (SRP) which generalizes many NP-hard sequencing and packing problems. A SRP's solution has ample practical applications in vehicle scheduling and transportation logistics. Given a network of hubs, a set of goods must be delivered by trucks from their source-hubs to their respective destination-hubs. The objective is to select a set of trucks and to schedule these trucks' routes so that the total cost is minimized. The problem SRP is NP-hard; only classical approximation algorithms have been known for some of its NP-hard variants. In this wor"},"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":"2501.05624","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-09T23:47:23Z","cross_cats_sorted":[],"title_canon_sha256":"1de902f3b12cddd204cdfe76dfd75d3e93529f11b2b3bc4ef1ecb77a47a8a67d","abstract_canon_sha256":"300d9d2270f0816036f4cedaa0139ef67f4bf70f377598d10842d16c75f933fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:26.263922Z","signature_b64":"37YszLl7CtmFG7xsKfR7Iobq8MqwbEcs0IF7hKfyr9M5syxWnwwX3pquznBsBjMOpPBKXxcWJRCf4oyHO3uqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a631631852b503f740945df3a51c75fa302d4e0606bab4d79116b0129c0954d","last_reissued_at":"2026-07-05T09:59:26.263580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:26.263580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Annealing Approaches to Solving the Shipment Rerouting Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Arul Rhik Mazumder, Fei Li, Max Zhao","submitted_at":"2025-01-09T23:47:23Z","abstract_excerpt":"In this paper, we study a shipment rerouting problem (SRP) which generalizes many NP-hard sequencing and packing problems. A SRP's solution has ample practical applications in vehicle scheduling and transportation logistics. Given a network of hubs, a set of goods must be delivered by trucks from their source-hubs to their respective destination-hubs. The objective is to select a set of trucks and to schedule these trucks' routes so that the total cost is minimized. The problem SRP is NP-hard; only classical approximation algorithms have been known for some of its NP-hard variants. In this wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05624","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/2501.05624/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":"2501.05624","created_at":"2026-07-05T09:59:26.263636+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.05624v1","created_at":"2026-07-05T09:59:26.263636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05624","created_at":"2026-07-05T09:59:26.263636+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJRRMMMFFNID","created_at":"2026-07-05T09:59:26.263636+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJRRMMMFFNID65AJ","created_at":"2026-07-05T09:59:26.263636+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJRRMMMF","created_at":"2026-07-05T09:59:26.263636+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/LJRRMMMFFNID65AJIXPTUUOHL6","json":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6.json","graph_json":"https://pith.science/api/pith-number/LJRRMMMFFNID65AJIXPTUUOHL6/graph.json","events_json":"https://pith.science/api/pith-number/LJRRMMMFFNID65AJIXPTUUOHL6/events.json","paper":"https://pith.science/paper/LJRRMMMF"},"agent_actions":{"view_html":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6","download_json":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6.json","view_paper":"https://pith.science/paper/LJRRMMMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.05624&json=true","fetch_graph":"https://pith.science/api/pith-number/LJRRMMMFFNID65AJIXPTUUOHL6/graph.json","fetch_events":"https://pith.science/api/pith-number/LJRRMMMFFNID65AJIXPTUUOHL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6/action/storage_attestation","attest_author":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6/action/author_attestation","sign_citation":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6/action/citation_signature","submit_replication":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6/action/replication_record"}},"created_at":"2026-07-05T09:59:26.263636+00:00","updated_at":"2026-07-05T09:59:26.263636+00:00"}