{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LSWC43J4RYLDMPLMCO5CSD76DK","short_pith_number":"pith:LSWC43J4","canonical_record":{"source":{"id":"1512.04222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-14T09:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"f3216bc40cf0d9a850cd727f93eadfce6f09e494e4bb092b345add187ac78078","abstract_canon_sha256":"4738c291040c21d9c76adbea1938e98fa74f60e60c18805c4765498eb22f229d"},"schema_version":"1.0"},"canonical_sha256":"5cac2e6d3c8e16363d6c13ba290ffe1a9b7bf4bffb05ee8a57ea380f12708b66","source":{"kind":"arxiv","id":"1512.04222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04222","created_at":"2026-05-18T01:24:22Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04222v1","created_at":"2026-05-18T01:24:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04222","created_at":"2026-05-18T01:24:22Z"},{"alias_kind":"pith_short_12","alias_value":"LSWC43J4RYLD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSWC43J4RYLDMPLM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSWC43J4","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LSWC43J4RYLDMPLMCO5CSD76DK","target":"record","payload":{"canonical_record":{"source":{"id":"1512.04222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-14T09:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"f3216bc40cf0d9a850cd727f93eadfce6f09e494e4bb092b345add187ac78078","abstract_canon_sha256":"4738c291040c21d9c76adbea1938e98fa74f60e60c18805c4765498eb22f229d"},"schema_version":"1.0"},"canonical_sha256":"5cac2e6d3c8e16363d6c13ba290ffe1a9b7bf4bffb05ee8a57ea380f12708b66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:22.796883Z","signature_b64":"rgRPzIVEJFEyoRZPADyf7k+UYAT9Sv6lOO/ikXUnNX9z67OgfjbI/uSsY1OWtxmjf9TJbMcKl9fZkHUoaawDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cac2e6d3c8e16363d6c13ba290ffe1a9b7bf4bffb05ee8a57ea380f12708b66","last_reissued_at":"2026-05-18T01:24:22.796126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:22.796126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.04222","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-18T01:24:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bq3MJGQkoSNrb/O20u14TFthw80nb00KA3GCUq1GgO+1xn7jzJgzBPoKMIhMC5bh63kWmX9m+g5HVBvHOl/VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:48:03.964206Z"},"content_sha256":"849eb6f9aa8cee455532206d65935d75296783396c234b2d7398fad839ac6e34","schema_version":"1.0","event_id":"sha256:849eb6f9aa8cee455532206d65935d75296783396c234b2d7398fad839ac6e34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LSWC43J4RYLDMPLMCO5CSD76DK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Amortized Averaging Algorithms for Approximate Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bernadette Charron-Bost, Matthias F\\\"ugger, Thomas Nowak","submitted_at":"2015-12-14T09:16:18Z","abstract_excerpt":"We introduce a new class of distributed algorithms for the approximate consensus problem in dynamic rooted networks, which we call amortized averaging algorithms. They are deduced from ordinary averaging algorithms by adding a value-gathering phase before each value update. This allows their decision time to drop from being exponential in the number $n$ of processes to being linear under the assumption that each process knows $n$. In particular, the amortized midpoint algorithm, which achieves a linear decision time, works in completely anonymous dynamic rooted networks where processes can exc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04222","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-18T01:24:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MJH/xOI2bMxHF5xz4LJ4MFpRk1e9ebmXU9VIWnJ2UU7TPiZ/bEZE/Q1O3Ueq7Ju2nXgIQ470vTDQcbUCnhUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:48:03.965044Z"},"content_sha256":"1c9c43bc84871a955efe4187863716f0e54555fc3f523e53cea04384c34c7ac1","schema_version":"1.0","event_id":"sha256:1c9c43bc84871a955efe4187863716f0e54555fc3f523e53cea04384c34c7ac1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSWC43J4RYLDMPLMCO5CSD76DK/bundle.json","state_url":"https://pith.science/pith/LSWC43J4RYLDMPLMCO5CSD76DK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSWC43J4RYLDMPLMCO5CSD76DK/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-30T05:48:03Z","links":{"resolver":"https://pith.science/pith/LSWC43J4RYLDMPLMCO5CSD76DK","bundle":"https://pith.science/pith/LSWC43J4RYLDMPLMCO5CSD76DK/bundle.json","state":"https://pith.science/pith/LSWC43J4RYLDMPLMCO5CSD76DK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSWC43J4RYLDMPLMCO5CSD76DK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LSWC43J4RYLDMPLMCO5CSD76DK","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":"4738c291040c21d9c76adbea1938e98fa74f60e60c18805c4765498eb22f229d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-14T09:16:18Z","title_canon_sha256":"f3216bc40cf0d9a850cd727f93eadfce6f09e494e4bb092b345add187ac78078"},"schema_version":"1.0","source":{"id":"1512.04222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04222","created_at":"2026-05-18T01:24:22Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04222v1","created_at":"2026-05-18T01:24:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04222","created_at":"2026-05-18T01:24:22Z"},{"alias_kind":"pith_short_12","alias_value":"LSWC43J4RYLD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSWC43J4RYLDMPLM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSWC43J4","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:1c9c43bc84871a955efe4187863716f0e54555fc3f523e53cea04384c34c7ac1","target":"graph","created_at":"2026-05-18T01:24:22Z","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 introduce a new class of distributed algorithms for the approximate consensus problem in dynamic rooted networks, which we call amortized averaging algorithms. They are deduced from ordinary averaging algorithms by adding a value-gathering phase before each value update. This allows their decision time to drop from being exponential in the number $n$ of processes to being linear under the assumption that each process knows $n$. In particular, the amortized midpoint algorithm, which achieves a linear decision time, works in completely anonymous dynamic rooted networks where processes can exc","authors_text":"Bernadette Charron-Bost, Matthias F\\\"ugger, Thomas Nowak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-14T09:16:18Z","title":"Amortized Averaging Algorithms for Approximate Consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04222","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:849eb6f9aa8cee455532206d65935d75296783396c234b2d7398fad839ac6e34","target":"record","created_at":"2026-05-18T01:24:22Z","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":"4738c291040c21d9c76adbea1938e98fa74f60e60c18805c4765498eb22f229d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-14T09:16:18Z","title_canon_sha256":"f3216bc40cf0d9a850cd727f93eadfce6f09e494e4bb092b345add187ac78078"},"schema_version":"1.0","source":{"id":"1512.04222","kind":"arxiv","version":1}},"canonical_sha256":"5cac2e6d3c8e16363d6c13ba290ffe1a9b7bf4bffb05ee8a57ea380f12708b66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cac2e6d3c8e16363d6c13ba290ffe1a9b7bf4bffb05ee8a57ea380f12708b66","first_computed_at":"2026-05-18T01:24:22.796126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:22.796126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rgRPzIVEJFEyoRZPADyf7k+UYAT9Sv6lOO/ikXUnNX9z67OgfjbI/uSsY1OWtxmjf9TJbMcKl9fZkHUoaawDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:22.796883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:849eb6f9aa8cee455532206d65935d75296783396c234b2d7398fad839ac6e34","sha256:1c9c43bc84871a955efe4187863716f0e54555fc3f523e53cea04384c34c7ac1"],"state_sha256":"8db96aecc1e4f7f0a26d3f3fd38a32487406c7c63185cae200ae52d04fc427b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/NEGJsceiDq7Tv3NlYhwCt4LczRimwcY5ZEuJkCpFvn6In4EFzweNPdX18SCAjJZan0Kct3ofRM14RNIKfrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:48:03.968949Z","bundle_sha256":"40301685564663660806de1916360e042d8b6526810b12ee04ebbd8b960ce214"}}