{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RIE2OSL7IFZGMPOOUCJ4VIP2SS","short_pith_number":"pith:RIE2OSL7","canonical_record":{"source":{"id":"1709.01150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-04T20:52:21Z","cross_cats_sorted":["cs.MA","math.DS"],"title_canon_sha256":"2403d371d41275945b25898880809159b19e1c297d36e7f4a7c80e651a2471c1","abstract_canon_sha256":"a6a211b496feab3a2c340bb2ed7fe3bb3a8786678bf076f9a051a1831cd09859"},"schema_version":"1.0"},"canonical_sha256":"8a09a7497f4172663dcea093caa1fa94ba22fb1fb19130e2d1ef16568b1a3dc4","source":{"kind":"arxiv","id":"1709.01150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01150","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01150v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01150","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"RIE2OSL7IFZG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RIE2OSL7IFZGMPOO","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RIE2OSL7","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RIE2OSL7IFZGMPOOUCJ4VIP2SS","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-04T20:52:21Z","cross_cats_sorted":["cs.MA","math.DS"],"title_canon_sha256":"2403d371d41275945b25898880809159b19e1c297d36e7f4a7c80e651a2471c1","abstract_canon_sha256":"a6a211b496feab3a2c340bb2ed7fe3bb3a8786678bf076f9a051a1831cd09859"},"schema_version":"1.0"},"canonical_sha256":"8a09a7497f4172663dcea093caa1fa94ba22fb1fb19130e2d1ef16568b1a3dc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:00.764617Z","signature_b64":"RDa3EJKH7yL+kuDMoBIm9pzndMek51DXa2FOSTaAPzcqbXRyNyiR2b/Qh2hXOzD/xmyCLLxnZA8TkdUAI2C1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a09a7497f4172663dcea093caa1fa94ba22fb1fb19130e2d1ef16568b1a3dc4","last_reissued_at":"2026-05-18T00:36:00.764077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:00.764077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01150","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/K7xY6YtrOEnZy6VmeuQINlU0G4U2ahBC/h/KeB905yCMMUCDHzSrBUIdeYdN0zvc2HEznVgFzg8GSzVSokAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:49:30.255065Z"},"content_sha256":"ef13e94cb67345d5ad79be390899feae1f70bfa78db64cf5f89b02396f5e310a","schema_version":"1.0","event_id":"sha256:ef13e94cb67345d5ad79be390899feae1f70bfa78db64cf5f89b02396f5e310a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RIE2OSL7IFZGMPOOUCJ4VIP2SS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abstraction of Linear Consensus Networks with Guaranteed Systemic Performance Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","math.DS"],"primary_cat":"cs.SY","authors_text":"Milad Siami, Nader Motee","submitted_at":"2017-09-04T20:52:21Z","abstract_excerpt":"A proper abstraction of a large-scale linear consensus network with a dense coupling graph is one whose number of coupling links is proportional to its number of subsystems and its performance is comparable to the original network. Optimal design problems for an abstracted network are more amenable to efficient optimization algorithms. From the implementation point of view, maintaining such networks are usually more favorable and cost effective due to their reduced communication requirements across a network. Therefore, approximating a given dense linear consensus network by a suitable abstrac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01150","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YhI6sSsWWWoUIQ3bkjdeZeeXW4LiGSDhaU5/2JKKNu0QtOgayeiVb9rHTObKZD3mEM0hRYbGuZsJdU+6c96nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:49:30.255806Z"},"content_sha256":"163158389fa6b829500c902bd314265a117a6c14023aeb8c5689ae8a7e145617","schema_version":"1.0","event_id":"sha256:163158389fa6b829500c902bd314265a117a6c14023aeb8c5689ae8a7e145617"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIE2OSL7IFZGMPOOUCJ4VIP2SS/bundle.json","state_url":"https://pith.science/pith/RIE2OSL7IFZGMPOOUCJ4VIP2SS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIE2OSL7IFZGMPOOUCJ4VIP2SS/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-11T01:49:30Z","links":{"resolver":"https://pith.science/pith/RIE2OSL7IFZGMPOOUCJ4VIP2SS","bundle":"https://pith.science/pith/RIE2OSL7IFZGMPOOUCJ4VIP2SS/bundle.json","state":"https://pith.science/pith/RIE2OSL7IFZGMPOOUCJ4VIP2SS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIE2OSL7IFZGMPOOUCJ4VIP2SS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RIE2OSL7IFZGMPOOUCJ4VIP2SS","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":"a6a211b496feab3a2c340bb2ed7fe3bb3a8786678bf076f9a051a1831cd09859","cross_cats_sorted":["cs.MA","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-04T20:52:21Z","title_canon_sha256":"2403d371d41275945b25898880809159b19e1c297d36e7f4a7c80e651a2471c1"},"schema_version":"1.0","source":{"id":"1709.01150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01150","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01150v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01150","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"RIE2OSL7IFZG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RIE2OSL7IFZGMPOO","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RIE2OSL7","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:163158389fa6b829500c902bd314265a117a6c14023aeb8c5689ae8a7e145617","target":"graph","created_at":"2026-05-18T00:36:00Z","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":"A proper abstraction of a large-scale linear consensus network with a dense coupling graph is one whose number of coupling links is proportional to its number of subsystems and its performance is comparable to the original network. Optimal design problems for an abstracted network are more amenable to efficient optimization algorithms. From the implementation point of view, maintaining such networks are usually more favorable and cost effective due to their reduced communication requirements across a network. Therefore, approximating a given dense linear consensus network by a suitable abstrac","authors_text":"Milad Siami, Nader Motee","cross_cats":["cs.MA","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-04T20:52:21Z","title":"Abstraction of Linear Consensus Networks with Guaranteed Systemic Performance Measures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01150","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:ef13e94cb67345d5ad79be390899feae1f70bfa78db64cf5f89b02396f5e310a","target":"record","created_at":"2026-05-18T00:36:00Z","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":"a6a211b496feab3a2c340bb2ed7fe3bb3a8786678bf076f9a051a1831cd09859","cross_cats_sorted":["cs.MA","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-04T20:52:21Z","title_canon_sha256":"2403d371d41275945b25898880809159b19e1c297d36e7f4a7c80e651a2471c1"},"schema_version":"1.0","source":{"id":"1709.01150","kind":"arxiv","version":1}},"canonical_sha256":"8a09a7497f4172663dcea093caa1fa94ba22fb1fb19130e2d1ef16568b1a3dc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a09a7497f4172663dcea093caa1fa94ba22fb1fb19130e2d1ef16568b1a3dc4","first_computed_at":"2026-05-18T00:36:00.764077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:00.764077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RDa3EJKH7yL+kuDMoBIm9pzndMek51DXa2FOSTaAPzcqbXRyNyiR2b/Qh2hXOzD/xmyCLLxnZA8TkdUAI2C1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:00.764617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef13e94cb67345d5ad79be390899feae1f70bfa78db64cf5f89b02396f5e310a","sha256:163158389fa6b829500c902bd314265a117a6c14023aeb8c5689ae8a7e145617"],"state_sha256":"7688b85e36ff9b98ed6be63c016933a2328750e187c8553826ca26e01c048ca9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oodMy/P5TafuEaDShtMVnoh12V3jmZbf+LUcYfJqcxVK6vvtk8e8KhiykQdzSEMI0l1PLM67eDsSwFJGowjjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:49:30.259968Z","bundle_sha256":"62b0aca2f66b4a96ccd24ddab08f92f7f96d3ee942511d2ac00e2807de984c94"}}