{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2EATO3PS2FELQ2K3XS76BDOZGA","short_pith_number":"pith:2EATO3PS","canonical_record":{"source":{"id":"1808.01418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-08-04T03:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"d36c6391a73e59c603072408a756909311deb3c725a3f8c2c5b65d613bea9ed1","abstract_canon_sha256":"12996d2d98f6e27fdf7c4064476aa16a2bc11a6bf2ed8ca3ef57fdfa5a1e6873"},"schema_version":"1.0"},"canonical_sha256":"d101376df2d148b8695bbcbfe08dd930307b8fd1d84302064ee6bb75cf5bbf04","source":{"kind":"arxiv","id":"1808.01418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01418","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01418v1","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01418","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"2EATO3PS2FEL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2EATO3PS2FELQ2K3","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2EATO3PS","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2EATO3PS2FELQ2K3XS76BDOZGA","target":"record","payload":{"canonical_record":{"source":{"id":"1808.01418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-08-04T03:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"d36c6391a73e59c603072408a756909311deb3c725a3f8c2c5b65d613bea9ed1","abstract_canon_sha256":"12996d2d98f6e27fdf7c4064476aa16a2bc11a6bf2ed8ca3ef57fdfa5a1e6873"},"schema_version":"1.0"},"canonical_sha256":"d101376df2d148b8695bbcbfe08dd930307b8fd1d84302064ee6bb75cf5bbf04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:53.053060Z","signature_b64":"dZiHJAe4Q9+0LrBKUV+mVXhdiqsdaFv2ePVXEdYYEAXA8fb8I+JpQTltTLNy3d805ePsjnS4jh4EoOPr78NKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d101376df2d148b8695bbcbfe08dd930307b8fd1d84302064ee6bb75cf5bbf04","last_reissued_at":"2026-05-18T00:08:53.052258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:53.052258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.01418","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:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2G2wQZq55y7z6Dce2r12Anf53yPrBNrJIkmUbxvTtO0TVTRQLkL9ns0Vqrxsyz9BkO38SV1cyHvRakLwOfIODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:28:29.488897Z"},"content_sha256":"d302002832d87e85e38414a3fc278fcccd8dc52759aec2595c3cec9eb28b2f04","schema_version":"1.0","event_id":"sha256:d302002832d87e85e38414a3fc278fcccd8dc52759aec2595c3cec9eb28b2f04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2EATO3PS2FELQ2K3XS76BDOZGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average Consensus by Graph Filtering: New Approach, Explicit Convergence Rate and Optimal Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Jingwen Yi, Jingxin Zhang, Li Chai","submitted_at":"2018-08-04T03:38:32Z","abstract_excerpt":"This paper revisits the problem of multi-agent consensus from a graph signal processing perspective. Describing a consensus protocol as a graph spectrum filter, we present an effective new approach to the analysis and design of consensus protocols in the graph spectrum domain for the uncertain networks, which are difficult to handle by the existing time-domain methods. This novel approach has led to the following new results in this paper: 1) New necessary and sufficient conditions for both finite-time and asymptotic average consensus of multi-agent systems. 2) Direct link between the consensu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01418","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:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYVRd8GHj8Cnv7Flq0RqdOiZyoshmBV4jhYlAruKJHlAb4v6wn/+0ViFtSYfRKiciqlPHHUbqH7u6t+3BgamDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:28:29.489236Z"},"content_sha256":"aa99ad0aa7cd3fba7853da5c16003b2cccd640ff752bf17132605937d0c43820","schema_version":"1.0","event_id":"sha256:aa99ad0aa7cd3fba7853da5c16003b2cccd640ff752bf17132605937d0c43820"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2EATO3PS2FELQ2K3XS76BDOZGA/bundle.json","state_url":"https://pith.science/pith/2EATO3PS2FELQ2K3XS76BDOZGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2EATO3PS2FELQ2K3XS76BDOZGA/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-25T08:28:29Z","links":{"resolver":"https://pith.science/pith/2EATO3PS2FELQ2K3XS76BDOZGA","bundle":"https://pith.science/pith/2EATO3PS2FELQ2K3XS76BDOZGA/bundle.json","state":"https://pith.science/pith/2EATO3PS2FELQ2K3XS76BDOZGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2EATO3PS2FELQ2K3XS76BDOZGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2EATO3PS2FELQ2K3XS76BDOZGA","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":"12996d2d98f6e27fdf7c4064476aa16a2bc11a6bf2ed8ca3ef57fdfa5a1e6873","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-08-04T03:38:32Z","title_canon_sha256":"d36c6391a73e59c603072408a756909311deb3c725a3f8c2c5b65d613bea9ed1"},"schema_version":"1.0","source":{"id":"1808.01418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01418","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01418v1","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01418","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"2EATO3PS2FEL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2EATO3PS2FELQ2K3","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2EATO3PS","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:aa99ad0aa7cd3fba7853da5c16003b2cccd640ff752bf17132605937d0c43820","target":"graph","created_at":"2026-05-18T00:08:53Z","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":"This paper revisits the problem of multi-agent consensus from a graph signal processing perspective. Describing a consensus protocol as a graph spectrum filter, we present an effective new approach to the analysis and design of consensus protocols in the graph spectrum domain for the uncertain networks, which are difficult to handle by the existing time-domain methods. This novel approach has led to the following new results in this paper: 1) New necessary and sufficient conditions for both finite-time and asymptotic average consensus of multi-agent systems. 2) Direct link between the consensu","authors_text":"Jingwen Yi, Jingxin Zhang, Li Chai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-08-04T03:38:32Z","title":"Average Consensus by Graph Filtering: New Approach, Explicit Convergence Rate and Optimal Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01418","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:d302002832d87e85e38414a3fc278fcccd8dc52759aec2595c3cec9eb28b2f04","target":"record","created_at":"2026-05-18T00:08:53Z","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":"12996d2d98f6e27fdf7c4064476aa16a2bc11a6bf2ed8ca3ef57fdfa5a1e6873","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-08-04T03:38:32Z","title_canon_sha256":"d36c6391a73e59c603072408a756909311deb3c725a3f8c2c5b65d613bea9ed1"},"schema_version":"1.0","source":{"id":"1808.01418","kind":"arxiv","version":1}},"canonical_sha256":"d101376df2d148b8695bbcbfe08dd930307b8fd1d84302064ee6bb75cf5bbf04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d101376df2d148b8695bbcbfe08dd930307b8fd1d84302064ee6bb75cf5bbf04","first_computed_at":"2026-05-18T00:08:53.052258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:53.052258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dZiHJAe4Q9+0LrBKUV+mVXhdiqsdaFv2ePVXEdYYEAXA8fb8I+JpQTltTLNy3d805ePsjnS4jh4EoOPr78NKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:53.053060Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d302002832d87e85e38414a3fc278fcccd8dc52759aec2595c3cec9eb28b2f04","sha256:aa99ad0aa7cd3fba7853da5c16003b2cccd640ff752bf17132605937d0c43820"],"state_sha256":"6e447062e46a8516ed8a7f1e964d80a2e2daaa71427fa82461cbd9d51f5b90d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/hc3B/J+VnBkxePkBqQiwzhHpknqomXPGvRRviLqlW55P/zXLQDJpY0GSlnQHEse/tHGQd9FYLtUhXl0WNRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:28:29.491278Z","bundle_sha256":"af5c5971086e530a1d56ab829cc0b5f865136561633e5812653bb1fee5ca7291"}}