{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TAFGMT6EQNGLVEQUYD437N6XK7","short_pith_number":"pith:TAFGMT6E","canonical_record":{"source":{"id":"1802.10152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-27T20:30:17Z","cross_cats_sorted":[],"title_canon_sha256":"e6fcc6f3ff01722f56d9175b58ee683e4c4aaf9a5903165325c6c5df1dc410d7","abstract_canon_sha256":"4b3edd1c3f67b9a9ef46993e5a57d7dac2c5bfc5cdc1e26f19ad231f83d62f37"},"schema_version":"1.0"},"canonical_sha256":"980a664fc4834cba9214c0f9bfb7d757dfc66646e2294fa68822d3f471b16df0","source":{"kind":"arxiv","id":"1802.10152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10152","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10152v1","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10152","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"TAFGMT6EQNGL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TAFGMT6EQNGLVEQU","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TAFGMT6E","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TAFGMT6EQNGLVEQUYD437N6XK7","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-27T20:30:17Z","cross_cats_sorted":[],"title_canon_sha256":"e6fcc6f3ff01722f56d9175b58ee683e4c4aaf9a5903165325c6c5df1dc410d7","abstract_canon_sha256":"4b3edd1c3f67b9a9ef46993e5a57d7dac2c5bfc5cdc1e26f19ad231f83d62f37"},"schema_version":"1.0"},"canonical_sha256":"980a664fc4834cba9214c0f9bfb7d757dfc66646e2294fa68822d3f471b16df0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:17.993723Z","signature_b64":"JIfbi7/V3fUUG9y87JfpiKfCf6SuyDODg/1r3MngjvdT354vY7adq69uWpeVQ2CLXvW68/zDEi4PE2hqDVTOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"980a664fc4834cba9214c0f9bfb7d757dfc66646e2294fa68822d3f471b16df0","last_reissued_at":"2026-05-18T00:22:17.993055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:17.993055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10152","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:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXeHAcIy/FXHCGOdlQh+Cs0Le37b3/a479LZ/xgFVfTDS8DLPv+hmJjCMyt3oht6DMYTYg4tPMAxMH8GfME8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:02:44.989492Z"},"content_sha256":"a85733bc0f75014bb955d703d8b1e4f576faa0e32145bbd5438292525f22aa56","schema_version":"1.0","event_id":"sha256:a85733bc0f75014bb955d703d8b1e4f576faa0e32145bbd5438292525f22aa56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TAFGMT6EQNGLVEQUYD437N6XK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Filter Design for Consensus on Random Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Jos\\'e M. F. Moura, Stephen Kruzick","submitted_at":"2018-02-27T20:30:17Z","abstract_excerpt":"Optimal design of consensus acceleration graph filters relates closely to the eigenvalues of the consensus iteration matrix. This task is complicated by random networks with uncertain iteration matrix eigenvalues. Filter design methods based on the spectral asymptotics of consensus iteration matrices for large-scale, random undirected networks have been previously developed both for constant and for time-varying network topologies. This work builds upon these results by extending analysis to large-scale, constant, random directed networks. The proposed approach uses theorems by Girko that anal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10152","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:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"reFZWhX5DOItfhNPKPN6zjs7kw3EfRDZmWHJL/yzfyylQSj5LpgLA1//Hp48HK3VCHMh/SIRtKdDo0GAqbxJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:02:44.990133Z"},"content_sha256":"2de4cf1e8560e6bddbddbe3fa2c413e121991021732d3e5e512ae0486d0fdb3f","schema_version":"1.0","event_id":"sha256:2de4cf1e8560e6bddbddbe3fa2c413e121991021732d3e5e512ae0486d0fdb3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAFGMT6EQNGLVEQUYD437N6XK7/bundle.json","state_url":"https://pith.science/pith/TAFGMT6EQNGLVEQUYD437N6XK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAFGMT6EQNGLVEQUYD437N6XK7/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-11T19:02:44Z","links":{"resolver":"https://pith.science/pith/TAFGMT6EQNGLVEQUYD437N6XK7","bundle":"https://pith.science/pith/TAFGMT6EQNGLVEQUYD437N6XK7/bundle.json","state":"https://pith.science/pith/TAFGMT6EQNGLVEQUYD437N6XK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAFGMT6EQNGLVEQUYD437N6XK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TAFGMT6EQNGLVEQUYD437N6XK7","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":"4b3edd1c3f67b9a9ef46993e5a57d7dac2c5bfc5cdc1e26f19ad231f83d62f37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-27T20:30:17Z","title_canon_sha256":"e6fcc6f3ff01722f56d9175b58ee683e4c4aaf9a5903165325c6c5df1dc410d7"},"schema_version":"1.0","source":{"id":"1802.10152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10152","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10152v1","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10152","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"TAFGMT6EQNGL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TAFGMT6EQNGLVEQU","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TAFGMT6E","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:2de4cf1e8560e6bddbddbe3fa2c413e121991021732d3e5e512ae0486d0fdb3f","target":"graph","created_at":"2026-05-18T00:22:17Z","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":"Optimal design of consensus acceleration graph filters relates closely to the eigenvalues of the consensus iteration matrix. This task is complicated by random networks with uncertain iteration matrix eigenvalues. Filter design methods based on the spectral asymptotics of consensus iteration matrices for large-scale, random undirected networks have been previously developed both for constant and for time-varying network topologies. This work builds upon these results by extending analysis to large-scale, constant, random directed networks. The proposed approach uses theorems by Girko that anal","authors_text":"Jos\\'e M. F. Moura, Stephen Kruzick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-27T20:30:17Z","title":"Optimal Filter Design for Consensus on Random Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10152","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:a85733bc0f75014bb955d703d8b1e4f576faa0e32145bbd5438292525f22aa56","target":"record","created_at":"2026-05-18T00:22:17Z","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":"4b3edd1c3f67b9a9ef46993e5a57d7dac2c5bfc5cdc1e26f19ad231f83d62f37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-27T20:30:17Z","title_canon_sha256":"e6fcc6f3ff01722f56d9175b58ee683e4c4aaf9a5903165325c6c5df1dc410d7"},"schema_version":"1.0","source":{"id":"1802.10152","kind":"arxiv","version":1}},"canonical_sha256":"980a664fc4834cba9214c0f9bfb7d757dfc66646e2294fa68822d3f471b16df0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"980a664fc4834cba9214c0f9bfb7d757dfc66646e2294fa68822d3f471b16df0","first_computed_at":"2026-05-18T00:22:17.993055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:17.993055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JIfbi7/V3fUUG9y87JfpiKfCf6SuyDODg/1r3MngjvdT354vY7adq69uWpeVQ2CLXvW68/zDEi4PE2hqDVTOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:17.993723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a85733bc0f75014bb955d703d8b1e4f576faa0e32145bbd5438292525f22aa56","sha256:2de4cf1e8560e6bddbddbe3fa2c413e121991021732d3e5e512ae0486d0fdb3f"],"state_sha256":"117e1e6681ab5380d1467e89755f16a786ae8557f51f9624da82b41ddc7d31fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mh29fpxwi7sdodg/qqLJityil5FpvaK+xKjuoUf6yWVkDyoFeBjecT8GpuhRkW/RNBdi/WJdsA29e5YGP5QeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:02:44.994964Z","bundle_sha256":"6843c617f0bd9936a87ed40ce31ee0da0f7a8d7fa2ae851db90ae0452888623e"}}