{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SAC2RYY2FC4PYFEHNUF7LWHHSN","short_pith_number":"pith:SAC2RYY2","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"},"canonical_sha256":"9005a8e31a28b8fc14876d0bf5d8e7934c84180a1bd23a8597325423a36d53aa","source":{"kind":"arxiv","id":"1702.02597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02597","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02597v1","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02597","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"SAC2RYY2FC4P","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SAC2RYY2FC4PYFEH","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SAC2RYY2","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SAC2RYY2FC4PYFEHNUF7LWHHSN","target":"record","payload":{"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"},"canonical_sha256":"9005a8e31a28b8fc14876d0bf5d8e7934c84180a1bd23a8597325423a36d53aa","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"},"source_kind":"arxiv","source_id":"1702.02597","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-05-18T00:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FX0rjBtZFcPmkBaKC9J8CI8FlQyE9CKCEOgzZVeSe/MR0qfHVH0EFEXsrCMmv2clExjAqKGuFPORBrKf6mwHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:30:08.476691Z"},"content_sha256":"5fbe96dede33d81a14eaddd5b4536cea25085228d6842b083cec2f3e9396d5fb","schema_version":"1.0","event_id":"sha256:5fbe96dede33d81a14eaddd5b4536cea25085228d6842b083cec2f3e9396d5fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SAC2RYY2FC4PYFEHNUF7LWHHSN","target":"graph","payload":{"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"},"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:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YflMoywmh1hDgNSHeylr87JfrauMCiBsZ2uuEA1n4ptJaOCYYDUWOJcDQ27YjgQ9Bc7A75NRw63swOMVIX5UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:30:08.477035Z"},"content_sha256":"2827afa98a84e843c630af7adbcfaf2057b75b1235966d171648b34ef49e2ee7","schema_version":"1.0","event_id":"sha256:2827afa98a84e843c630af7adbcfaf2057b75b1235966d171648b34ef49e2ee7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/bundle.json","state_url":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/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-03T01:30:08Z","links":{"resolver":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN","bundle":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/bundle.json","state":"https://pith.science/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAC2RYY2FC4PYFEHNUF7LWHHSN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SAC2RYY2FC4PYFEHNUF7LWHHSN","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":"1c88d8fd89d93bfd238622ed407a1aeb550437b60e819e42a79d59ed8f2b4953","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-08T19:50:39Z","title_canon_sha256":"a24ef6ca41f3f4450b355dd5aa176f2440a5a89649113f25f47f69e654187381"},"schema_version":"1.0","source":{"id":"1702.02597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02597","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02597v1","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02597","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"SAC2RYY2FC4P","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SAC2RYY2FC4PYFEH","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SAC2RYY2","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:2827afa98a84e843c630af7adbcfaf2057b75b1235966d171648b34ef49e2ee7","target":"graph","created_at":"2026-05-18T00:51:03Z","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":"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","authors_text":"A. Pedro Aguiar, Jos\\'e M. F. Moura, S\\'ergio Pequito, Soummya Kar, Stephen Kruzick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-08T19:50:39Z","title":"Structurally Observable Distributed Networks of Agents under Cost and Robustness Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02597","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:5fbe96dede33d81a14eaddd5b4536cea25085228d6842b083cec2f3e9396d5fb","target":"record","created_at":"2026-05-18T00:51:03Z","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":"1c88d8fd89d93bfd238622ed407a1aeb550437b60e819e42a79d59ed8f2b4953","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-02-08T19:50:39Z","title_canon_sha256":"a24ef6ca41f3f4450b355dd5aa176f2440a5a89649113f25f47f69e654187381"},"schema_version":"1.0","source":{"id":"1702.02597","kind":"arxiv","version":1}},"canonical_sha256":"9005a8e31a28b8fc14876d0bf5d8e7934c84180a1bd23a8597325423a36d53aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9005a8e31a28b8fc14876d0bf5d8e7934c84180a1bd23a8597325423a36d53aa","first_computed_at":"2026-05-18T00:51:03.909295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:03.909295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6f8p1APevoRaAroveUFrWdHPxc6XWwZFqbOlADBum/jLU9STFixD1yvVizhGzLNfshVCKNEjGkDhuRL+dVw9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:03.909688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fbe96dede33d81a14eaddd5b4536cea25085228d6842b083cec2f3e9396d5fb","sha256:2827afa98a84e843c630af7adbcfaf2057b75b1235966d171648b34ef49e2ee7"],"state_sha256":"320861b5699fea6396d99b21d8238beb46a6174d177fdad58888f6c243625cc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"meMXRr65nYwU/CBz1dcPrUu2xtiwVWlWeme91Pen1ijr+CCNRTq+KCQMUJ3UZNxCCUq8fS+z1WCsK8tA8XfZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:30:08.478992Z","bundle_sha256":"c2f45211c25b9b031cc48a347cd4cf151f17032d26490619ad20ddc3d1eed1cf"}}