{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:43HCPUHDHC7UXDG6Y3P4LED4U6","short_pith_number":"pith:43HCPUHD","schema_version":"1.0","canonical_sha256":"e6ce27d0e338bf4b8cdec6dfc5907ca7ad8ced33478cd0819563ece4f013bd59","source":{"kind":"arxiv","id":"1505.03128","version":1},"attestation_state":"computed","paper":{"title":"A Parallel Distributed Strategy for Arraying a Scattered Robot Swarm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dominik Krupke, James McLurkin, Michael Hemmer, Sandor P. Fekete, Yu Zhou","submitted_at":"2015-05-12T19:27:37Z","abstract_excerpt":"We consider the problem of organizing a scattered group of $n$ robots in two-dimensional space, with geometric maximum distance $D$ between robots. The communication graph of the swarm is connected, but there is no central authority for organizing it. We want to arrange them into a sorted and equally-spaced array between the robots with lowest and highest label, while maintaining a connected communication network.\n  In this paper, we describe a distributed method to accomplish these goals, without using central control, while also keeping time, travel distance and communication cost at a minim"},"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":"1505.03128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-05-12T19:27:37Z","cross_cats_sorted":[],"title_canon_sha256":"092a43b733b04fa74c6aa02218f9aac6ad4acd30b7f209691f3ecaa1d7ec9540","abstract_canon_sha256":"ca596be023d2b960fdd71f365ea50b792025cf5d14d32db8dd6ecd784aff6d61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:08.911464Z","signature_b64":"7R8Iai7ErW2gub9KAspmrAUHy/8jYCEKy4QxNWuioqJCcLd1fHGfdDQkLXxhawAl5tmsK4G0uGziJHyASztHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6ce27d0e338bf4b8cdec6dfc5907ca7ad8ced33478cd0819563ece4f013bd59","last_reissued_at":"2026-05-18T02:14:08.910795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:08.910795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Distributed Strategy for Arraying a Scattered Robot Swarm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dominik Krupke, James McLurkin, Michael Hemmer, Sandor P. Fekete, Yu Zhou","submitted_at":"2015-05-12T19:27:37Z","abstract_excerpt":"We consider the problem of organizing a scattered group of $n$ robots in two-dimensional space, with geometric maximum distance $D$ between robots. The communication graph of the swarm is connected, but there is no central authority for organizing it. We want to arrange them into a sorted and equally-spaced array between the robots with lowest and highest label, while maintaining a connected communication network.\n  In this paper, we describe a distributed method to accomplish these goals, without using central control, while also keeping time, travel distance and communication cost at a minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03128","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":"1505.03128","created_at":"2026-05-18T02:14:08.910920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03128v1","created_at":"2026-05-18T02:14:08.910920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03128","created_at":"2026-05-18T02:14:08.910920+00:00"},{"alias_kind":"pith_short_12","alias_value":"43HCPUHDHC7U","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"43HCPUHDHC7UXDG6","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"43HCPUHD","created_at":"2026-05-18T12:29:02.477457+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/43HCPUHDHC7UXDG6Y3P4LED4U6","json":"https://pith.science/pith/43HCPUHDHC7UXDG6Y3P4LED4U6.json","graph_json":"https://pith.science/api/pith-number/43HCPUHDHC7UXDG6Y3P4LED4U6/graph.json","events_json":"https://pith.science/api/pith-number/43HCPUHDHC7UXDG6Y3P4LED4U6/events.json","paper":"https://pith.science/paper/43HCPUHD"},"agent_actions":{"view_html":"https://pith.science/pith/43HCPUHDHC7UXDG6Y3P4LED4U6","download_json":"https://pith.science/pith/43HCPUHDHC7UXDG6Y3P4LED4U6.json","view_paper":"https://pith.science/paper/43HCPUHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03128&json=true","fetch_graph":"https://pith.science/api/pith-number/43HCPUHDHC7UXDG6Y3P4LED4U6/graph.json","fetch_events":"https://pith.science/api/pith-number/43HCPUHDHC7UXDG6Y3P4LED4U6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43HCPUHDHC7UXDG6Y3P4LED4U6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43HCPUHDHC7UXDG6Y3P4LED4U6/action/storage_attestation","attest_author":"https://pith.science/pith/43HCPUHDHC7UXDG6Y3P4LED4U6/action/author_attestation","sign_citation":"https://pith.science/pith/43HCPUHDHC7UXDG6Y3P4LED4U6/action/citation_signature","submit_replication":"https://pith.science/pith/43HCPUHDHC7UXDG6Y3P4LED4U6/action/replication_record"}},"created_at":"2026-05-18T02:14:08.910920+00:00","updated_at":"2026-05-18T02:14:08.910920+00:00"}