{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KVXDREPGDZPFFGOOK7G7XQXJL2","short_pith_number":"pith:KVXDREPG","canonical_record":{"source":{"id":"1707.05629","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-18T14:11:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bf2f0090401982d97d097a852c6b9bee21e88c25ca19a6dca4e70262c30f8434","abstract_canon_sha256":"156e9f23ad3479ddf392494d92d666e1358f7a1b5b3dd9e4c3c461a5c486bb57"},"schema_version":"1.0"},"canonical_sha256":"556e3891e61e5e5299ce57cdfbc2e95eb71e42de9964f72ccb67d2ea32a14a7a","source":{"kind":"arxiv","id":"1707.05629","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05629","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05629v4","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05629","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"KVXDREPGDZPF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KVXDREPGDZPFFGOO","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KVXDREPG","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KVXDREPGDZPFFGOOK7G7XQXJL2","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05629","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-18T14:11:02Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bf2f0090401982d97d097a852c6b9bee21e88c25ca19a6dca4e70262c30f8434","abstract_canon_sha256":"156e9f23ad3479ddf392494d92d666e1358f7a1b5b3dd9e4c3c461a5c486bb57"},"schema_version":"1.0"},"canonical_sha256":"556e3891e61e5e5299ce57cdfbc2e95eb71e42de9964f72ccb67d2ea32a14a7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:39.283095Z","signature_b64":"iRAp+14TCWoCCVNGm4/zBUMlZvpMsRTGhB2EFNGmvSVTXi62U9IjW/9+rPGa+oIg3nSrr5rakTWtCoNTtJ0HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"556e3891e61e5e5299ce57cdfbc2e95eb71e42de9964f72ccb67d2ea32a14a7a","last_reissued_at":"2026-05-18T00:10:39.282540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:39.282540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05629","source_version":4,"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:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6nnwFvC3uXK7rhpaH5xJdaNUh5KISIL9Tdv1vu/oeOeQxZwOXkjwYISfAzaKR58fxKaCkVoierz7/gM7oSlEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T03:51:57.505410Z"},"content_sha256":"2214a58c2e729cd97f2e6ce726e9169486dea357bb29e3c27ab82db4011851e7","schema_version":"1.0","event_id":"sha256:2214a58c2e729cd97f2e6ce726e9169486dea357bb29e3c27ab82db4011851e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KVXDREPGDZPFFGOOK7G7XQXJL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"John Augustine, William K. Moses Jr","submitted_at":"2017-07-18T14:11:02Z","abstract_excerpt":"We introduce a new problem in the domain of mobile robots, which we term dispersion. In this problem, $n$ robots are placed in an $n$ node graph arbitrarily and must coordinate with each other to reach a final configuration such that exactly one robot is at each node. We study this problem through the lenses of minimizing the memory required by each robot and of minimizing the number of rounds required to achieve dispersion.\n  Dispersion is of interest due to its relationship to the problems of scattering on a graph, exploration using mobile robots, and load balancing on a graph. Additionally,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05629","kind":"arxiv","version":4},"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:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uzn1HqNLOx2wlaKgZiOBCkyF9tAfC/KXvTyIrscU2E+5ogo5JbIWT87bL7F1Na+oSH1EUhKUg6ps2ZeYeedLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T03:51:57.506175Z"},"content_sha256":"242648addc53c0746a98020c80f2a0749a795d5445f64b895f6e9afb9a123009","schema_version":"1.0","event_id":"sha256:242648addc53c0746a98020c80f2a0749a795d5445f64b895f6e9afb9a123009"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/bundle.json","state_url":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/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-10T03:51:57Z","links":{"resolver":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2","bundle":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/bundle.json","state":"https://pith.science/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVXDREPGDZPFFGOOK7G7XQXJL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KVXDREPGDZPFFGOOK7G7XQXJL2","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":"156e9f23ad3479ddf392494d92d666e1358f7a1b5b3dd9e4c3c461a5c486bb57","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-18T14:11:02Z","title_canon_sha256":"bf2f0090401982d97d097a852c6b9bee21e88c25ca19a6dca4e70262c30f8434"},"schema_version":"1.0","source":{"id":"1707.05629","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05629","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05629v4","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05629","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"KVXDREPGDZPF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KVXDREPGDZPFFGOO","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KVXDREPG","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:242648addc53c0746a98020c80f2a0749a795d5445f64b895f6e9afb9a123009","target":"graph","created_at":"2026-05-18T00:10:39Z","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 introduce a new problem in the domain of mobile robots, which we term dispersion. In this problem, $n$ robots are placed in an $n$ node graph arbitrarily and must coordinate with each other to reach a final configuration such that exactly one robot is at each node. We study this problem through the lenses of minimizing the memory required by each robot and of minimizing the number of rounds required to achieve dispersion.\n  Dispersion is of interest due to its relationship to the problems of scattering on a graph, exploration using mobile robots, and load balancing on a graph. Additionally,","authors_text":"John Augustine, William K. Moses Jr","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-18T14:11:02Z","title":"Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05629","kind":"arxiv","version":4},"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:2214a58c2e729cd97f2e6ce726e9169486dea357bb29e3c27ab82db4011851e7","target":"record","created_at":"2026-05-18T00:10:39Z","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":"156e9f23ad3479ddf392494d92d666e1358f7a1b5b3dd9e4c3c461a5c486bb57","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-18T14:11:02Z","title_canon_sha256":"bf2f0090401982d97d097a852c6b9bee21e88c25ca19a6dca4e70262c30f8434"},"schema_version":"1.0","source":{"id":"1707.05629","kind":"arxiv","version":4}},"canonical_sha256":"556e3891e61e5e5299ce57cdfbc2e95eb71e42de9964f72ccb67d2ea32a14a7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"556e3891e61e5e5299ce57cdfbc2e95eb71e42de9964f72ccb67d2ea32a14a7a","first_computed_at":"2026-05-18T00:10:39.282540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:39.282540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iRAp+14TCWoCCVNGm4/zBUMlZvpMsRTGhB2EFNGmvSVTXi62U9IjW/9+rPGa+oIg3nSrr5rakTWtCoNTtJ0HCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:39.283095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05629","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2214a58c2e729cd97f2e6ce726e9169486dea357bb29e3c27ab82db4011851e7","sha256:242648addc53c0746a98020c80f2a0749a795d5445f64b895f6e9afb9a123009"],"state_sha256":"7ac932427f4a6f69c6ce85810b6b8071c733b00f864846647b9ff8e095068c8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYYmqJAMKgpUOB9GYB2DmuywN0n1lVSTKN4C8R82RErg9UJ2yPHPJT0XPbsOtOVpnFh+jqgXYghU4Wcur/40Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T03:51:57.510637Z","bundle_sha256":"742aaa83c84019730dc4f64ed1ea48e42faa1d02623422eb489752d4995f5e4a"}}