{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:4HDM55GIVBNU3M3AHSJ375XBGY","short_pith_number":"pith:4HDM55GI","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"},"canonical_sha256":"e1c6cef4c8a85b4db3603c93bff6e1361f106c352b10b987cd19166a41dde18c","source":{"kind":"arxiv","id":"2103.09364","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.09364","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"2103.09364v1","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09364","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"4HDM55GIVBNU","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_16","alias_value":"4HDM55GIVBNU3M3A","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_8","alias_value":"4HDM55GI","created_at":"2026-07-05T02:24:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:4HDM55GIVBNU3M3AHSJ375XBGY","target":"record","payload":{"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"},"canonical_sha256":"e1c6cef4c8a85b4db3603c93bff6e1361f106c352b10b987cd19166a41dde18c","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"},"source_kind":"arxiv","source_id":"2103.09364","source_version":1,"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-07-05T02:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KxmjQ7nY++TS+4zp0bq7Ssk6q46+r4Gt5J7oMsRE2Ii2t7KV6wGZYSDFs5b3PXHDB+2AbObQXUE76JTdGFchCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:26:22.141340Z"},"content_sha256":"97ed51bf9c13c7570a07843ca592b98ad789ee4884d4bcaa7c3484c0f4d009fb","schema_version":"1.0","event_id":"sha256:97ed51bf9c13c7570a07843ca592b98ad789ee4884d4bcaa7c3484c0f4d009fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:4HDM55GIVBNU3M3AHSJ375XBGY","target":"graph","payload":{"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"},"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-07-05T02:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMipi0RlSk89LQAC/4+THLFzCO1pJwJJHtByzay1i/+XBmLV8v4yDwtyNZzwYp5P08eeJBg+63t0YSkcXB2ACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:26:22.141713Z"},"content_sha256":"eece5c2cce860a9b7a031af33cdc27c5b561b2c876b40ee33bb44138b2e43e93","schema_version":"1.0","event_id":"sha256:eece5c2cce860a9b7a031af33cdc27c5b561b2c876b40ee33bb44138b2e43e93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY/bundle.json","state_url":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HDM55GIVBNU3M3AHSJ375XBGY/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-07-06T20:26:22Z","links":{"resolver":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY","bundle":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY/bundle.json","state":"https://pith.science/pith/4HDM55GIVBNU3M3AHSJ375XBGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HDM55GIVBNU3M3AHSJ375XBGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4HDM55GIVBNU3M3AHSJ375XBGY","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":"a4ecc3595d1738f69542d55fd1b64efbbfbb0493b7e30b135f14c8c37038828c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-16T23:26:29Z","title_canon_sha256":"13d47d1c757de67f6b8b30de9fa2a71d3ae45591390424acbc013355b08a4acd"},"schema_version":"1.0","source":{"id":"2103.09364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.09364","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"2103.09364v1","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09364","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"4HDM55GIVBNU","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_16","alias_value":"4HDM55GIVBNU3M3A","created_at":"2026-07-05T02:24:02Z"},{"alias_kind":"pith_short_8","alias_value":"4HDM55GI","created_at":"2026-07-05T02:24:02Z"}],"graph_snapshots":[{"event_id":"sha256:eece5c2cce860a9b7a031af33cdc27c5b561b2c876b40ee33bb44138b2e43e93","target":"graph","created_at":"2026-07-05T02:24:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.09364/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"George J. Pappas, Yiannis Kantaros","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-16T23:26:29Z","title":"Technical Report: Scalable Active Information Acquisition for Multi-Robot Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09364","kind":"arxiv","version":1},"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:97ed51bf9c13c7570a07843ca592b98ad789ee4884d4bcaa7c3484c0f4d009fb","target":"record","created_at":"2026-07-05T02:24:02Z","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":"a4ecc3595d1738f69542d55fd1b64efbbfbb0493b7e30b135f14c8c37038828c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-16T23:26:29Z","title_canon_sha256":"13d47d1c757de67f6b8b30de9fa2a71d3ae45591390424acbc013355b08a4acd"},"schema_version":"1.0","source":{"id":"2103.09364","kind":"arxiv","version":1}},"canonical_sha256":"e1c6cef4c8a85b4db3603c93bff6e1361f106c352b10b987cd19166a41dde18c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1c6cef4c8a85b4db3603c93bff6e1361f106c352b10b987cd19166a41dde18c","first_computed_at":"2026-07-05T02:24:02.951154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:24:02.951154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QFnuYwr5bEFNS2y2vcxM9GJOcRHaJkYxZ/+P3rGCzPBBkfh0rQfinmIayBCobiSAnVHF9+3mMCcKfrnGvv+jDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:24:02.951554Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.09364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97ed51bf9c13c7570a07843ca592b98ad789ee4884d4bcaa7c3484c0f4d009fb","sha256:eece5c2cce860a9b7a031af33cdc27c5b561b2c876b40ee33bb44138b2e43e93"],"state_sha256":"6d45f85af4a79fdcddba131f1c85932aed7b71a594f4a7d90cf225a47c273c52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErBTuubu8E1fzpmKRhElYKpiEFqJ6PnSL6A4p/WbRND6F1qA0QpgyRq52a3evm5rLrlickYs88wTKtDInp32Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:26:22.143568Z","bundle_sha256":"425e3a65d85358a1f348ff025985124a8d3b1fa3c9c091468332d8ded2f73463"}}