{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OZ3KKIXDA7MSCQDK4DYYRI3TP7","short_pith_number":"pith:OZ3KKIXD","canonical_record":{"source":{"id":"1706.02245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-07T16:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"b0ddf6d58a27d99eb403fbf3f6fd4d7163e0796c2f343d0ef034f529d6ea8ec1","abstract_canon_sha256":"8534c6cd392c7081c66eb84aa78c412e4fd6bfef47e20422abe4f7566d97b416"},"schema_version":"1.0"},"canonical_sha256":"7676a522e307d921406ae0f188a3737fdb99a3beb12ca18fc944b9c7cd9a4220","source":{"kind":"arxiv","id":"1706.02245","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02245","created_at":"2026-05-18T00:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02245v2","created_at":"2026-05-18T00:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02245","created_at":"2026-05-18T00:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"OZ3KKIXDA7MS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OZ3KKIXDA7MSCQDK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OZ3KKIXD","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OZ3KKIXDA7MSCQDK4DYYRI3TP7","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-07T16:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"b0ddf6d58a27d99eb403fbf3f6fd4d7163e0796c2f343d0ef034f529d6ea8ec1","abstract_canon_sha256":"8534c6cd392c7081c66eb84aa78c412e4fd6bfef47e20422abe4f7566d97b416"},"schema_version":"1.0"},"canonical_sha256":"7676a522e307d921406ae0f188a3737fdb99a3beb12ca18fc944b9c7cd9a4220","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:30.529180Z","signature_b64":"XBzKl5hj/y2Tq137YpebLPOkgqSrH4ObrW4YcgJqSfz6fRzf/woQL/x+1G4ZR4Cw9hOitQ1Vy+m0RjZ65R35Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7676a522e307d921406ae0f188a3737fdb99a3beb12ca18fc944b9c7cd9a4220","last_reissued_at":"2026-05-18T00:01:30.528619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:30.528619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02245","source_version":2,"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:01:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6Y+E19Qkj3ZmvS2AvT+1t07K0meZFlhXhXEGGcEl7Pa0ZTcUR8werebgiVx6ipRv/iXtXIg7yA0HQGHbGipCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:21:09.962497Z"},"content_sha256":"7b98e504507d8259243a9ee7a99b22ee226783f7c433d03397fab7706163d7d0","schema_version":"1.0","event_id":"sha256:7b98e504507d8259243a9ee7a99b22ee226783f7c433d03397fab7706163d7d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OZ3KKIXDA7MSCQDK4DYYRI3TP7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Simultaneous Action and Target Assignment for Multi-Robot Multi-Target Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ashish Kumar Budhiraja, Pratap Tokekar, Ryan K. Williams, Yoonchang Sung","submitted_at":"2017-06-07T16:32:16Z","abstract_excerpt":"We study a multi-robot assignment problem for multi-target tracking. The proposed problem can be viewed as the mixed packing and covering problem. To deal with a limitation on both sensing and communication ranges, a distributed approach is taken into consideration. A local algorithm gives theoretical bounds on both the running time and approximation ratio to an optimal solution. We employ a local algorithm of max-min linear programs to solve the proposed task. Simulation result shows that a local algorithm is an effective solution to the multi-robot task allocation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02245","kind":"arxiv","version":2},"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:01:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DvmJQADa+8NvJmieSG5f1v1ZHEgi4Gj0PMOWs5QV+Vdm5dtFOIGxnzwNF5DTOoBD8GMzgcFYbCVOpA7g0WHvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:21:09.962838Z"},"content_sha256":"c783d9b1757a344b2216a1a4c1b933732fceea9ae7a1ccbb9d792f37f90be37b","schema_version":"1.0","event_id":"sha256:c783d9b1757a344b2216a1a4c1b933732fceea9ae7a1ccbb9d792f37f90be37b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZ3KKIXDA7MSCQDK4DYYRI3TP7/bundle.json","state_url":"https://pith.science/pith/OZ3KKIXDA7MSCQDK4DYYRI3TP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZ3KKIXDA7MSCQDK4DYYRI3TP7/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-01T15:21:09Z","links":{"resolver":"https://pith.science/pith/OZ3KKIXDA7MSCQDK4DYYRI3TP7","bundle":"https://pith.science/pith/OZ3KKIXDA7MSCQDK4DYYRI3TP7/bundle.json","state":"https://pith.science/pith/OZ3KKIXDA7MSCQDK4DYYRI3TP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZ3KKIXDA7MSCQDK4DYYRI3TP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OZ3KKIXDA7MSCQDK4DYYRI3TP7","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":"8534c6cd392c7081c66eb84aa78c412e4fd6bfef47e20422abe4f7566d97b416","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-07T16:32:16Z","title_canon_sha256":"b0ddf6d58a27d99eb403fbf3f6fd4d7163e0796c2f343d0ef034f529d6ea8ec1"},"schema_version":"1.0","source":{"id":"1706.02245","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02245","created_at":"2026-05-18T00:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02245v2","created_at":"2026-05-18T00:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02245","created_at":"2026-05-18T00:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"OZ3KKIXDA7MS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OZ3KKIXDA7MSCQDK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OZ3KKIXD","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:c783d9b1757a344b2216a1a4c1b933732fceea9ae7a1ccbb9d792f37f90be37b","target":"graph","created_at":"2026-05-18T00:01:30Z","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 a multi-robot assignment problem for multi-target tracking. The proposed problem can be viewed as the mixed packing and covering problem. To deal with a limitation on both sensing and communication ranges, a distributed approach is taken into consideration. A local algorithm gives theoretical bounds on both the running time and approximation ratio to an optimal solution. We employ a local algorithm of max-min linear programs to solve the proposed task. Simulation result shows that a local algorithm is an effective solution to the multi-robot task allocation.","authors_text":"Ashish Kumar Budhiraja, Pratap Tokekar, Ryan K. Williams, Yoonchang Sung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-07T16:32:16Z","title":"Distributed Simultaneous Action and Target Assignment for Multi-Robot Multi-Target Tracking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02245","kind":"arxiv","version":2},"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:7b98e504507d8259243a9ee7a99b22ee226783f7c433d03397fab7706163d7d0","target":"record","created_at":"2026-05-18T00:01:30Z","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":"8534c6cd392c7081c66eb84aa78c412e4fd6bfef47e20422abe4f7566d97b416","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-07T16:32:16Z","title_canon_sha256":"b0ddf6d58a27d99eb403fbf3f6fd4d7163e0796c2f343d0ef034f529d6ea8ec1"},"schema_version":"1.0","source":{"id":"1706.02245","kind":"arxiv","version":2}},"canonical_sha256":"7676a522e307d921406ae0f188a3737fdb99a3beb12ca18fc944b9c7cd9a4220","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7676a522e307d921406ae0f188a3737fdb99a3beb12ca18fc944b9c7cd9a4220","first_computed_at":"2026-05-18T00:01:30.528619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:30.528619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XBzKl5hj/y2Tq137YpebLPOkgqSrH4ObrW4YcgJqSfz6fRzf/woQL/x+1G4ZR4Cw9hOitQ1Vy+m0RjZ65R35Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:30.529180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02245","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b98e504507d8259243a9ee7a99b22ee226783f7c433d03397fab7706163d7d0","sha256:c783d9b1757a344b2216a1a4c1b933732fceea9ae7a1ccbb9d792f37f90be37b"],"state_sha256":"cb1e82aafc6dcb604cd5555a629699593c4a25d17748c2df8c6d341473e62226"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zyXWytCfR9CcHFITaolYjivpmYWFa7VyBI+Qnh/n/e7zi0fIFTiFO83GrNuzp9IMlZbp/kjnqxIfsFlUt4gNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:21:09.964825Z","bundle_sha256":"4acc325685f84d3d2921e3d6367b7114e1faf29393d81c619a586a9041cdb129"}}