{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4HDM55GIVBNU3M3AHSJ375XBGY","short_pith_number":"pith:4HDM55GI","schema_version":"1.0","canonical_sha256":"e1c6cef4c8a85b4db3603c93bff6e1361f106c352b10b987cd19166a41dde18c","source":{"kind":"arxiv","id":"2103.09364","version":1},"attestation_state":"computed","paper":{"title":"Technical Report: Scalable Active Information Acquisition for Multi-Robot Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"George J. Pappas, Yiannis Kantaros","submitted_at":"2021-03-16T23:26:29Z","abstract_excerpt":"This paper proposes a novel highly scalable non-myopic planning algorithm for multi-robot Active Information Acquisition (AIA) tasks. AIA scenarios include target localization and tracking, active SLAM, surveillance, environmental monitoring and others. The objective is to compute control policies for multiple robots which minimize the accumulated uncertainty of a static hidden state over an a priori unknown horizon. The majority of existing AIA approaches are centralized and, therefore, face scaling challenges. To mitigate this issue, we propose an online algorithm that relies on decomposing "},"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":"2103.09364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-16T23:26:29Z","cross_cats_sorted":[],"title_canon_sha256":"13d47d1c757de67f6b8b30de9fa2a71d3ae45591390424acbc013355b08a4acd","abstract_canon_sha256":"a4ecc3595d1738f69542d55fd1b64efbbfbb0493b7e30b135f14c8c37038828c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:02.951554Z","signature_b64":"QFnuYwr5bEFNS2y2vcxM9GJOcRHaJkYxZ/+P3rGCzPBBkfh0rQfinmIayBCobiSAnVHF9+3mMCcKfrnGvv+jDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1c6cef4c8a85b4db3603c93bff6e1361f106c352b10b987cd19166a41dde18c","last_reissued_at":"2026-07-05T02:24:02.951154Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:02.951154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Technical Report: Scalable Active Information Acquisition for Multi-Robot Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"George J. Pappas, Yiannis Kantaros","submitted_at":"2021-03-16T23:26:29Z","abstract_excerpt":"This paper proposes a novel highly scalable non-myopic planning algorithm for multi-robot Active Information Acquisition (AIA) tasks. AIA scenarios include target localization and tracking, active SLAM, surveillance, environmental monitoring and others. The objective is to compute control policies for multiple robots which minimize the accumulated uncertainty of a static hidden state over an a priori unknown horizon. The majority of existing AIA approaches are centralized and, therefore, face scaling challenges. To mitigate this issue, we propose an online algorithm that relies on decomposing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09364","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.09364/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2103.09364","created_at":"2026-07-05T02:24:02.951214+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.09364v1","created_at":"2026-07-05T02:24:02.951214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09364","created_at":"2026-07-05T02:24:02.951214+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HDM55GIVBNU","created_at":"2026-07-05T02:24:02.951214+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HDM55GIVBNU3M3A","created_at":"2026-07-05T02:24:02.951214+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HDM55GI","created_at":"2026-07-05T02:24:02.951214+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/4HDM55GIVBNU3M3AHSJ375XBGY","json":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY.json","graph_json":"https://pith.science/api/pith-number/4HDM55GIVBNU3M3AHSJ375XBGY/graph.json","events_json":"https://pith.science/api/pith-number/4HDM55GIVBNU3M3AHSJ375XBGY/events.json","paper":"https://pith.science/paper/4HDM55GI"},"agent_actions":{"view_html":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY","download_json":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY.json","view_paper":"https://pith.science/paper/4HDM55GI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.09364&json=true","fetch_graph":"https://pith.science/api/pith-number/4HDM55GIVBNU3M3AHSJ375XBGY/graph.json","fetch_events":"https://pith.science/api/pith-number/4HDM55GIVBNU3M3AHSJ375XBGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY/action/storage_attestation","attest_author":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY/action/author_attestation","sign_citation":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY/action/citation_signature","submit_replication":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY/action/replication_record"}},"created_at":"2026-07-05T02:24:02.951214+00:00","updated_at":"2026-07-05T02:24:02.951214+00:00"}