{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EJEB6GP5VHVYODPECSSW5KM2HJ","short_pith_number":"pith:EJEB6GP5","schema_version":"1.0","canonical_sha256":"22481f19fda9eb870de414a56ea99a3a5c8215c3854d0debe8953c2aefcb75bc","source":{"kind":"arxiv","id":"2209.12091","version":1},"attestation_state":"computed","paper":{"title":"Graph Neural Networks for Multi-Robot Active Information Acquisition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Evangelos Chatzipantazis, George J. Pappas, Mariliza Tzes, Nikolaos Bousias","submitted_at":"2022-09-24T21:45:06Z","abstract_excerpt":"This paper addresses the Multi-Robot Active Information Acquisition (AIA) problem, where a team of mobile robots, communicating through an underlying graph, estimates a hidden state expressing a phenomenon of interest. Applications like target tracking, coverage and SLAM can be expressed in this framework. Existing approaches, though, are either not scalable, unable to handle dynamic phenomena or not robust to changes in the communication graph. To counter these shortcomings, we propose an Information-aware Graph Block Network (I-GBNet), an AIA adaptation of Graph Neural Networks, that aggrega"},"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":"2209.12091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-09-24T21:45:06Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"2d9982eb8a5359acc5fd241840f8a53a29247cf5ab6b56194333663b91c6234d","abstract_canon_sha256":"e8cc3d1d8c922bcd7c370de663ba15e487b8edfc40d037018a9a0f6f0fe4fb53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:16.768474Z","signature_b64":"/94BOaOqHqYcxoDLAmQM7loAlCj2FkbemoagjDc9P9U0sFvZR6hHtW+uolAsq9JCiNR2X4dW5gNLCJkxXULfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22481f19fda9eb870de414a56ea99a3a5c8215c3854d0debe8953c2aefcb75bc","last_reissued_at":"2026-07-05T09:26:16.767987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:16.767987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Networks for Multi-Robot Active Information Acquisition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Evangelos Chatzipantazis, George J. Pappas, Mariliza Tzes, Nikolaos Bousias","submitted_at":"2022-09-24T21:45:06Z","abstract_excerpt":"This paper addresses the Multi-Robot Active Information Acquisition (AIA) problem, where a team of mobile robots, communicating through an underlying graph, estimates a hidden state expressing a phenomenon of interest. Applications like target tracking, coverage and SLAM can be expressed in this framework. Existing approaches, though, are either not scalable, unable to handle dynamic phenomena or not robust to changes in the communication graph. To counter these shortcomings, we propose an Information-aware Graph Block Network (I-GBNet), an AIA adaptation of Graph Neural Networks, that aggrega"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.12091","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/2209.12091/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":"2209.12091","created_at":"2026-07-05T09:26:16.768045+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.12091v1","created_at":"2026-07-05T09:26:16.768045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.12091","created_at":"2026-07-05T09:26:16.768045+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJEB6GP5VHVY","created_at":"2026-07-05T09:26:16.768045+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJEB6GP5VHVYODPE","created_at":"2026-07-05T09:26:16.768045+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJEB6GP5","created_at":"2026-07-05T09:26:16.768045+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.15353","citing_title":"NeuroSymActive: Differentiable Neural-Symbolic Reasoning with Active Exploration for Knowledge Graph Question Answering","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EJEB6GP5VHVYODPECSSW5KM2HJ","json":"https://pith.science/pith/EJEB6GP5VHVYODPECSSW5KM2HJ.json","graph_json":"https://pith.science/api/pith-number/EJEB6GP5VHVYODPECSSW5KM2HJ/graph.json","events_json":"https://pith.science/api/pith-number/EJEB6GP5VHVYODPECSSW5KM2HJ/events.json","paper":"https://pith.science/paper/EJEB6GP5"},"agent_actions":{"view_html":"https://pith.science/pith/EJEB6GP5VHVYODPECSSW5KM2HJ","download_json":"https://pith.science/pith/EJEB6GP5VHVYODPECSSW5KM2HJ.json","view_paper":"https://pith.science/paper/EJEB6GP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.12091&json=true","fetch_graph":"https://pith.science/api/pith-number/EJEB6GP5VHVYODPECSSW5KM2HJ/graph.json","fetch_events":"https://pith.science/api/pith-number/EJEB6GP5VHVYODPECSSW5KM2HJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJEB6GP5VHVYODPECSSW5KM2HJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJEB6GP5VHVYODPECSSW5KM2HJ/action/storage_attestation","attest_author":"https://pith.science/pith/EJEB6GP5VHVYODPECSSW5KM2HJ/action/author_attestation","sign_citation":"https://pith.science/pith/EJEB6GP5VHVYODPECSSW5KM2HJ/action/citation_signature","submit_replication":"https://pith.science/pith/EJEB6GP5VHVYODPECSSW5KM2HJ/action/replication_record"}},"created_at":"2026-07-05T09:26:16.768045+00:00","updated_at":"2026-07-05T09:26:16.768045+00:00"}