{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I672OJDCSC65LYQ6QQZCAXDWQT","short_pith_number":"pith:I672OJDC","canonical_record":{"source":{"id":"1409.6828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-24T05:03:58Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"db35876e48585f022a86846f3b368048ad49a97363889ed299fd8ca1cceb187b","abstract_canon_sha256":"21ccf160af69868310ab37290084cb24eb9c84c30da4a14c93be5c096a896300"},"schema_version":"1.0"},"canonical_sha256":"47bfa7246290bdd5e21e8432205c7684cb6e67a81c92d96887b9f370c6d380c1","source":{"kind":"arxiv","id":"1409.6828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6828","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6828v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6828","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"I672OJDCSC65","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I672OJDCSC65LYQ6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I672OJDC","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I672OJDCSC65LYQ6QQZCAXDWQT","target":"record","payload":{"canonical_record":{"source":{"id":"1409.6828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-24T05:03:58Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"db35876e48585f022a86846f3b368048ad49a97363889ed299fd8ca1cceb187b","abstract_canon_sha256":"21ccf160af69868310ab37290084cb24eb9c84c30da4a14c93be5c096a896300"},"schema_version":"1.0"},"canonical_sha256":"47bfa7246290bdd5e21e8432205c7684cb6e67a81c92d96887b9f370c6d380c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.451527Z","signature_b64":"eM82JfiHYRvDDPjPnDcz7Rxf8RI4xMyHj+OufJf6O8eRdzixpZ2EuMdxecGaoxeq4OX3eRqKQakdBja0MioHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47bfa7246290bdd5e21e8432205c7684cb6e67a81c92d96887b9f370c6d380c1","last_reissued_at":"2026-05-18T00:57:51.450987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.450987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.6828","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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvJnZkrkJOesJYnJdOW7dlrETbKrw9I5MBE2Mrzu9dv3qcVC9bHEy647xe8NjkWj6lV7OFNbDdpCVKj241SKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:32:26.808304Z"},"content_sha256":"e720dd8b85a4f9b86e352193d72f752ba6767e3d62691c20a5cb51b58d2ebb65","schema_version":"1.0","event_id":"sha256:e720dd8b85a4f9b86e352193d72f752ba6767e3d62691c20a5cb51b58d2ebb65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I672OJDCSC65LYQ6QQZCAXDWQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SY","authors_text":"Pan Hui, Paul Cuff, Sanjeev Kulkarni, Shang Shang","submitted_at":"2014-09-24T05:03:58Z","abstract_excerpt":"We analyze a class of distributed quantized consensus algorithms for arbitrary static networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network, and then update their estimation by communicating with their neighbors in a limited capacity channel in an asynchronous clock setting. Eventually, all nodes reach consensus with quantized precision. We analyze the expected convergence time for the general quantized consensus algorithm proposed by Kashyap et al \\cite{Kashyap}. We use the theory of electric net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6828","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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2T/3V8BvbLo91IODehJYIxCTgHllOcLWQ9a5/OoQOKXbQSaMgRHOQwbWSFyxU4Pq1neaI9+AUeXZNsOyRiXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:32:26.808789Z"},"content_sha256":"02819d42c804222b0a3ff11dd1216959a421e83a6e900ebd521bbd39d56642c4","schema_version":"1.0","event_id":"sha256:02819d42c804222b0a3ff11dd1216959a421e83a6e900ebd521bbd39d56642c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I672OJDCSC65LYQ6QQZCAXDWQT/bundle.json","state_url":"https://pith.science/pith/I672OJDCSC65LYQ6QQZCAXDWQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I672OJDCSC65LYQ6QQZCAXDWQT/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-04T20:32:26Z","links":{"resolver":"https://pith.science/pith/I672OJDCSC65LYQ6QQZCAXDWQT","bundle":"https://pith.science/pith/I672OJDCSC65LYQ6QQZCAXDWQT/bundle.json","state":"https://pith.science/pith/I672OJDCSC65LYQ6QQZCAXDWQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I672OJDCSC65LYQ6QQZCAXDWQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I672OJDCSC65LYQ6QQZCAXDWQT","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":"21ccf160af69868310ab37290084cb24eb9c84c30da4a14c93be5c096a896300","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-24T05:03:58Z","title_canon_sha256":"db35876e48585f022a86846f3b368048ad49a97363889ed299fd8ca1cceb187b"},"schema_version":"1.0","source":{"id":"1409.6828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6828","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6828v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6828","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"I672OJDCSC65","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I672OJDCSC65LYQ6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I672OJDC","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:02819d42c804222b0a3ff11dd1216959a421e83a6e900ebd521bbd39d56642c4","target":"graph","created_at":"2026-05-18T00:57:51Z","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 a class of distributed quantized consensus algorithms for arbitrary static networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network, and then update their estimation by communicating with their neighbors in a limited capacity channel in an asynchronous clock setting. Eventually, all nodes reach consensus with quantized precision. We analyze the expected convergence time for the general quantized consensus algorithm proposed by Kashyap et al \\cite{Kashyap}. We use the theory of electric net","authors_text":"Pan Hui, Paul Cuff, Sanjeev Kulkarni, Shang Shang","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-24T05:03:58Z","title":"An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6828","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:e720dd8b85a4f9b86e352193d72f752ba6767e3d62691c20a5cb51b58d2ebb65","target":"record","created_at":"2026-05-18T00:57:51Z","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":"21ccf160af69868310ab37290084cb24eb9c84c30da4a14c93be5c096a896300","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-24T05:03:58Z","title_canon_sha256":"db35876e48585f022a86846f3b368048ad49a97363889ed299fd8ca1cceb187b"},"schema_version":"1.0","source":{"id":"1409.6828","kind":"arxiv","version":1}},"canonical_sha256":"47bfa7246290bdd5e21e8432205c7684cb6e67a81c92d96887b9f370c6d380c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47bfa7246290bdd5e21e8432205c7684cb6e67a81c92d96887b9f370c6d380c1","first_computed_at":"2026-05-18T00:57:51.450987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:51.450987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eM82JfiHYRvDDPjPnDcz7Rxf8RI4xMyHj+OufJf6O8eRdzixpZ2EuMdxecGaoxeq4OX3eRqKQakdBja0MioHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:51.451527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e720dd8b85a4f9b86e352193d72f752ba6767e3d62691c20a5cb51b58d2ebb65","sha256:02819d42c804222b0a3ff11dd1216959a421e83a6e900ebd521bbd39d56642c4"],"state_sha256":"9a74c920f29c9b40eb579095a6576af6d4c0c03e41b8ea6b93349a6fd5732188"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Lbif+xVnVDsrcEbZbx4k6etCO5/SxXfk7Rg9Vhj8PvIxIOW8LGYIQZbSJutZYPZ5b8OnWw5v9qizFKhminIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:32:26.810740Z","bundle_sha256":"8f4ddcc7d95269f849081b8c822e9b485e3b5a65e5da6afa247b983e433c3d23"}}