{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GRKUHHVIRJSR3LRG7US5AFZOHJ","short_pith_number":"pith:GRKUHHVI","canonical_record":{"source":{"id":"1412.2123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-05T20:14:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"23cd50b81faf83c2a2970e3a3232b25ff38cc0dede0d3e393b2628074f155e3b","abstract_canon_sha256":"09306b7298510f308960ca2894da8e87c834d0c59bb7c642f3b255a110b30d9d"},"schema_version":"1.0"},"canonical_sha256":"3455439ea88a651dae26fd25d0172e3a604b86ab689d9d12817c2673333690b4","source":{"kind":"arxiv","id":"1412.2123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2123","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2123v1","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2123","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"GRKUHHVIRJSR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GRKUHHVIRJSR3LRG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GRKUHHVI","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GRKUHHVIRJSR3LRG7US5AFZOHJ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-05T20:14:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"23cd50b81faf83c2a2970e3a3232b25ff38cc0dede0d3e393b2628074f155e3b","abstract_canon_sha256":"09306b7298510f308960ca2894da8e87c834d0c59bb7c642f3b255a110b30d9d"},"schema_version":"1.0"},"canonical_sha256":"3455439ea88a651dae26fd25d0172e3a604b86ab689d9d12817c2673333690b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:00.659005Z","signature_b64":"FgYzFsqf2e3cQp3ZcQa3Jc0CGlPomTNzpo9+Gun9jx9b8a6Sb4rCS0hKhJy4Pe/B+QOVxdkrbAjnssM2xsv1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3455439ea88a651dae26fd25d0172e3a604b86ab689d9d12817c2673333690b4","last_reissued_at":"2026-05-18T02:32:00.658559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:00.658559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2123","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-05-18T02:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERQyYGRoy1pYrCIettO34SXwXBsCNSIj7Z8djWIGt3KOhNfhn9t8Ug3O1jtCWbw8fZ8wGB6Zv6IOxo1J/vlaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:10:20.352214Z"},"content_sha256":"5e842fa78da9bf994763495cf87fc104e2407c79aea19d9f2a3c0b1cc8ccbf2a","schema_version":"1.0","event_id":"sha256:5e842fa78da9bf994763495cf87fc104e2407c79aea19d9f2a3c0b1cc8ccbf2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GRKUHHVIRJSR3LRG7US5AFZOHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Multi-Depot Routing without Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Dawsen Hwang, Patrick Jaillet, Zhengyuan Zhou","submitted_at":"2014-12-05T20:14:58Z","abstract_excerpt":"We consider and formulate a class of distributed multi-depot routing problems, where servers are to visit a set of requests, with the aim of minimizing the total distance travelled by all servers. These problems fall into two categories: distributed offline routing problems where all the requests that need to be visited are known from the start; distributed online routing problems where the requests come to be known incrementally. A critical and novel feature of our formulations is that communications are not allowed among the servers, hence posing an interesting and challenging question: what"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2123","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":""},"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-18T02:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMCZ9NXPrd29OemqaByzJLXDLdgQ5PyjaYxbFRNXLMtpQaHIxee6c1nuYRk8AnxRomV4TBANELcuDa4mUQJaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:10:20.352574Z"},"content_sha256":"13cfa0dec28449afbdf1d3bb95b94c599bc2440582bf6e8b0271aae611a064f4","schema_version":"1.0","event_id":"sha256:13cfa0dec28449afbdf1d3bb95b94c599bc2440582bf6e8b0271aae611a064f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/bundle.json","state_url":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/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-30T12:10:20Z","links":{"resolver":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ","bundle":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/bundle.json","state":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GRKUHHVIRJSR3LRG7US5AFZOHJ","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":"09306b7298510f308960ca2894da8e87c834d0c59bb7c642f3b255a110b30d9d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-05T20:14:58Z","title_canon_sha256":"23cd50b81faf83c2a2970e3a3232b25ff38cc0dede0d3e393b2628074f155e3b"},"schema_version":"1.0","source":{"id":"1412.2123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2123","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2123v1","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2123","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"GRKUHHVIRJSR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GRKUHHVIRJSR3LRG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GRKUHHVI","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:13cfa0dec28449afbdf1d3bb95b94c599bc2440582bf6e8b0271aae611a064f4","target":"graph","created_at":"2026-05-18T02:32:00Z","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 consider and formulate a class of distributed multi-depot routing problems, where servers are to visit a set of requests, with the aim of minimizing the total distance travelled by all servers. These problems fall into two categories: distributed offline routing problems where all the requests that need to be visited are known from the start; distributed online routing problems where the requests come to be known incrementally. A critical and novel feature of our formulations is that communications are not allowed among the servers, hence posing an interesting and challenging question: what","authors_text":"Dawsen Hwang, Patrick Jaillet, Zhengyuan Zhou","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-05T20:14:58Z","title":"Distributed Multi-Depot Routing without Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2123","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:5e842fa78da9bf994763495cf87fc104e2407c79aea19d9f2a3c0b1cc8ccbf2a","target":"record","created_at":"2026-05-18T02:32:00Z","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":"09306b7298510f308960ca2894da8e87c834d0c59bb7c642f3b255a110b30d9d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-05T20:14:58Z","title_canon_sha256":"23cd50b81faf83c2a2970e3a3232b25ff38cc0dede0d3e393b2628074f155e3b"},"schema_version":"1.0","source":{"id":"1412.2123","kind":"arxiv","version":1}},"canonical_sha256":"3455439ea88a651dae26fd25d0172e3a604b86ab689d9d12817c2673333690b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3455439ea88a651dae26fd25d0172e3a604b86ab689d9d12817c2673333690b4","first_computed_at":"2026-05-18T02:32:00.658559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:00.658559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FgYzFsqf2e3cQp3ZcQa3Jc0CGlPomTNzpo9+Gun9jx9b8a6Sb4rCS0hKhJy4Pe/B+QOVxdkrbAjnssM2xsv1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:00.659005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e842fa78da9bf994763495cf87fc104e2407c79aea19d9f2a3c0b1cc8ccbf2a","sha256:13cfa0dec28449afbdf1d3bb95b94c599bc2440582bf6e8b0271aae611a064f4"],"state_sha256":"6efa9f7c662c430949f1326814be869de0019f8c023ce2de65b970577b5b26c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wsYHpZj/dJcaDe3bXfZ6rTOGULSA4lUCLlaTt2yQOfjEKuAjzxQWgEhLSHbjF10nlQyvr/JqRKwtVPHdko0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:10:20.354737Z","bundle_sha256":"3a9f2d6ce881858051f12115b84f24fd4d71b958a0a040294a08452794743ea5"}}