{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:K57JW6EGPLLJNJ3WPD3A6IFADJ","short_pith_number":"pith:K57JW6EG","canonical_record":{"source":{"id":"1501.05354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-21T23:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"8e69d24328404604c914d244c76a68ba2e9045118a7ec0ae57afc788a13a61cb","abstract_canon_sha256":"25593d3e9fd01ecebef1477c34d58cabea25bf101abc5c1189751611bf6be22b"},"schema_version":"1.0"},"canonical_sha256":"577e9b78867ad696a77678f60f20a01a5a25a269e569e9e00857080eb23cd0a9","source":{"kind":"arxiv","id":"1501.05354","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05354","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05354v2","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05354","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"K57JW6EGPLLJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K57JW6EGPLLJNJ3W","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K57JW6EG","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:K57JW6EGPLLJNJ3WPD3A6IFADJ","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-21T23:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"8e69d24328404604c914d244c76a68ba2e9045118a7ec0ae57afc788a13a61cb","abstract_canon_sha256":"25593d3e9fd01ecebef1477c34d58cabea25bf101abc5c1189751611bf6be22b"},"schema_version":"1.0"},"canonical_sha256":"577e9b78867ad696a77678f60f20a01a5a25a269e569e9e00857080eb23cd0a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:43.052008Z","signature_b64":"Ytc/WeVcpoU7GZwrTgSOkdg6bKhEts6YnVrYIZYU8Nx4aMyOfSthqxAdlFAmtvmZ3F3Vg3hKYWIbUnuu2pWkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"577e9b78867ad696a77678f60f20a01a5a25a269e569e9e00857080eb23cd0a9","last_reissued_at":"2026-05-18T00:19:43.051306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:43.051306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05354","source_version":2,"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-05-18T00:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVGaT3lezZJnLvnY/s+g7nqB7XRXwv3mZ7ZaugGXyyrunSDwzOUPsVjekGLekFQ0fAlDvVIc9cRKv+zdLsa9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:48:22.250446Z"},"content_sha256":"6f66ad2a7ba6c3799042e2a7c68c0f6454c2fe1d6a3f2c6e4d7efcc6fbc019b6","schema_version":"1.0","event_id":"sha256:6f66ad2a7ba6c3799042e2a7c68c0f6454c2fe1d6a3f2c6e4d7efcc6fbc019b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:K57JW6EGPLLJNJ3WPD3A6IFADJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A speed and departure time optimization algorithm for the Pollution-Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anand Subramanian, Nelson Maculan, Raphael Kramer, Thibaut Vidal","submitted_at":"2015-01-21T23:59:38Z","abstract_excerpt":"We propose a new speed and departure time optimization algorithm for the Pollution-Routing Problem (PRP), which runs in quadratic time and returns a certified optimal schedule. This algorithm is embedded into an iterated local search-based metaheuristic to achieve a combined speed, scheduling and routing optimization. The start of the working day is set as a decision variable for individual routes, thus enabling a better assignment of human resources to required demands. Some routes that were evaluated as unprofitable can now appear as viable candidates later in the day, leading to a larger se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05354","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":""},"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-05-18T00:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlypKJ9toNV6Sva9WdMJx5kYbdgj1ytK4jiAQnEzYdbMNigAO7sv370tQmRec7t5CrrHiXcSz6pOUZNXIWMIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:48:22.251173Z"},"content_sha256":"6841c573bfff9955dbf83bb9f7cf353d6f07afa78ca95d8b1fc168d76e92d27f","schema_version":"1.0","event_id":"sha256:6841c573bfff9955dbf83bb9f7cf353d6f07afa78ca95d8b1fc168d76e92d27f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/bundle.json","state_url":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/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-05-26T02:48:22Z","links":{"resolver":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ","bundle":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/bundle.json","state":"https://pith.science/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K57JW6EGPLLJNJ3WPD3A6IFADJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:K57JW6EGPLLJNJ3WPD3A6IFADJ","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":"25593d3e9fd01ecebef1477c34d58cabea25bf101abc5c1189751611bf6be22b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-21T23:59:38Z","title_canon_sha256":"8e69d24328404604c914d244c76a68ba2e9045118a7ec0ae57afc788a13a61cb"},"schema_version":"1.0","source":{"id":"1501.05354","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05354","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05354v2","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05354","created_at":"2026-05-18T00:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"K57JW6EGPLLJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K57JW6EGPLLJNJ3W","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K57JW6EG","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:6841c573bfff9955dbf83bb9f7cf353d6f07afa78ca95d8b1fc168d76e92d27f","target":"graph","created_at":"2026-05-18T00:19:43Z","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"},"paper":{"abstract_excerpt":"We propose a new speed and departure time optimization algorithm for the Pollution-Routing Problem (PRP), which runs in quadratic time and returns a certified optimal schedule. This algorithm is embedded into an iterated local search-based metaheuristic to achieve a combined speed, scheduling and routing optimization. The start of the working day is set as a decision variable for individual routes, thus enabling a better assignment of human resources to required demands. Some routes that were evaluated as unprofitable can now appear as viable candidates later in the day, leading to a larger se","authors_text":"Anand Subramanian, Nelson Maculan, Raphael Kramer, Thibaut Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-21T23:59:38Z","title":"A speed and departure time optimization algorithm for the Pollution-Routing Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05354","kind":"arxiv","version":2},"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:6f66ad2a7ba6c3799042e2a7c68c0f6454c2fe1d6a3f2c6e4d7efcc6fbc019b6","target":"record","created_at":"2026-05-18T00:19:43Z","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":"25593d3e9fd01ecebef1477c34d58cabea25bf101abc5c1189751611bf6be22b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-21T23:59:38Z","title_canon_sha256":"8e69d24328404604c914d244c76a68ba2e9045118a7ec0ae57afc788a13a61cb"},"schema_version":"1.0","source":{"id":"1501.05354","kind":"arxiv","version":2}},"canonical_sha256":"577e9b78867ad696a77678f60f20a01a5a25a269e569e9e00857080eb23cd0a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"577e9b78867ad696a77678f60f20a01a5a25a269e569e9e00857080eb23cd0a9","first_computed_at":"2026-05-18T00:19:43.051306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:43.051306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ytc/WeVcpoU7GZwrTgSOkdg6bKhEts6YnVrYIZYU8Nx4aMyOfSthqxAdlFAmtvmZ3F3Vg3hKYWIbUnuu2pWkAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:43.052008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05354","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f66ad2a7ba6c3799042e2a7c68c0f6454c2fe1d6a3f2c6e4d7efcc6fbc019b6","sha256:6841c573bfff9955dbf83bb9f7cf353d6f07afa78ca95d8b1fc168d76e92d27f"],"state_sha256":"774d9dd4c35ec542d5b80ac15edc66deeaebdee03b5c7bf3e5aa42fb2ebf3a03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UcB/JCSuxtoVUu3/kdq8031madznxwL5Jl5nVhBTaOokVs3yUfhEHs8aax9HOIvWbdpDrtOJWXMwqa3Q52cYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:48:22.254666Z","bundle_sha256":"27321ffa8e5732fe4d61939360dc34270b68e5c8a3e9ca7e99bf0042ae70999b"}}