{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LJRRMMMFFNID65AJIXPTUUOHL6","short_pith_number":"pith:LJRRMMMF","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"},"canonical_sha256":"5a631631852b503f740945df3a51c75fa302d4e0606bab4d79116b0129c0954d","source":{"kind":"arxiv","id":"2501.05624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.05624","created_at":"2026-07-05T09:59:26Z"},{"alias_kind":"arxiv_version","alias_value":"2501.05624v1","created_at":"2026-07-05T09:59:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05624","created_at":"2026-07-05T09:59:26Z"},{"alias_kind":"pith_short_12","alias_value":"LJRRMMMFFNID","created_at":"2026-07-05T09:59:26Z"},{"alias_kind":"pith_short_16","alias_value":"LJRRMMMFFNID65AJ","created_at":"2026-07-05T09:59:26Z"},{"alias_kind":"pith_short_8","alias_value":"LJRRMMMF","created_at":"2026-07-05T09:59:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LJRRMMMFFNID65AJIXPTUUOHL6","target":"record","payload":{"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"},"canonical_sha256":"5a631631852b503f740945df3a51c75fa302d4e0606bab4d79116b0129c0954d","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"},"source_kind":"arxiv","source_id":"2501.05624","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-05T09:59:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4UsxKApeYL6cRIIh+4f48TIdossFxAN/A9uSBujo7wH9uygrKOITwVQ2+qKCH6KBrFHDCV7o2w/ja5WIkj7ZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:27:34.765917Z"},"content_sha256":"7321712a924ac20058d477d496d7af2282a8dcc90c004663f01b1637eda1bd0a","schema_version":"1.0","event_id":"sha256:7321712a924ac20058d477d496d7af2282a8dcc90c004663f01b1637eda1bd0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LJRRMMMFFNID65AJIXPTUUOHL6","target":"graph","payload":{"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"},"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-05T09:59:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6vgzATJ6Y/R9Ur9qE4GLJa6hINO/dDpXBDdhTRJv9NPs1bUlxeK5X69bULvcehqgf1zuguFI/BeBYI3CNm3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:27:34.766309Z"},"content_sha256":"81190d7b01f23367b4475f206b607dcfd0267e938731c199876c3b0ccad0fb9b","schema_version":"1.0","event_id":"sha256:81190d7b01f23367b4475f206b607dcfd0267e938731c199876c3b0ccad0fb9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6/bundle.json","state_url":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJRRMMMFFNID65AJIXPTUUOHL6/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-22T13:27:34Z","links":{"resolver":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6","bundle":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6/bundle.json","state":"https://pith.science/pith/LJRRMMMFFNID65AJIXPTUUOHL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJRRMMMFFNID65AJIXPTUUOHL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LJRRMMMFFNID65AJIXPTUUOHL6","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":"300d9d2270f0816036f4cedaa0139ef67f4bf70f377598d10842d16c75f933fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-09T23:47:23Z","title_canon_sha256":"1de902f3b12cddd204cdfe76dfd75d3e93529f11b2b3bc4ef1ecb77a47a8a67d"},"schema_version":"1.0","source":{"id":"2501.05624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.05624","created_at":"2026-07-05T09:59:26Z"},{"alias_kind":"arxiv_version","alias_value":"2501.05624v1","created_at":"2026-07-05T09:59:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05624","created_at":"2026-07-05T09:59:26Z"},{"alias_kind":"pith_short_12","alias_value":"LJRRMMMFFNID","created_at":"2026-07-05T09:59:26Z"},{"alias_kind":"pith_short_16","alias_value":"LJRRMMMFFNID65AJ","created_at":"2026-07-05T09:59:26Z"},{"alias_kind":"pith_short_8","alias_value":"LJRRMMMF","created_at":"2026-07-05T09:59:26Z"}],"graph_snapshots":[{"event_id":"sha256:81190d7b01f23367b4475f206b607dcfd0267e938731c199876c3b0ccad0fb9b","target":"graph","created_at":"2026-07-05T09:59:26Z","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/2501.05624/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Arul Rhik Mazumder, Fei Li, Max Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-09T23:47:23Z","title":"Quantum Annealing Approaches to Solving the Shipment Rerouting Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05624","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:7321712a924ac20058d477d496d7af2282a8dcc90c004663f01b1637eda1bd0a","target":"record","created_at":"2026-07-05T09:59:26Z","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":"300d9d2270f0816036f4cedaa0139ef67f4bf70f377598d10842d16c75f933fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-09T23:47:23Z","title_canon_sha256":"1de902f3b12cddd204cdfe76dfd75d3e93529f11b2b3bc4ef1ecb77a47a8a67d"},"schema_version":"1.0","source":{"id":"2501.05624","kind":"arxiv","version":1}},"canonical_sha256":"5a631631852b503f740945df3a51c75fa302d4e0606bab4d79116b0129c0954d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a631631852b503f740945df3a51c75fa302d4e0606bab4d79116b0129c0954d","first_computed_at":"2026-07-05T09:59:26.263580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:59:26.263580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"37YszLl7CtmFG7xsKfR7Iobq8MqwbEcs0IF7hKfyr9M5syxWnwwX3pquznBsBjMOpPBKXxcWJRCf4oyHO3uqAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:59:26.263922Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.05624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7321712a924ac20058d477d496d7af2282a8dcc90c004663f01b1637eda1bd0a","sha256:81190d7b01f23367b4475f206b607dcfd0267e938731c199876c3b0ccad0fb9b"],"state_sha256":"9ca8a63d1f22b76bd73a7d07384036937067b14ef4c8ec5a9ee2c73391fc5b24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yyXhuEeR/1mGpw8W+IBErTHD2RLPAFwkkm3job31OcxH55pDgcNLuKV+wWLl8yg9qu5TVOtZJY3emQiWN0AXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:27:34.769860Z","bundle_sha256":"a82b21e45eab75bf0e9f7148675d125465acb18b70bbc985d7e11a9a5137cbcb"}}