{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GRKUHHVIRJSR3LRG7US5AFZOHJ","short_pith_number":"pith:GRKUHHVI","schema_version":"1.0","canonical_sha256":"3455439ea88a651dae26fd25d0172e3a604b86ab689d9d12817c2673333690b4","source":{"kind":"arxiv","id":"1412.2123","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.2123","created_at":"2026-05-18T02:32:00.658627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2123v1","created_at":"2026-05-18T02:32:00.658627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2123","created_at":"2026-05-18T02:32:00.658627+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRKUHHVIRJSR","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRKUHHVIRJSR3LRG","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRKUHHVI","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ","json":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ.json","graph_json":"https://pith.science/api/pith-number/GRKUHHVIRJSR3LRG7US5AFZOHJ/graph.json","events_json":"https://pith.science/api/pith-number/GRKUHHVIRJSR3LRG7US5AFZOHJ/events.json","paper":"https://pith.science/paper/GRKUHHVI"},"agent_actions":{"view_html":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ","download_json":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ.json","view_paper":"https://pith.science/paper/GRKUHHVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2123&json=true","fetch_graph":"https://pith.science/api/pith-number/GRKUHHVIRJSR3LRG7US5AFZOHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GRKUHHVIRJSR3LRG7US5AFZOHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/action/storage_attestation","attest_author":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/action/author_attestation","sign_citation":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/action/citation_signature","submit_replication":"https://pith.science/pith/GRKUHHVIRJSR3LRG7US5AFZOHJ/action/replication_record"}},"created_at":"2026-05-18T02:32:00.658627+00:00","updated_at":"2026-05-18T02:32:00.658627+00:00"}