{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R3O4OBKIJTFM5WO354V55RN32F","short_pith_number":"pith:R3O4OBKI","schema_version":"1.0","canonical_sha256":"8eddc705484ccaced9dbef2bdec5bbd1621a5afec2d28e18bc54b1fffbfdd9f0","source":{"kind":"arxiv","id":"1805.08978","version":1},"attestation_state":"computed","paper":{"title":"Distributed Approximation Algorithms for the Combinatorial Motion Planning Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Aditya Paliwal, Shrisha Rao, Simran Dokania","submitted_at":"2018-05-23T06:34:50Z","abstract_excerpt":"We present a new $4$-approximation algorithm for the Combinatorial Motion Planning problem which runs in $\\mathcal{O}(n^2\\alpha(n^2,n))$ time, where $\\alpha$ is the functional inverse of the Ackermann function, and a fully distributed version for the same in asynchronous message passing systems, which runs in $\\mathcal{O}(n\\log_2n)$ time with a message complexity of $\\mathcal{O}(n^2)$. This also includes the first fully distributed algorithm in asynchronous message passing systems to perform \"shortcut\" operations on paths, a procedure which is important in approximation algorithms for the vehi"},"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":"1805.08978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-23T06:34:50Z","cross_cats_sorted":[],"title_canon_sha256":"00587747f635ede107960c6cd517f55f0e124c659187540b9ed4b168b95a26dd","abstract_canon_sha256":"0b814f008c0014d2ea2f44b03b6bc040cc4e539736de682ea7ba2cdc0c58e503"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:08.902003Z","signature_b64":"/QQiigbIaf6n6J8mueNrOQW8k4IGU+MGk9mu52h11qzv6Uy5D0jhej0+EDyRT1nFYwjV13zVtjUxswFZVBGNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8eddc705484ccaced9dbef2bdec5bbd1621a5afec2d28e18bc54b1fffbfdd9f0","last_reissued_at":"2026-05-18T00:15:08.901542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:08.901542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Approximation Algorithms for the Combinatorial Motion Planning Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Aditya Paliwal, Shrisha Rao, Simran Dokania","submitted_at":"2018-05-23T06:34:50Z","abstract_excerpt":"We present a new $4$-approximation algorithm for the Combinatorial Motion Planning problem which runs in $\\mathcal{O}(n^2\\alpha(n^2,n))$ time, where $\\alpha$ is the functional inverse of the Ackermann function, and a fully distributed version for the same in asynchronous message passing systems, which runs in $\\mathcal{O}(n\\log_2n)$ time with a message complexity of $\\mathcal{O}(n^2)$. This also includes the first fully distributed algorithm in asynchronous message passing systems to perform \"shortcut\" operations on paths, a procedure which is important in approximation algorithms for the vehi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08978","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":"1805.08978","created_at":"2026-05-18T00:15:08.901608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08978v1","created_at":"2026-05-18T00:15:08.901608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08978","created_at":"2026-05-18T00:15:08.901608+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3O4OBKIJTFM","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3O4OBKIJTFM5WO3","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3O4OBKI","created_at":"2026-05-18T12:32:50.500415+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/R3O4OBKIJTFM5WO354V55RN32F","json":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F.json","graph_json":"https://pith.science/api/pith-number/R3O4OBKIJTFM5WO354V55RN32F/graph.json","events_json":"https://pith.science/api/pith-number/R3O4OBKIJTFM5WO354V55RN32F/events.json","paper":"https://pith.science/paper/R3O4OBKI"},"agent_actions":{"view_html":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F","download_json":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F.json","view_paper":"https://pith.science/paper/R3O4OBKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08978&json=true","fetch_graph":"https://pith.science/api/pith-number/R3O4OBKIJTFM5WO354V55RN32F/graph.json","fetch_events":"https://pith.science/api/pith-number/R3O4OBKIJTFM5WO354V55RN32F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F/action/storage_attestation","attest_author":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F/action/author_attestation","sign_citation":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F/action/citation_signature","submit_replication":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F/action/replication_record"}},"created_at":"2026-05-18T00:15:08.901608+00:00","updated_at":"2026-05-18T00:15:08.901608+00:00"}