{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KWFSL72XHYVD7X2YCGKEZVJETD","short_pith_number":"pith:KWFSL72X","canonical_record":{"source":{"id":"1605.00620","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-02T19:06:45Z","cross_cats_sorted":[],"title_canon_sha256":"944f10d8f79ff81f28d458a4b41a318ce053269df67fc57372e89740d4e189d0","abstract_canon_sha256":"7bb5a7cd786e36b65555b1064038616bc2e594e875e5ddaedae19fadf1eb9b1a"},"schema_version":"1.0"},"canonical_sha256":"558b25ff573e2a3fdf5811944cd52498f9051084ed14ae053eefaf4c9f7510c4","source":{"kind":"arxiv","id":"1605.00620","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00620","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00620v3","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00620","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"KWFSL72XHYVD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KWFSL72XHYVD7X2Y","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KWFSL72X","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KWFSL72XHYVD7X2YCGKEZVJETD","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00620","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-02T19:06:45Z","cross_cats_sorted":[],"title_canon_sha256":"944f10d8f79ff81f28d458a4b41a318ce053269df67fc57372e89740d4e189d0","abstract_canon_sha256":"7bb5a7cd786e36b65555b1064038616bc2e594e875e5ddaedae19fadf1eb9b1a"},"schema_version":"1.0"},"canonical_sha256":"558b25ff573e2a3fdf5811944cd52498f9051084ed14ae053eefaf4c9f7510c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:02.577279Z","signature_b64":"rsl202ueiU7Pti8n0Hz0fdLjcyXtOQ/CAhK+gG7fXHAuFqaUuJeZNjCfPCR8gyaTi2r3hE8MISZJljMKNh3eBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"558b25ff573e2a3fdf5811944cd52498f9051084ed14ae053eefaf4c9f7510c4","last_reissued_at":"2026-05-18T00:53:02.576793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:02.576793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00620","source_version":3,"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:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wV5EfwAXJEJnKa31BhvDsI4gLg9JfrG2UMuWBwcM8ZNmwJ9MyEmXSA/MRB9tZAhUo3/HrjfWlgUZgbpBHscGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:38:20.660983Z"},"content_sha256":"16542ced883ef0e986f39616ebe2dbb90ef776714eedac6bf0c84bf81898775d","schema_version":"1.0","event_id":"sha256:16542ced883ef0e986f39616ebe2dbb90ef776714eedac6bf0c84bf81898775d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KWFSL72XHYVD7X2YCGKEZVJETD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Game-Theoretic Multi-Agent Control and Network Cost Allocation under Communication Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Alexandra Duel-Hallen, Aranya Chakrabortty, Feier Lian","submitted_at":"2016-05-02T19:06:45Z","abstract_excerpt":"Multi-agent networked linear dynamic systems have attracted attention of researchers in power systems, intelligent transportation, and industrial automation. The agents might cooperatively optimize a global performance objective, resulting in social optimization, or try to satisfy their own selfish objectives using a noncooperative differential game. However, in these solutions, large volumes of data must be sent from system states to possibly distant control inputs, thus resulting in high cost of the underlying communication network. To enable economically-viable communication, a game-theoret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00620","kind":"arxiv","version":3},"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:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQAm4DCLPIqQGa9hVnBQi8w/IoX7oQhc05l6sZdZaDv0brsZGMDPXyPZMLmOapjfFkj9pO5OLPr+PPr5J0QDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:38:20.661375Z"},"content_sha256":"5e34d003982f7c4c83d0f40ecd32c8df0474ecac2936b44768b42072383fab66","schema_version":"1.0","event_id":"sha256:5e34d003982f7c4c83d0f40ecd32c8df0474ecac2936b44768b42072383fab66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWFSL72XHYVD7X2YCGKEZVJETD/bundle.json","state_url":"https://pith.science/pith/KWFSL72XHYVD7X2YCGKEZVJETD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWFSL72XHYVD7X2YCGKEZVJETD/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-10T22:38:20Z","links":{"resolver":"https://pith.science/pith/KWFSL72XHYVD7X2YCGKEZVJETD","bundle":"https://pith.science/pith/KWFSL72XHYVD7X2YCGKEZVJETD/bundle.json","state":"https://pith.science/pith/KWFSL72XHYVD7X2YCGKEZVJETD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWFSL72XHYVD7X2YCGKEZVJETD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KWFSL72XHYVD7X2YCGKEZVJETD","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":"7bb5a7cd786e36b65555b1064038616bc2e594e875e5ddaedae19fadf1eb9b1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-02T19:06:45Z","title_canon_sha256":"944f10d8f79ff81f28d458a4b41a318ce053269df67fc57372e89740d4e189d0"},"schema_version":"1.0","source":{"id":"1605.00620","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00620","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00620v3","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00620","created_at":"2026-05-18T00:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"KWFSL72XHYVD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KWFSL72XHYVD7X2Y","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KWFSL72X","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:5e34d003982f7c4c83d0f40ecd32c8df0474ecac2936b44768b42072383fab66","target":"graph","created_at":"2026-05-18T00:53: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"},"paper":{"abstract_excerpt":"Multi-agent networked linear dynamic systems have attracted attention of researchers in power systems, intelligent transportation, and industrial automation. The agents might cooperatively optimize a global performance objective, resulting in social optimization, or try to satisfy their own selfish objectives using a noncooperative differential game. However, in these solutions, large volumes of data must be sent from system states to possibly distant control inputs, thus resulting in high cost of the underlying communication network. To enable economically-viable communication, a game-theoret","authors_text":"Alexandra Duel-Hallen, Aranya Chakrabortty, Feier Lian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-02T19:06:45Z","title":"Game-Theoretic Multi-Agent Control and Network Cost Allocation under Communication Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00620","kind":"arxiv","version":3},"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:16542ced883ef0e986f39616ebe2dbb90ef776714eedac6bf0c84bf81898775d","target":"record","created_at":"2026-05-18T00:53: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":"7bb5a7cd786e36b65555b1064038616bc2e594e875e5ddaedae19fadf1eb9b1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-02T19:06:45Z","title_canon_sha256":"944f10d8f79ff81f28d458a4b41a318ce053269df67fc57372e89740d4e189d0"},"schema_version":"1.0","source":{"id":"1605.00620","kind":"arxiv","version":3}},"canonical_sha256":"558b25ff573e2a3fdf5811944cd52498f9051084ed14ae053eefaf4c9f7510c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"558b25ff573e2a3fdf5811944cd52498f9051084ed14ae053eefaf4c9f7510c4","first_computed_at":"2026-05-18T00:53:02.576793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:02.576793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rsl202ueiU7Pti8n0Hz0fdLjcyXtOQ/CAhK+gG7fXHAuFqaUuJeZNjCfPCR8gyaTi2r3hE8MISZJljMKNh3eBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:02.577279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00620","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16542ced883ef0e986f39616ebe2dbb90ef776714eedac6bf0c84bf81898775d","sha256:5e34d003982f7c4c83d0f40ecd32c8df0474ecac2936b44768b42072383fab66"],"state_sha256":"aa2e62380d311ef3baafe1091bbad39ce42c441c597296d9276d0f5bdf2b5194"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p7TXONQbBZj8ec9ehww40XBPCX2/oF7OQd88Ek7+3KM5K0K9YAZkMp4QLYponShagHInQTuR6B1JpCgfNyQmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:38:20.663228Z","bundle_sha256":"5e50f325bed909127bf41e04e406dcd90fbb1cb06973ce17c7b7d103253cc196"}}