{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R3O4OBKIJTFM5WO354V55RN32F","short_pith_number":"pith:R3O4OBKI","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"},"canonical_sha256":"8eddc705484ccaced9dbef2bdec5bbd1621a5afec2d28e18bc54b1fffbfdd9f0","source":{"kind":"arxiv","id":"1805.08978","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08978","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08978v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08978","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"R3O4OBKIJTFM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3O4OBKIJTFM5WO3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3O4OBKI","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R3O4OBKIJTFM5WO354V55RN32F","target":"record","payload":{"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"},"canonical_sha256":"8eddc705484ccaced9dbef2bdec5bbd1621a5afec2d28e18bc54b1fffbfdd9f0","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"},"source_kind":"arxiv","source_id":"1805.08978","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-18T00:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L07uozIZrW9rFykNkbR/W2JjWWpWk/VzL4gUH58PEXk/7RNv8dEeBcMTrniOfvOUYOnTurggN4dl7eC/znjSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:02:00.366446Z"},"content_sha256":"b0e7d3e91244f1275d5d83afbde2394ab264d41ed420dee3704c7a4ea766494d","schema_version":"1.0","event_id":"sha256:b0e7d3e91244f1275d5d83afbde2394ab264d41ed420dee3704c7a4ea766494d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R3O4OBKIJTFM5WO354V55RN32F","target":"graph","payload":{"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"},"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:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gecxohI7EI+u/F/OBkHIRRluC6iGYI7ovEny4iSz6j//rS22HNTeaXjFHeaHH+fJPTXyVKz/TQRaxkuXTUB5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:02:00.366813Z"},"content_sha256":"e7e4397abc453e679c90cf167b9023dad02385badf7f407a8dcd7201f9e21171","schema_version":"1.0","event_id":"sha256:e7e4397abc453e679c90cf167b9023dad02385badf7f407a8dcd7201f9e21171"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F/bundle.json","state_url":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3O4OBKIJTFM5WO354V55RN32F/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-06-26T14:02:00Z","links":{"resolver":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F","bundle":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F/bundle.json","state":"https://pith.science/pith/R3O4OBKIJTFM5WO354V55RN32F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3O4OBKIJTFM5WO354V55RN32F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R3O4OBKIJTFM5WO354V55RN32F","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":"0b814f008c0014d2ea2f44b03b6bc040cc4e539736de682ea7ba2cdc0c58e503","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-23T06:34:50Z","title_canon_sha256":"00587747f635ede107960c6cd517f55f0e124c659187540b9ed4b168b95a26dd"},"schema_version":"1.0","source":{"id":"1805.08978","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08978","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08978v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08978","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"R3O4OBKIJTFM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3O4OBKIJTFM5WO3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3O4OBKI","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:e7e4397abc453e679c90cf167b9023dad02385badf7f407a8dcd7201f9e21171","target":"graph","created_at":"2026-05-18T00:15:08Z","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 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","authors_text":"Aditya Paliwal, Shrisha Rao, Simran Dokania","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-23T06:34:50Z","title":"Distributed Approximation Algorithms for the Combinatorial Motion Planning Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08978","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:b0e7d3e91244f1275d5d83afbde2394ab264d41ed420dee3704c7a4ea766494d","target":"record","created_at":"2026-05-18T00:15:08Z","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":"0b814f008c0014d2ea2f44b03b6bc040cc4e539736de682ea7ba2cdc0c58e503","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-23T06:34:50Z","title_canon_sha256":"00587747f635ede107960c6cd517f55f0e124c659187540b9ed4b168b95a26dd"},"schema_version":"1.0","source":{"id":"1805.08978","kind":"arxiv","version":1}},"canonical_sha256":"8eddc705484ccaced9dbef2bdec5bbd1621a5afec2d28e18bc54b1fffbfdd9f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8eddc705484ccaced9dbef2bdec5bbd1621a5afec2d28e18bc54b1fffbfdd9f0","first_computed_at":"2026-05-18T00:15:08.901542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:08.901542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/QQiigbIaf6n6J8mueNrOQW8k4IGU+MGk9mu52h11qzv6Uy5D0jhej0+EDyRT1nFYwjV13zVtjUxswFZVBGNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:08.902003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08978","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0e7d3e91244f1275d5d83afbde2394ab264d41ed420dee3704c7a4ea766494d","sha256:e7e4397abc453e679c90cf167b9023dad02385badf7f407a8dcd7201f9e21171"],"state_sha256":"c383f7ee37b4f7355816a8b4eabeaada8697a88b7387d639eef5f6a086c68d16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+dsjoeKZ2YK2TGhhuEid3siX6ShtPJKuyCuL/ZUvFVxwT0zgyFY9exHic9aB/MsYXH+OoFeTd92ZFyvStrXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:02:00.369086Z","bundle_sha256":"2452109c1e81e8377cbc8dafe6416b98672e2d6ac9a46f8319b562df842590e4"}}