{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UNIJ2IFNKELUOXDTCNZGNHKVZP","short_pith_number":"pith:UNIJ2IFN","canonical_record":{"source":{"id":"1011.5452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-24T18:47:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41ef90f73006ea0a9521731110d88b76a98fc95621922fa7a044cc61b9c059fd","abstract_canon_sha256":"d6ecefaf1d727f6d46744d79046b68ca9348569b6d801bdd3c6d34721ef91eb9"},"schema_version":"1.0"},"canonical_sha256":"a3509d20ad5117475c731372669d55cbf49a55d6354ee3aa1ac56b6bf1d0d12c","source":{"kind":"arxiv","id":"1011.5452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5452","created_at":"2026-05-18T02:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5452v1","created_at":"2026-05-18T02:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5452","created_at":"2026-05-18T02:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"UNIJ2IFNKELU","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UNIJ2IFNKELUOXDT","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UNIJ2IFN","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UNIJ2IFNKELUOXDTCNZGNHKVZP","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-24T18:47:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41ef90f73006ea0a9521731110d88b76a98fc95621922fa7a044cc61b9c059fd","abstract_canon_sha256":"d6ecefaf1d727f6d46744d79046b68ca9348569b6d801bdd3c6d34721ef91eb9"},"schema_version":"1.0"},"canonical_sha256":"a3509d20ad5117475c731372669d55cbf49a55d6354ee3aa1ac56b6bf1d0d12c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:39.340788Z","signature_b64":"WADqZuA5x8vg2MpbdQ00DG0dSavZpgHv6MiD9f8XqnXx7dQlIK6g9nnKlvlJTnYt6ZP5i5M9QIhC+xYLRBJnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3509d20ad5117475c731372669d55cbf49a55d6354ee3aa1ac56b6bf1d0d12c","last_reissued_at":"2026-05-18T02:04:39.340028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:39.340028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5452","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-18T02:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eiNRVxNgPjOS0QkMHUnqOLI66tcGLH7pzo9SjBBTp5qt0bBS2Fum6T9seLuJDraJqK9f3RCLbf3ewvryFPB7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:34:22.290384Z"},"content_sha256":"067ca30e27437c8e7f2f1c620c0af2d0854f2521395b0fdc66f10d7286f2b56d","schema_version":"1.0","event_id":"sha256:067ca30e27437c8e7f2f1c620c0af2d0854f2521395b0fdc66f10d7286f2b56d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UNIJ2IFNKELUOXDTCNZGNHKVZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Speed of the Consensus Algorithm with Interference and Sparse Long-Range Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Haenggi, Sundaram Vanka, Vijay Gupta","submitted_at":"2010-11-24T18:47:02Z","abstract_excerpt":"We analyze the effect of interference on the convergence rate of average consensus algorithms, which iteratively compute the measurement average by message passing among nodes. It is usually assumed that these algorithms converge faster with a greater exchange of information (i.e., by increased network connectivity) in every iteration. However, when interference is taken into account, it is no longer clear if the rate of convergence increases with network connectivity. We study this problem for randomly-placed consensus-seeking nodes connected through an interference-limited network. We invest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5452","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-18T02:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7xFqLbBMMDmH4FlBQAUPdVVHA4yYRBiNH8LEI1zkQO/owOEt3fuyda5+SbTCh5V/zVaynLqo/dzvsIFqosYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:34:22.291165Z"},"content_sha256":"cb04d55228622ab7f716ffee045c9a001f14d00e487ac9a88fa3cc7afbf3d017","schema_version":"1.0","event_id":"sha256:cb04d55228622ab7f716ffee045c9a001f14d00e487ac9a88fa3cc7afbf3d017"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNIJ2IFNKELUOXDTCNZGNHKVZP/bundle.json","state_url":"https://pith.science/pith/UNIJ2IFNKELUOXDTCNZGNHKVZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNIJ2IFNKELUOXDTCNZGNHKVZP/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-07T21:34:22Z","links":{"resolver":"https://pith.science/pith/UNIJ2IFNKELUOXDTCNZGNHKVZP","bundle":"https://pith.science/pith/UNIJ2IFNKELUOXDTCNZGNHKVZP/bundle.json","state":"https://pith.science/pith/UNIJ2IFNKELUOXDTCNZGNHKVZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNIJ2IFNKELUOXDTCNZGNHKVZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UNIJ2IFNKELUOXDTCNZGNHKVZP","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":"d6ecefaf1d727f6d46744d79046b68ca9348569b6d801bdd3c6d34721ef91eb9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-24T18:47:02Z","title_canon_sha256":"41ef90f73006ea0a9521731110d88b76a98fc95621922fa7a044cc61b9c059fd"},"schema_version":"1.0","source":{"id":"1011.5452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5452","created_at":"2026-05-18T02:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5452v1","created_at":"2026-05-18T02:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5452","created_at":"2026-05-18T02:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"UNIJ2IFNKELU","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UNIJ2IFNKELUOXDT","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UNIJ2IFN","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:cb04d55228622ab7f716ffee045c9a001f14d00e487ac9a88fa3cc7afbf3d017","target":"graph","created_at":"2026-05-18T02:04:39Z","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":"We analyze the effect of interference on the convergence rate of average consensus algorithms, which iteratively compute the measurement average by message passing among nodes. It is usually assumed that these algorithms converge faster with a greater exchange of information (i.e., by increased network connectivity) in every iteration. However, when interference is taken into account, it is no longer clear if the rate of convergence increases with network connectivity. We study this problem for randomly-placed consensus-seeking nodes connected through an interference-limited network. We invest","authors_text":"Martin Haenggi, Sundaram Vanka, Vijay Gupta","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-24T18:47:02Z","title":"Convergence Speed of the Consensus Algorithm with Interference and Sparse Long-Range Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5452","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:067ca30e27437c8e7f2f1c620c0af2d0854f2521395b0fdc66f10d7286f2b56d","target":"record","created_at":"2026-05-18T02:04:39Z","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":"d6ecefaf1d727f6d46744d79046b68ca9348569b6d801bdd3c6d34721ef91eb9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-24T18:47:02Z","title_canon_sha256":"41ef90f73006ea0a9521731110d88b76a98fc95621922fa7a044cc61b9c059fd"},"schema_version":"1.0","source":{"id":"1011.5452","kind":"arxiv","version":1}},"canonical_sha256":"a3509d20ad5117475c731372669d55cbf49a55d6354ee3aa1ac56b6bf1d0d12c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3509d20ad5117475c731372669d55cbf49a55d6354ee3aa1ac56b6bf1d0d12c","first_computed_at":"2026-05-18T02:04:39.340028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:04:39.340028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WADqZuA5x8vg2MpbdQ00DG0dSavZpgHv6MiD9f8XqnXx7dQlIK6g9nnKlvlJTnYt6ZP5i5M9QIhC+xYLRBJnBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:04:39.340788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:067ca30e27437c8e7f2f1c620c0af2d0854f2521395b0fdc66f10d7286f2b56d","sha256:cb04d55228622ab7f716ffee045c9a001f14d00e487ac9a88fa3cc7afbf3d017"],"state_sha256":"4e5bf94db7556d3748f4c0c9709cd4afe36ca5facc1e390ab245471e40a1ba4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmE2lx7FPGEnQExEVelNNp/cfZG8GaL5+m6+9HlqE7R934f1qDEHhTCKu76upzNVbCsGpvCshvIcEXIkW5KhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:34:22.295569Z","bundle_sha256":"9fa6cd9b88d203201d6c5f39e95cbfff026ef7f491fec59415dc169f9e5d2762"}}