{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:D4QK6FT5ZGMHCJT74E7HHXLRS5","short_pith_number":"pith:D4QK6FT5","canonical_record":{"source":{"id":"1912.06536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-13T14:40:34Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"a0f9aff2cf440cfbf972ad4c2ba32346650f0b218703524b1c2bc417749f034e","abstract_canon_sha256":"8aaac7722947b77d9ea1490f434721bae201ed211651f0b6973de70369fbdace"},"schema_version":"1.0"},"canonical_sha256":"1f20af167dc99871267fe13e73dd719763916211153f629a7bc3182dbf9d2d9c","source":{"kind":"arxiv","id":"1912.06536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.06536","created_at":"2026-07-05T00:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1912.06536v1","created_at":"2026-07-05T00:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.06536","created_at":"2026-07-05T00:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"D4QK6FT5ZGMH","created_at":"2026-07-05T00:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"D4QK6FT5ZGMHCJT7","created_at":"2026-07-05T00:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"D4QK6FT5","created_at":"2026-07-05T00:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:D4QK6FT5ZGMHCJT74E7HHXLRS5","target":"record","payload":{"canonical_record":{"source":{"id":"1912.06536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-13T14:40:34Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"a0f9aff2cf440cfbf972ad4c2ba32346650f0b218703524b1c2bc417749f034e","abstract_canon_sha256":"8aaac7722947b77d9ea1490f434721bae201ed211651f0b6973de70369fbdace"},"schema_version":"1.0"},"canonical_sha256":"1f20af167dc99871267fe13e73dd719763916211153f629a7bc3182dbf9d2d9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:01.944379Z","signature_b64":"5R3sEJ3R2Kr+dhxibwFKKKn/V7sfMuBsYAxvXKHx+B/6lFO9RD0yggNe2JyljwUQMDMy7c/c0yHaNc/i3idiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f20af167dc99871267fe13e73dd719763916211153f629a7bc3182dbf9d2d9c","last_reissued_at":"2026-07-05T00:26:01.943963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:01.943963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.06536","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-07-05T00:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2qjuQME31WpHKQ6754z/v4XKxniFKFRuc46gNbwmow23+Gbt98w7Zb881qYx/dLCG7i/4gca+K/u2/yj4DoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T19:52:06.494759Z"},"content_sha256":"8800bd7a59e802adb4c2963ab2ee6db3ef5d44b135d8bbeba06fc87d9170366d","schema_version":"1.0","event_id":"sha256:8800bd7a59e802adb4c2963ab2ee6db3ef5d44b135d8bbeba06fc87d9170366d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:D4QK6FT5ZGMHCJT74E7HHXLRS5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of convergence rate via algebraic connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Zhidong He","submitted_at":"2019-12-13T14:40:34Z","abstract_excerpt":"The algebraic connectivity of a network characterizes the lower-bound of the exponential convergence rate of consensus processes. This paper investigates the problem of accelerating the convergence of consensus processes by adding links to the network. Based on a perturbation formula of the algebraic connectivity, we propose a greedy strategy for undirected networks and give a lower bound of its performance through an approximation of submodularity. We further extend our investigation to directed networks, where the second smallest real part among all the eigenvalues of the non-Hermitian Lapla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.06536","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.06536/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLgCo4hNXvEzOXg2uIZddAcfA7nr1NFUuZdwIOB2l6+EfQIOLcdQ3+fwxxiEkIJvhWmOu501KDtiyghp/w4PCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T19:52:06.495286Z"},"content_sha256":"f49fadcf8d32e1a5981d97bf92c0176136b368d479d0e8b304d96b3b1ff372d4","schema_version":"1.0","event_id":"sha256:f49fadcf8d32e1a5981d97bf92c0176136b368d479d0e8b304d96b3b1ff372d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4QK6FT5ZGMHCJT74E7HHXLRS5/bundle.json","state_url":"https://pith.science/pith/D4QK6FT5ZGMHCJT74E7HHXLRS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4QK6FT5ZGMHCJT74E7HHXLRS5/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-08-20T19:52:06Z","links":{"resolver":"https://pith.science/pith/D4QK6FT5ZGMHCJT74E7HHXLRS5","bundle":"https://pith.science/pith/D4QK6FT5ZGMHCJT74E7HHXLRS5/bundle.json","state":"https://pith.science/pith/D4QK6FT5ZGMHCJT74E7HHXLRS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4QK6FT5ZGMHCJT74E7HHXLRS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:D4QK6FT5ZGMHCJT74E7HHXLRS5","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":"8aaac7722947b77d9ea1490f434721bae201ed211651f0b6973de70369fbdace","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-13T14:40:34Z","title_canon_sha256":"a0f9aff2cf440cfbf972ad4c2ba32346650f0b218703524b1c2bc417749f034e"},"schema_version":"1.0","source":{"id":"1912.06536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.06536","created_at":"2026-07-05T00:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1912.06536v1","created_at":"2026-07-05T00:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.06536","created_at":"2026-07-05T00:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"D4QK6FT5ZGMH","created_at":"2026-07-05T00:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"D4QK6FT5ZGMHCJT7","created_at":"2026-07-05T00:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"D4QK6FT5","created_at":"2026-07-05T00:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:f49fadcf8d32e1a5981d97bf92c0176136b368d479d0e8b304d96b3b1ff372d4","target":"graph","created_at":"2026-07-05T00:26:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.06536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The algebraic connectivity of a network characterizes the lower-bound of the exponential convergence rate of consensus processes. This paper investigates the problem of accelerating the convergence of consensus processes by adding links to the network. Based on a perturbation formula of the algebraic connectivity, we propose a greedy strategy for undirected networks and give a lower bound of its performance through an approximation of submodularity. We further extend our investigation to directed networks, where the second smallest real part among all the eigenvalues of the non-Hermitian Lapla","authors_text":"Zhidong He","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-13T14:40:34Z","title":"Optimization of convergence rate via algebraic connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.06536","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:8800bd7a59e802adb4c2963ab2ee6db3ef5d44b135d8bbeba06fc87d9170366d","target":"record","created_at":"2026-07-05T00:26:01Z","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":"8aaac7722947b77d9ea1490f434721bae201ed211651f0b6973de70369fbdace","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-13T14:40:34Z","title_canon_sha256":"a0f9aff2cf440cfbf972ad4c2ba32346650f0b218703524b1c2bc417749f034e"},"schema_version":"1.0","source":{"id":"1912.06536","kind":"arxiv","version":1}},"canonical_sha256":"1f20af167dc99871267fe13e73dd719763916211153f629a7bc3182dbf9d2d9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f20af167dc99871267fe13e73dd719763916211153f629a7bc3182dbf9d2d9c","first_computed_at":"2026-07-05T00:26:01.943963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:26:01.943963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5R3sEJ3R2Kr+dhxibwFKKKn/V7sfMuBsYAxvXKHx+B/6lFO9RD0yggNe2JyljwUQMDMy7c/c0yHaNc/i3idiAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:26:01.944379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.06536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8800bd7a59e802adb4c2963ab2ee6db3ef5d44b135d8bbeba06fc87d9170366d","sha256:f49fadcf8d32e1a5981d97bf92c0176136b368d479d0e8b304d96b3b1ff372d4"],"state_sha256":"4cb6e86ab21c280504c9d63e84dbbc139e868bb6021437b3bc82617a2655fa4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXHfMTqGXH+K6GJImhQ+ahxiuZTUAUp1t90PwIIVb6ZanMTLcWGBV9upO5BK5YnccNZoYWIUoX7OsOpZxz7DDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T19:52:06.500399Z","bundle_sha256":"169b904e235333cbb5257dfdafef75d9e83581d4978edd16b663e9c6961e5e4a"}}