{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UZK7YUNSZKD3MUBIIQ57VEL274","short_pith_number":"pith:UZK7YUNS","canonical_record":{"source":{"id":"1504.01438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-06T23:28:08Z","cross_cats_sorted":["cs.DC","cs.MA","math.OC","math.PR"],"title_canon_sha256":"28a960abc0bf9bc30beb92fec32799152a63598448013984987a463fd362f789","abstract_canon_sha256":"89d890f93abcc0470e2ce53c301d73ed0855ac3278f902a053530f81186ddb45"},"schema_version":"1.0"},"canonical_sha256":"a655fc51b2ca87b65028443bfa917aff3d893a7fee7043f4bf04201272a0d9c4","source":{"kind":"arxiv","id":"1504.01438","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01438","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01438v2","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01438","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"UZK7YUNSZKD3","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UZK7YUNSZKD3MUBI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UZK7YUNS","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UZK7YUNSZKD3MUBIIQ57VEL274","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-06T23:28:08Z","cross_cats_sorted":["cs.DC","cs.MA","math.OC","math.PR"],"title_canon_sha256":"28a960abc0bf9bc30beb92fec32799152a63598448013984987a463fd362f789","abstract_canon_sha256":"89d890f93abcc0470e2ce53c301d73ed0855ac3278f902a053530f81186ddb45"},"schema_version":"1.0"},"canonical_sha256":"a655fc51b2ca87b65028443bfa917aff3d893a7fee7043f4bf04201272a0d9c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:23.655633Z","signature_b64":"G1POxUhD+mqpjTrLKpqyj8+fldKxdkvDYdqGqVpCFl18SDN1zdvePIrHh3R6brPuI0RBH+eUYk80AaVJ8lHUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a655fc51b2ca87b65028443bfa917aff3d893a7fee7043f4bf04201272a0d9c4","last_reissued_at":"2026-05-18T01:21:23.654987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:23.654987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01438","source_version":2,"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-18T01:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUZb0Pl5zPl6x8RbfxAh+BR2Ln+7fhBJDTyQKe4sSkEBytNpPXK/h2AUBdwr7mrjSH2/gY623bFaZkFyUGB4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:34:11.439845Z"},"content_sha256":"06c09623081f453a1d72ebf704a03a33d0f8a811bbc51eb17c7743802d262d9e","schema_version":"1.0","event_id":"sha256:06c09623081f453a1d72ebf704a03a33d0f8a811bbc51eb17c7743802d262d9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UZK7YUNSZKD3MUBIIQ57VEL274","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","math.OC","math.PR"],"primary_cat":"cs.SY","authors_text":"Alex Olshevsky, Seyed Rasoul Etesami, Tamer Basar","submitted_at":"2015-04-06T23:28:08Z","abstract_excerpt":"We consider the quantized consensus problem on undirected time-varying connected graphs with n nodes, and devise a protocol with fast convergence time to the set of consensus points. Specifically, we show that when the edges of each network in a sequence of connected time-varying networks are activated based on Poisson processes with Metropolis rates, the expected convergence time to the set of consensus points is at most O(n^2 log^2 n), where each node performs a constant number of updates per unit time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01438","kind":"arxiv","version":2},"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-18T01:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0yd0yH4fy5vGy4qbTdOjfB8XUsWrqT9rZJch2iWKMJJZYkmCOEFD1CeHxpp96WazigAoSrh5eoAAUmletHZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:34:11.440326Z"},"content_sha256":"48d47d2e9568e28e76da38e87146f2295a8d04b574582ae15835998c69d78bd3","schema_version":"1.0","event_id":"sha256:48d47d2e9568e28e76da38e87146f2295a8d04b574582ae15835998c69d78bd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZK7YUNSZKD3MUBIIQ57VEL274/bundle.json","state_url":"https://pith.science/pith/UZK7YUNSZKD3MUBIIQ57VEL274/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZK7YUNSZKD3MUBIIQ57VEL274/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-05-31T16:34:11Z","links":{"resolver":"https://pith.science/pith/UZK7YUNSZKD3MUBIIQ57VEL274","bundle":"https://pith.science/pith/UZK7YUNSZKD3MUBIIQ57VEL274/bundle.json","state":"https://pith.science/pith/UZK7YUNSZKD3MUBIIQ57VEL274/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZK7YUNSZKD3MUBIIQ57VEL274/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UZK7YUNSZKD3MUBIIQ57VEL274","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":"89d890f93abcc0470e2ce53c301d73ed0855ac3278f902a053530f81186ddb45","cross_cats_sorted":["cs.DC","cs.MA","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-06T23:28:08Z","title_canon_sha256":"28a960abc0bf9bc30beb92fec32799152a63598448013984987a463fd362f789"},"schema_version":"1.0","source":{"id":"1504.01438","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01438","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01438v2","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01438","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"UZK7YUNSZKD3","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UZK7YUNSZKD3MUBI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UZK7YUNS","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:48d47d2e9568e28e76da38e87146f2295a8d04b574582ae15835998c69d78bd3","target":"graph","created_at":"2026-05-18T01:21:23Z","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 consider the quantized consensus problem on undirected time-varying connected graphs with n nodes, and devise a protocol with fast convergence time to the set of consensus points. Specifically, we show that when the edges of each network in a sequence of connected time-varying networks are activated based on Poisson processes with Metropolis rates, the expected convergence time to the set of consensus points is at most O(n^2 log^2 n), where each node performs a constant number of updates per unit time.","authors_text":"Alex Olshevsky, Seyed Rasoul Etesami, Tamer Basar","cross_cats":["cs.DC","cs.MA","math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-06T23:28:08Z","title":"Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01438","kind":"arxiv","version":2},"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:06c09623081f453a1d72ebf704a03a33d0f8a811bbc51eb17c7743802d262d9e","target":"record","created_at":"2026-05-18T01:21:23Z","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":"89d890f93abcc0470e2ce53c301d73ed0855ac3278f902a053530f81186ddb45","cross_cats_sorted":["cs.DC","cs.MA","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-06T23:28:08Z","title_canon_sha256":"28a960abc0bf9bc30beb92fec32799152a63598448013984987a463fd362f789"},"schema_version":"1.0","source":{"id":"1504.01438","kind":"arxiv","version":2}},"canonical_sha256":"a655fc51b2ca87b65028443bfa917aff3d893a7fee7043f4bf04201272a0d9c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a655fc51b2ca87b65028443bfa917aff3d893a7fee7043f4bf04201272a0d9c4","first_computed_at":"2026-05-18T01:21:23.654987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:23.654987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G1POxUhD+mqpjTrLKpqyj8+fldKxdkvDYdqGqVpCFl18SDN1zdvePIrHh3R6brPuI0RBH+eUYk80AaVJ8lHUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:23.655633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01438","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06c09623081f453a1d72ebf704a03a33d0f8a811bbc51eb17c7743802d262d9e","sha256:48d47d2e9568e28e76da38e87146f2295a8d04b574582ae15835998c69d78bd3"],"state_sha256":"a127902d5686b46a775fa5812615042d444d89d7ee21a8cd01dfd075c9b4e8e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ahO5F9tNt4Yd2/OTxyTeHURAZQfCvj2Yz7IQ7mS2f4Br9oHumJCe+36bE18p2RwSfnAh7CUauiuYnzpugChZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:34:11.443385Z","bundle_sha256":"72ee09a5e32acdc87d2c1c1a74311f9cee5c64133af6ede3b12b70ad2bbe0249"}}