{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TFN6SB6P4DXI6IZEJBJRFOT6FX","short_pith_number":"pith:TFN6SB6P","canonical_record":{"source":{"id":"2507.20844","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T13:53:17Z","cross_cats_sorted":[],"title_canon_sha256":"26c7b175877bacfb35477482aaad7899dc084e3e838bf322eaa4207a591d1069","abstract_canon_sha256":"f4981ab9868917512c2348d2dfda50339bb80d75a5e0c0da0cffbdc328310dc4"},"schema_version":"1.0"},"canonical_sha256":"995be907cfe0ee8f2324485312ba7e2df8a2b511210382eb89668b28e7a9c40e","source":{"kind":"arxiv","id":"2507.20844","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20844","created_at":"2026-07-05T11:44:26Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20844v1","created_at":"2026-07-05T11:44:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20844","created_at":"2026-07-05T11:44:26Z"},{"alias_kind":"pith_short_12","alias_value":"TFN6SB6P4DXI","created_at":"2026-07-05T11:44:26Z"},{"alias_kind":"pith_short_16","alias_value":"TFN6SB6P4DXI6IZE","created_at":"2026-07-05T11:44:26Z"},{"alias_kind":"pith_short_8","alias_value":"TFN6SB6P","created_at":"2026-07-05T11:44:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TFN6SB6P4DXI6IZEJBJRFOT6FX","target":"record","payload":{"canonical_record":{"source":{"id":"2507.20844","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T13:53:17Z","cross_cats_sorted":[],"title_canon_sha256":"26c7b175877bacfb35477482aaad7899dc084e3e838bf322eaa4207a591d1069","abstract_canon_sha256":"f4981ab9868917512c2348d2dfda50339bb80d75a5e0c0da0cffbdc328310dc4"},"schema_version":"1.0"},"canonical_sha256":"995be907cfe0ee8f2324485312ba7e2df8a2b511210382eb89668b28e7a9c40e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:26.893814Z","signature_b64":"HoNbj+uDvwlNt+1gdKsdD30rGpt33ZhBYHp0e0U6cyr+u5+LB0ZDIEhei5Aat/LTcn0FlOlB23bqvodIiw+TBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"995be907cfe0ee8f2324485312ba7e2df8a2b511210382eb89668b28e7a9c40e","last_reissued_at":"2026-07-05T11:44:26.893407Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:26.893407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.20844","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:44:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q78Ih+X6dD1egRL9i0Ejwnp8PoldYg1yUqC3BN7DYibHVgryUYMKQoCO+UGMW2N9FrMXqhB2B4vhqlIxYC7uBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T20:12:00.926543Z"},"content_sha256":"f873fece65b837da9c63a7276e46120629e2f780eea90f0f753a04591ed660a0","schema_version":"1.0","event_id":"sha256:f873fece65b837da9c63a7276e46120629e2f780eea90f0f753a04591ed660a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TFN6SB6P4DXI6IZEJBJRFOT6FX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Route Optimization Over Scheduled Services For Large-Scale Package Delivery Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ahmed El Nashar, Mohammed Faisal Ahmed, Pascal Van Hentenryck","submitted_at":"2025-07-28T13:53:17Z","abstract_excerpt":"This paper introduces the Trailer Path Optimization with Schedule Services Problem (TPOSSP) and proposes a column-generation heuristic (CG-heuristic) to find high-quality solutions to large-scale instances. The TPOSSP aims at determining trailer routes over a time-dependent network using existing scheduled services, while considering tractor capacity constraints and time windows for trailer pickups and deliveries. The objective is to minimize both the number of schedules used and the total miles traveled. To address the large scale of industrial instances, the paper proposes a network reductio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20844","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.20844/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:44:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KztZSstOiVY0wB1NZjpWWCrPpduEXqJ3fVYFadP0L1dr2DMnlZVi8P7KqQqkbMilpSURA7ALhhLu7AQUtpJPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T20:12:00.927070Z"},"content_sha256":"07e051fa5f72cc925e3c0eaa3c7ee47a8493db5fad48592ac1490a9d392d5507","schema_version":"1.0","event_id":"sha256:07e051fa5f72cc925e3c0eaa3c7ee47a8493db5fad48592ac1490a9d392d5507"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFN6SB6P4DXI6IZEJBJRFOT6FX/bundle.json","state_url":"https://pith.science/pith/TFN6SB6P4DXI6IZEJBJRFOT6FX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFN6SB6P4DXI6IZEJBJRFOT6FX/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-10T20:12:00Z","links":{"resolver":"https://pith.science/pith/TFN6SB6P4DXI6IZEJBJRFOT6FX","bundle":"https://pith.science/pith/TFN6SB6P4DXI6IZEJBJRFOT6FX/bundle.json","state":"https://pith.science/pith/TFN6SB6P4DXI6IZEJBJRFOT6FX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFN6SB6P4DXI6IZEJBJRFOT6FX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TFN6SB6P4DXI6IZEJBJRFOT6FX","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":"f4981ab9868917512c2348d2dfda50339bb80d75a5e0c0da0cffbdc328310dc4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T13:53:17Z","title_canon_sha256":"26c7b175877bacfb35477482aaad7899dc084e3e838bf322eaa4207a591d1069"},"schema_version":"1.0","source":{"id":"2507.20844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20844","created_at":"2026-07-05T11:44:26Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20844v1","created_at":"2026-07-05T11:44:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20844","created_at":"2026-07-05T11:44:26Z"},{"alias_kind":"pith_short_12","alias_value":"TFN6SB6P4DXI","created_at":"2026-07-05T11:44:26Z"},{"alias_kind":"pith_short_16","alias_value":"TFN6SB6P4DXI6IZE","created_at":"2026-07-05T11:44:26Z"},{"alias_kind":"pith_short_8","alias_value":"TFN6SB6P","created_at":"2026-07-05T11:44:26Z"}],"graph_snapshots":[{"event_id":"sha256:07e051fa5f72cc925e3c0eaa3c7ee47a8493db5fad48592ac1490a9d392d5507","target":"graph","created_at":"2026-07-05T11:44: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/2507.20844/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces the Trailer Path Optimization with Schedule Services Problem (TPOSSP) and proposes a column-generation heuristic (CG-heuristic) to find high-quality solutions to large-scale instances. The TPOSSP aims at determining trailer routes over a time-dependent network using existing scheduled services, while considering tractor capacity constraints and time windows for trailer pickups and deliveries. The objective is to minimize both the number of schedules used and the total miles traveled. To address the large scale of industrial instances, the paper proposes a network reductio","authors_text":"Ahmed El Nashar, Mohammed Faisal Ahmed, Pascal Van Hentenryck","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T13:53:17Z","title":"Route Optimization Over Scheduled Services For Large-Scale Package Delivery Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20844","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:f873fece65b837da9c63a7276e46120629e2f780eea90f0f753a04591ed660a0","target":"record","created_at":"2026-07-05T11:44: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":"f4981ab9868917512c2348d2dfda50339bb80d75a5e0c0da0cffbdc328310dc4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T13:53:17Z","title_canon_sha256":"26c7b175877bacfb35477482aaad7899dc084e3e838bf322eaa4207a591d1069"},"schema_version":"1.0","source":{"id":"2507.20844","kind":"arxiv","version":1}},"canonical_sha256":"995be907cfe0ee8f2324485312ba7e2df8a2b511210382eb89668b28e7a9c40e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"995be907cfe0ee8f2324485312ba7e2df8a2b511210382eb89668b28e7a9c40e","first_computed_at":"2026-07-05T11:44:26.893407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:26.893407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HoNbj+uDvwlNt+1gdKsdD30rGpt33ZhBYHp0e0U6cyr+u5+LB0ZDIEhei5Aat/LTcn0FlOlB23bqvodIiw+TBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:26.893814Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.20844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f873fece65b837da9c63a7276e46120629e2f780eea90f0f753a04591ed660a0","sha256:07e051fa5f72cc925e3c0eaa3c7ee47a8493db5fad48592ac1490a9d392d5507"],"state_sha256":"049f15a5de54a1d0c140ecf9d2a33a1d09b807251a830692f456e779aff335fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UAJ93god10cXLJZF+f68DYEWFcEth3XRms8yhafO1jr87hnq6mPkuhpW+FuTabG6BKbXWRIiw0LLYR2t2pQhDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T20:12:00.933113Z","bundle_sha256":"56ec8a739e20402201da26824265c40c48318eabcc78e4928a0ea5bfb0d335c6"}}