{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DX5UZYJAHMZ5DKSEEKDVA5U7XN","short_pith_number":"pith:DX5UZYJA","canonical_record":{"source":{"id":"2004.14473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-29T21:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"12793400c15cf0f2f8f819cec48f79ad9c618ef405d387d112728b7f13e42b48","abstract_canon_sha256":"dbe4b50c09bf54bb320048250f180db7ea8ba9ae7dea7e16fe33121767b71388"},"schema_version":"1.0"},"canonical_sha256":"1dfb4ce1203b33d1aa44228750769fbb7b5ac8a1f18a38f443dd71b8ab4529d4","source":{"kind":"arxiv","id":"2004.14473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.14473","created_at":"2026-07-05T00:59:26Z"},{"alias_kind":"arxiv_version","alias_value":"2004.14473v1","created_at":"2026-07-05T00:59:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.14473","created_at":"2026-07-05T00:59:26Z"},{"alias_kind":"pith_short_12","alias_value":"DX5UZYJAHMZ5","created_at":"2026-07-05T00:59:26Z"},{"alias_kind":"pith_short_16","alias_value":"DX5UZYJAHMZ5DKSE","created_at":"2026-07-05T00:59:26Z"},{"alias_kind":"pith_short_8","alias_value":"DX5UZYJA","created_at":"2026-07-05T00:59:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DX5UZYJAHMZ5DKSEEKDVA5U7XN","target":"record","payload":{"canonical_record":{"source":{"id":"2004.14473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-29T21:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"12793400c15cf0f2f8f819cec48f79ad9c618ef405d387d112728b7f13e42b48","abstract_canon_sha256":"dbe4b50c09bf54bb320048250f180db7ea8ba9ae7dea7e16fe33121767b71388"},"schema_version":"1.0"},"canonical_sha256":"1dfb4ce1203b33d1aa44228750769fbb7b5ac8a1f18a38f443dd71b8ab4529d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:59:26.617804Z","signature_b64":"JwygZ/2xz+BvyUqW4ikRMstHLPbncT7BautyNavFW5b9uufeMknFeZcp/wNgykYqnFrGXTjNQaO56mk8+64cAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dfb4ce1203b33d1aa44228750769fbb7b5ac8a1f18a38f443dd71b8ab4529d4","last_reissued_at":"2026-07-05T00:59:26.617295Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:59:26.617295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.14473","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-05T00: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":"UkcG8wvwvfNutVRSnOwcMTE5dTYv0QwilBxdXI8a3AUZBVLWz1UtfdedktuMyGuYOkd9GNk7FzNuNwAdXx6tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T00:01:43.165280Z"},"content_sha256":"9ef793ef668835b4ca3b1f9963703f433329368ee4cdcbb0a8559deae20b20e5","schema_version":"1.0","event_id":"sha256:9ef793ef668835b4ca3b1f9963703f433329368ee4cdcbb0a8559deae20b20e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DX5UZYJAHMZ5DKSEEKDVA5U7XN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Arc Routing with Time-Dependent Travel Times and Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Minh Ho\\`ang H\\`a, Rafael Martinelli, Thibaut Vidal, Tuan Anh Pham","submitted_at":"2020-04-29T21:01:16Z","abstract_excerpt":"Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents the shortest path between two locations. Studies on time-dependent routing followed this model and therefore defined the speed functions on the complete graph. We argue that this model is often inadequate, in particular for arc routing problems involving services on edges of a road network. To fill this gap, we formally define the time-dependent capacitated arc routing problem (TDCARP), with travel and service speed functions given directly at the network level. Under these assump"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.14473","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/2004.14473/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-05T00: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":"xvmZKRGn+rgZaOVlJtaFq0PynZv0kJ4WXeJBr1c2AoUvQwMwQ0DhKUYc5ml9L/JU0u4cCyCb+1bH+X9Y1VT0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T00:01:43.165780Z"},"content_sha256":"e9cc4437a9be6e13994f08e9fdb8192d8596f223ba18a780a0288b453616ed45","schema_version":"1.0","event_id":"sha256:e9cc4437a9be6e13994f08e9fdb8192d8596f223ba18a780a0288b453616ed45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DX5UZYJAHMZ5DKSEEKDVA5U7XN/bundle.json","state_url":"https://pith.science/pith/DX5UZYJAHMZ5DKSEEKDVA5U7XN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DX5UZYJAHMZ5DKSEEKDVA5U7XN/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-21T00:01:43Z","links":{"resolver":"https://pith.science/pith/DX5UZYJAHMZ5DKSEEKDVA5U7XN","bundle":"https://pith.science/pith/DX5UZYJAHMZ5DKSEEKDVA5U7XN/bundle.json","state":"https://pith.science/pith/DX5UZYJAHMZ5DKSEEKDVA5U7XN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DX5UZYJAHMZ5DKSEEKDVA5U7XN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DX5UZYJAHMZ5DKSEEKDVA5U7XN","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":"dbe4b50c09bf54bb320048250f180db7ea8ba9ae7dea7e16fe33121767b71388","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-29T21:01:16Z","title_canon_sha256":"12793400c15cf0f2f8f819cec48f79ad9c618ef405d387d112728b7f13e42b48"},"schema_version":"1.0","source":{"id":"2004.14473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.14473","created_at":"2026-07-05T00:59:26Z"},{"alias_kind":"arxiv_version","alias_value":"2004.14473v1","created_at":"2026-07-05T00:59:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.14473","created_at":"2026-07-05T00:59:26Z"},{"alias_kind":"pith_short_12","alias_value":"DX5UZYJAHMZ5","created_at":"2026-07-05T00:59:26Z"},{"alias_kind":"pith_short_16","alias_value":"DX5UZYJAHMZ5DKSE","created_at":"2026-07-05T00:59:26Z"},{"alias_kind":"pith_short_8","alias_value":"DX5UZYJA","created_at":"2026-07-05T00:59:26Z"}],"graph_snapshots":[{"event_id":"sha256:e9cc4437a9be6e13994f08e9fdb8192d8596f223ba18a780a0288b453616ed45","target":"graph","created_at":"2026-07-05T00: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/2004.14473/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents the shortest path between two locations. Studies on time-dependent routing followed this model and therefore defined the speed functions on the complete graph. We argue that this model is often inadequate, in particular for arc routing problems involving services on edges of a road network. To fill this gap, we formally define the time-dependent capacitated arc routing problem (TDCARP), with travel and service speed functions given directly at the network level. Under these assump","authors_text":"Minh Ho\\`ang H\\`a, Rafael Martinelli, Thibaut Vidal, Tuan Anh Pham","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-29T21:01:16Z","title":"Arc Routing with Time-Dependent Travel Times and Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.14473","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:9ef793ef668835b4ca3b1f9963703f433329368ee4cdcbb0a8559deae20b20e5","target":"record","created_at":"2026-07-05T00: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":"dbe4b50c09bf54bb320048250f180db7ea8ba9ae7dea7e16fe33121767b71388","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-29T21:01:16Z","title_canon_sha256":"12793400c15cf0f2f8f819cec48f79ad9c618ef405d387d112728b7f13e42b48"},"schema_version":"1.0","source":{"id":"2004.14473","kind":"arxiv","version":1}},"canonical_sha256":"1dfb4ce1203b33d1aa44228750769fbb7b5ac8a1f18a38f443dd71b8ab4529d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dfb4ce1203b33d1aa44228750769fbb7b5ac8a1f18a38f443dd71b8ab4529d4","first_computed_at":"2026-07-05T00:59:26.617295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:59:26.617295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JwygZ/2xz+BvyUqW4ikRMstHLPbncT7BautyNavFW5b9uufeMknFeZcp/wNgykYqnFrGXTjNQaO56mk8+64cAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:59:26.617804Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.14473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ef793ef668835b4ca3b1f9963703f433329368ee4cdcbb0a8559deae20b20e5","sha256:e9cc4437a9be6e13994f08e9fdb8192d8596f223ba18a780a0288b453616ed45"],"state_sha256":"44dc93a86b4ae25a31e82277b2fe11c14d5c0af7f5a62899fefa6d4c6a1cf283"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALuhMTBVGo8dzU3z0tKCLrekCh7M6Ne+ZxPKDWcdTTmotR5wPlEPwiO0gVqMMPUt1QnNsixLR8XlROiJJ+5HBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T00:01:43.170504Z","bundle_sha256":"c7c38908b7adaf32b79dd8eb2539a5221802dfcb0aa36349e927c6b4e6750ce4"}}