{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SAC2RYY2FC4PYFEHNUF7LWHHSN","short_pith_number":"pith:SAC2RYY2","schema_version":"1.0","canonical_sha256":"9005a8e31a28b8fc14876d0bf5d8e7934c84180a1bd23a8597325423a36d53aa","source":{"kind":"arxiv","id":"1702.02597","version":1},"attestation_state":"computed","paper":{"title":"Structurally Observable Distributed Networks of Agents under Cost and Robustness Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"A. Pedro Aguiar, Jos\\'e M. F. Moura, S\\'ergio Pequito, Soummya Kar, Stephen Kruzick","submitted_at":"2017-02-08T19:50:39Z","abstract_excerpt":"In many problems, agents cooperate locally so that a leader or fusion center can infer the state of every agent from probing the state of only a small number of agents. Versions of this problem arise when a fusion center reconstructs an extended physical field by accessing the state of just a few of the sensors measuring the field, or a leader monitors the formation of a team of robots. Given a link cost, the paper presents a polynomial time algorithm to design a minimum cost coordinated network dynamics followed by the agents, under an observability constraint. The problem is placed in the co"},"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":"1702.02597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-08T19:50:39Z","cross_cats_sorted":[],"title_canon_sha256":"a24ef6ca41f3f4450b355dd5aa176f2440a5a89649113f25f47f69e654187381","abstract_canon_sha256":"1c88d8fd89d93bfd238622ed407a1aeb550437b60e819e42a79d59ed8f2b4953"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:03.909688Z","signature_b64":"6f8p1APevoRaAroveUFrWdHPxc6XWwZFqbOlADBum/jLU9STFixD1yvVizhGzLNfshVCKNEjGkDhuRL+dVw9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9005a8e31a28b8fc14876d0bf5d8e7934c84180a1bd23a8597325423a36d53aa","last_reissued_at":"2026-05-18T00:51:03.909295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:03.909295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structurally Observable Distributed Networks of Agents under Cost and Robustness Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"A. Pedro Aguiar, Jos\\'e M. F. Moura, S\\'ergio Pequito, Soummya Kar, Stephen Kruzick","submitted_at":"2017-02-08T19:50:39Z","abstract_excerpt":"In many problems, agents cooperate locally so that a leader or fusion center can infer the state of every agent from probing the state of only a small number of agents. Versions of this problem arise when a fusion center reconstructs an extended physical field by accessing the state of just a few of the sensors measuring the field, or a leader monitors the formation of a team of robots. Given a link cost, the paper presents a polynomial time algorithm to design a minimum cost coordinated network dynamics followed by the agents, under an observability constraint. The problem is placed in the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02597","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":""},"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":"1702.02597","created_at":"2026-05-18T00:51:03.909368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02597v1","created_at":"2026-05-18T00:51:03.909368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02597","created_at":"2026-05-18T00:51:03.909368+00:00"},{"alias_kind":"pith_short_12","alias_value":"SAC2RYY2FC4P","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SAC2RYY2FC4PYFEH","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SAC2RYY2","created_at":"2026-05-18T12:31:43.269735+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/SAC2RYY2FC4PYFEHNUF7LWHHSN","json":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN.json","graph_json":"https://pith.science/api/pith-number/SAC2RYY2FC4PYFEHNUF7LWHHSN/graph.json","events_json":"https://pith.science/api/pith-number/SAC2RYY2FC4PYFEHNUF7LWHHSN/events.json","paper":"https://pith.science/paper/SAC2RYY2"},"agent_actions":{"view_html":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN","download_json":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN.json","view_paper":"https://pith.science/paper/SAC2RYY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02597&json=true","fetch_graph":"https://pith.science/api/pith-number/SAC2RYY2FC4PYFEHNUF7LWHHSN/graph.json","fetch_events":"https://pith.science/api/pith-number/SAC2RYY2FC4PYFEHNUF7LWHHSN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/action/storage_attestation","attest_author":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/action/author_attestation","sign_citation":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/action/citation_signature","submit_replication":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/action/replication_record"}},"created_at":"2026-05-18T00:51:03.909368+00:00","updated_at":"2026-05-18T00:51:03.909368+00:00"}