{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:47U7D6GETDM3CAPASXOOXIWHX2","short_pith_number":"pith:47U7D6GE","canonical_record":{"source":{"id":"1308.3956","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-19T08:51:59Z","cross_cats_sorted":[],"title_canon_sha256":"f284eb2eaf9526139efc2cda8f5306270ca9fc61fa293ec2a91e252ed8511734","abstract_canon_sha256":"93dbbc1ef0bb9e59f2d71d9ef2b122e59471d10f1218e649aec9372dc0693b99"},"schema_version":"1.0"},"canonical_sha256":"e7e9f1f8c498d9b101e095dceba2c7beb272e5e0f3b7c0b889860b1051dba847","source":{"kind":"arxiv","id":"1308.3956","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3956","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3956v3","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3956","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"47U7D6GETDM3","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"47U7D6GETDM3CAPA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"47U7D6GE","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:47U7D6GETDM3CAPASXOOXIWHX2","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3956","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-19T08:51:59Z","cross_cats_sorted":[],"title_canon_sha256":"f284eb2eaf9526139efc2cda8f5306270ca9fc61fa293ec2a91e252ed8511734","abstract_canon_sha256":"93dbbc1ef0bb9e59f2d71d9ef2b122e59471d10f1218e649aec9372dc0693b99"},"schema_version":"1.0"},"canonical_sha256":"e7e9f1f8c498d9b101e095dceba2c7beb272e5e0f3b7c0b889860b1051dba847","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:13.121744Z","signature_b64":"tsDKQvVckH+/rV7+sSw8StIGjOe/7t1xysnxvD3nY61idkOuy/Hj0j4t2UHKzKd8XMs4fMHTjzG9DTF6xLIhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7e9f1f8c498d9b101e095dceba2c7beb272e5e0f3b7c0b889860b1051dba847","last_reissued_at":"2026-05-18T02:46:13.121185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:13.121185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3956","source_version":3,"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-18T02:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"exJ9ZEjlojaXSSRfQ5fbqJIc8JglbX/a+w4Esxb7H0w0HkooVTnXb39D07JxypBQfJy/iLFsArlpLDxVWLT+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:56:36.678250Z"},"content_sha256":"f94daaad9bf27f0398b9d6cc20b6014b74684d6cd6c35a1f8b8d00b166348554","schema_version":"1.0","event_id":"sha256:f94daaad9bf27f0398b9d6cc20b6014b74684d6cd6c35a1f8b8d00b166348554"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:47U7D6GETDM3CAPASXOOXIWHX2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Target Assignment in Robotic Networks: Distance Optimality Guarantees and Hierarchical Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jingjin Yu, Petros G. Voulgaris, Soon-Jo Chung","submitted_at":"2013-08-19T08:51:59Z","abstract_excerpt":"We study the problem of multi-robot target assignment to minimize the total distance traveled by the robots until they all reach an equal number of static targets. In the first half of the paper, we present a necessary and sufficient condition under which true distance optimality can be achieved for robots with limited communication and target-sensing ranges. Moreover, we provide an explicit, non-asymptotic formula for computing the number of robots needed to achieve distance optimality in terms of the robots' communication and target-sensing ranges with arbitrary guaranteed probabilities. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3956","kind":"arxiv","version":3},"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-18T02:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhEKluKA9vASJA3hXc4aa1qKnL/UBNdhPIWrEh1xeiCTaLw+xen9bw2ZakHJz+OfykCf/iN3oVzGlVC5JgrQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:56:36.678614Z"},"content_sha256":"32d0303ad7ab758bf363094c38092c65f55b0cfa8d074ef5f395420290ce3983","schema_version":"1.0","event_id":"sha256:32d0303ad7ab758bf363094c38092c65f55b0cfa8d074ef5f395420290ce3983"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47U7D6GETDM3CAPASXOOXIWHX2/bundle.json","state_url":"https://pith.science/pith/47U7D6GETDM3CAPASXOOXIWHX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47U7D6GETDM3CAPASXOOXIWHX2/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-05-28T04:56:36Z","links":{"resolver":"https://pith.science/pith/47U7D6GETDM3CAPASXOOXIWHX2","bundle":"https://pith.science/pith/47U7D6GETDM3CAPASXOOXIWHX2/bundle.json","state":"https://pith.science/pith/47U7D6GETDM3CAPASXOOXIWHX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47U7D6GETDM3CAPASXOOXIWHX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:47U7D6GETDM3CAPASXOOXIWHX2","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":"93dbbc1ef0bb9e59f2d71d9ef2b122e59471d10f1218e649aec9372dc0693b99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-19T08:51:59Z","title_canon_sha256":"f284eb2eaf9526139efc2cda8f5306270ca9fc61fa293ec2a91e252ed8511734"},"schema_version":"1.0","source":{"id":"1308.3956","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3956","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3956v3","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3956","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"47U7D6GETDM3","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"47U7D6GETDM3CAPA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"47U7D6GE","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:32d0303ad7ab758bf363094c38092c65f55b0cfa8d074ef5f395420290ce3983","target":"graph","created_at":"2026-05-18T02:46:13Z","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 study the problem of multi-robot target assignment to minimize the total distance traveled by the robots until they all reach an equal number of static targets. In the first half of the paper, we present a necessary and sufficient condition under which true distance optimality can be achieved for robots with limited communication and target-sensing ranges. Moreover, we provide an explicit, non-asymptotic formula for computing the number of robots needed to achieve distance optimality in terms of the robots' communication and target-sensing ranges with arbitrary guaranteed probabilities. The","authors_text":"Jingjin Yu, Petros G. Voulgaris, Soon-Jo Chung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-19T08:51:59Z","title":"Target Assignment in Robotic Networks: Distance Optimality Guarantees and Hierarchical Strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3956","kind":"arxiv","version":3},"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:f94daaad9bf27f0398b9d6cc20b6014b74684d6cd6c35a1f8b8d00b166348554","target":"record","created_at":"2026-05-18T02:46:13Z","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":"93dbbc1ef0bb9e59f2d71d9ef2b122e59471d10f1218e649aec9372dc0693b99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-19T08:51:59Z","title_canon_sha256":"f284eb2eaf9526139efc2cda8f5306270ca9fc61fa293ec2a91e252ed8511734"},"schema_version":"1.0","source":{"id":"1308.3956","kind":"arxiv","version":3}},"canonical_sha256":"e7e9f1f8c498d9b101e095dceba2c7beb272e5e0f3b7c0b889860b1051dba847","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7e9f1f8c498d9b101e095dceba2c7beb272e5e0f3b7c0b889860b1051dba847","first_computed_at":"2026-05-18T02:46:13.121185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:13.121185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tsDKQvVckH+/rV7+sSw8StIGjOe/7t1xysnxvD3nY61idkOuy/Hj0j4t2UHKzKd8XMs4fMHTjzG9DTF6xLIhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:13.121744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3956","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f94daaad9bf27f0398b9d6cc20b6014b74684d6cd6c35a1f8b8d00b166348554","sha256:32d0303ad7ab758bf363094c38092c65f55b0cfa8d074ef5f395420290ce3983"],"state_sha256":"72453a490c119c7692eecd4a8abfd53042881241518ad5dbc8480f62d46da5a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EEbPKMN5rSeWmXs+YroWxR1XhcVhKCOOxPpYm/gWlNx8DSOtYoG7zh1DYx+xpkm6G8nrDLiRki3fyeE84xEtDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:56:36.680730Z","bundle_sha256":"742abb854d6d6088964d9ecfe28d904ddf1d8f5f15fb04adbd46d8dbc113ec75"}}