{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DJHR4THR47JKGJHKQS2TQXN4ZT","short_pith_number":"pith:DJHR4THR","canonical_record":{"source":{"id":"1501.03439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-14T18:36:40Z","cross_cats_sorted":["math.DS","nlin.AO"],"title_canon_sha256":"36701f83127dd526105924fe3e8ab29ecf3ad17989f9ad24aa9ddd409da24f13","abstract_canon_sha256":"66c991bf28bd2301b630a34a39718ac2f6b517b85c9a3c0e9e258e5ed1504bca"},"schema_version":"1.0"},"canonical_sha256":"1a4f1e4cf1e7d2a324ea84b5385dbcccf86ddba40bf8cae6f9f0f3a54856f2a7","source":{"kind":"arxiv","id":"1501.03439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03439","created_at":"2026-05-18T02:29:24Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03439v1","created_at":"2026-05-18T02:29:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03439","created_at":"2026-05-18T02:29:24Z"},{"alias_kind":"pith_short_12","alias_value":"DJHR4THR47JK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DJHR4THR47JKGJHK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DJHR4THR","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DJHR4THR47JKGJHKQS2TQXN4ZT","target":"record","payload":{"canonical_record":{"source":{"id":"1501.03439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-14T18:36:40Z","cross_cats_sorted":["math.DS","nlin.AO"],"title_canon_sha256":"36701f83127dd526105924fe3e8ab29ecf3ad17989f9ad24aa9ddd409da24f13","abstract_canon_sha256":"66c991bf28bd2301b630a34a39718ac2f6b517b85c9a3c0e9e258e5ed1504bca"},"schema_version":"1.0"},"canonical_sha256":"1a4f1e4cf1e7d2a324ea84b5385dbcccf86ddba40bf8cae6f9f0f3a54856f2a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:24.043294Z","signature_b64":"yhSlFHmLVl46NFz/LbyjGzrXdKYU2UYREkwZlY8D1/4RewCy1XmkA8s+xro+Nu8UmTEwElPQP75jsba1R2ySBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a4f1e4cf1e7d2a324ea84b5385dbcccf86ddba40bf8cae6f9f0f3a54856f2a7","last_reissued_at":"2026-05-18T02:29:24.042714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:24.042714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.03439","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-18T02:29:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QdV9qtYEUzENN52jOnvAYsxbqg2H9YndrLiYevJTSbNb3d1+K2nJGCr20o2cCgHJraXCpnA5EqMgYAYpLfzHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T01:36:26.975138Z"},"content_sha256":"6219bc03cf28ec49ad853772a09fe19b40077c3b0497f13c4ad299d4f73a4221","schema_version":"1.0","event_id":"sha256:6219bc03cf28ec49ad853772a09fe19b40077c3b0497f13c4ad299d4f73a4221"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DJHR4THR47JKGJHKQS2TQXN4ZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Control of Networked Multiagent Systems with Uncertain Graph Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","nlin.AO"],"primary_cat":"math.OC","authors_text":"John Daniel Peterson, Kevin L. Moore, Tansel Yucelen","submitted_at":"2015-01-14T18:36:40Z","abstract_excerpt":"Multiagent systems consist of agents that locally exchange information through a physical network subject to a graph topology. Current control methods for networked multiagent systems assume the knowledge of graph topologies in order to design distributed control laws for achieving desired global system behaviors. However, this assumption may not be valid for situations where graph topologies are subject to uncertainties either due to changes in the physical network or the presence of modeling errors especially for multiagent systems involving a large number of interacting agents. Motivating f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03439","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-18T02:29:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMp5R4bpgWsdrmijkB/phfsPcJcMZZQDEo3O4OlUbjnGb1CRawm2JtrqNb77y4lkwlMGhgm/DvUNVZ+uZmYhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T01:36:26.975521Z"},"content_sha256":"9146f182fc69443aaefbcf493b71b19d35cdfec1157ae9e4c3a3397f49925e0b","schema_version":"1.0","event_id":"sha256:9146f182fc69443aaefbcf493b71b19d35cdfec1157ae9e4c3a3397f49925e0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJHR4THR47JKGJHKQS2TQXN4ZT/bundle.json","state_url":"https://pith.science/pith/DJHR4THR47JKGJHKQS2TQXN4ZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJHR4THR47JKGJHKQS2TQXN4ZT/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-25T01:36:26Z","links":{"resolver":"https://pith.science/pith/DJHR4THR47JKGJHKQS2TQXN4ZT","bundle":"https://pith.science/pith/DJHR4THR47JKGJHKQS2TQXN4ZT/bundle.json","state":"https://pith.science/pith/DJHR4THR47JKGJHKQS2TQXN4ZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJHR4THR47JKGJHKQS2TQXN4ZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DJHR4THR47JKGJHKQS2TQXN4ZT","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":"66c991bf28bd2301b630a34a39718ac2f6b517b85c9a3c0e9e258e5ed1504bca","cross_cats_sorted":["math.DS","nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-14T18:36:40Z","title_canon_sha256":"36701f83127dd526105924fe3e8ab29ecf3ad17989f9ad24aa9ddd409da24f13"},"schema_version":"1.0","source":{"id":"1501.03439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03439","created_at":"2026-05-18T02:29:24Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03439v1","created_at":"2026-05-18T02:29:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03439","created_at":"2026-05-18T02:29:24Z"},{"alias_kind":"pith_short_12","alias_value":"DJHR4THR47JK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DJHR4THR47JKGJHK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DJHR4THR","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:9146f182fc69443aaefbcf493b71b19d35cdfec1157ae9e4c3a3397f49925e0b","target":"graph","created_at":"2026-05-18T02:29:24Z","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":"Multiagent systems consist of agents that locally exchange information through a physical network subject to a graph topology. Current control methods for networked multiagent systems assume the knowledge of graph topologies in order to design distributed control laws for achieving desired global system behaviors. However, this assumption may not be valid for situations where graph topologies are subject to uncertainties either due to changes in the physical network or the presence of modeling errors especially for multiagent systems involving a large number of interacting agents. Motivating f","authors_text":"John Daniel Peterson, Kevin L. Moore, Tansel Yucelen","cross_cats":["math.DS","nlin.AO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-14T18:36:40Z","title":"Control of Networked Multiagent Systems with Uncertain Graph Topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03439","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:6219bc03cf28ec49ad853772a09fe19b40077c3b0497f13c4ad299d4f73a4221","target":"record","created_at":"2026-05-18T02:29:24Z","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":"66c991bf28bd2301b630a34a39718ac2f6b517b85c9a3c0e9e258e5ed1504bca","cross_cats_sorted":["math.DS","nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-14T18:36:40Z","title_canon_sha256":"36701f83127dd526105924fe3e8ab29ecf3ad17989f9ad24aa9ddd409da24f13"},"schema_version":"1.0","source":{"id":"1501.03439","kind":"arxiv","version":1}},"canonical_sha256":"1a4f1e4cf1e7d2a324ea84b5385dbcccf86ddba40bf8cae6f9f0f3a54856f2a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a4f1e4cf1e7d2a324ea84b5385dbcccf86ddba40bf8cae6f9f0f3a54856f2a7","first_computed_at":"2026-05-18T02:29:24.042714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:24.042714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yhSlFHmLVl46NFz/LbyjGzrXdKYU2UYREkwZlY8D1/4RewCy1XmkA8s+xro+Nu8UmTEwElPQP75jsba1R2ySBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:24.043294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6219bc03cf28ec49ad853772a09fe19b40077c3b0497f13c4ad299d4f73a4221","sha256:9146f182fc69443aaefbcf493b71b19d35cdfec1157ae9e4c3a3397f49925e0b"],"state_sha256":"b3f22e00adc5a0d3665faa6d31c69f52d0d802f20088f4eae9ac445015d73f8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yhKxMIQKpKFfejoW+g7SAU085quJts3rRLbBUrWrgxDXHU2AHlQZNr8sRUnxhwfkcZlS42M8ZCEjLjXFiFPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T01:36:26.977587Z","bundle_sha256":"f09a3623c715fb60abf9ad9613d61edc4a96b2110d885f653edd888823094057"}}