{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YT4NMLHNO6FI2W3LIFX6ZNZQEX","short_pith_number":"pith:YT4NMLHN","canonical_record":{"source":{"id":"1302.5371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-21T18:42:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ea5abedd797459bbe4dc2faec036a8fe2fce968af49bebdc082b388f02e48700","abstract_canon_sha256":"5c726a3e93767c81124654dd3582bb32c2e59da11e6cf15bed7fa89f3a3b91d0"},"schema_version":"1.0"},"canonical_sha256":"c4f8d62ced778a8d5b6b416fecb73025ea9ad9fdf61399c029005dc5fdfced20","source":{"kind":"arxiv","id":"1302.5371","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5371","created_at":"2026-05-18T01:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5371v1","created_at":"2026-05-18T01:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5371","created_at":"2026-05-18T01:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"YT4NMLHNO6FI","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YT4NMLHNO6FI2W3L","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YT4NMLHN","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YT4NMLHNO6FI2W3LIFX6ZNZQEX","target":"record","payload":{"canonical_record":{"source":{"id":"1302.5371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-21T18:42:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ea5abedd797459bbe4dc2faec036a8fe2fce968af49bebdc082b388f02e48700","abstract_canon_sha256":"5c726a3e93767c81124654dd3582bb32c2e59da11e6cf15bed7fa89f3a3b91d0"},"schema_version":"1.0"},"canonical_sha256":"c4f8d62ced778a8d5b6b416fecb73025ea9ad9fdf61399c029005dc5fdfced20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:51:34.387870Z","signature_b64":"CKIuuGtF+sZUfxD94kGp2di0YywvRd6/c2KiTO2X7RZxTjpCZG1BuSwZRlH23RaEgNHsPoxJm1L6rsfYpPARAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4f8d62ced778a8d5b6b416fecb73025ea9ad9fdf61399c029005dc5fdfced20","last_reissued_at":"2026-05-18T01:51:34.387274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:51:34.387274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.5371","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:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RStbzRUv+yAIy0pTCbSqC9REvm3Xrg77qKwRifnOcjwmEIPAyNUX0KEHlf9fXz5GyS8bH3bvlvv+NC1vJJSsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:20:29.774560Z"},"content_sha256":"cf7e98777e530533ad301f86ec9c6a5282982841a907a9712b42bb805865e105","schema_version":"1.0","event_id":"sha256:cf7e98777e530533ad301f86ec9c6a5282982841a907a9712b42bb805865e105"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YT4NMLHNO6FI2W3LIFX6ZNZQEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Linear Distributed Average Consensus using Bounded Transmissions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Andreas Spanias, Cihan Tepedelenlioglu, Mahesh Banavar, Sivaraman Dasarathan","submitted_at":"2013-02-21T18:42:51Z","abstract_excerpt":"A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable whose expectation is the desired sample average of the initial observations with a variance that depends on the step size of the algorithm and the variance of the communication noise. The asymptotic performance is characterized by deriving the asymptotic covariance matrix using results from stochastic approximation theory. It is shown that using bounded transmi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5371","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:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p6CBoCo5+jy9L4PRu9hNAM2EAyWAyHcWs27seknCtbURZBq3XgBWpULsk8HKAEfOhw2mCPWyoUb0oCJUIAHUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:20:29.775283Z"},"content_sha256":"3d9f6f1faf6cbcc33fb500629afc288f7a43b8a1b24666f29cf8ab79a6fe7f6d","schema_version":"1.0","event_id":"sha256:3d9f6f1faf6cbcc33fb500629afc288f7a43b8a1b24666f29cf8ab79a6fe7f6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YT4NMLHNO6FI2W3LIFX6ZNZQEX/bundle.json","state_url":"https://pith.science/pith/YT4NMLHNO6FI2W3LIFX6ZNZQEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YT4NMLHNO6FI2W3LIFX6ZNZQEX/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-09T17:20:29Z","links":{"resolver":"https://pith.science/pith/YT4NMLHNO6FI2W3LIFX6ZNZQEX","bundle":"https://pith.science/pith/YT4NMLHNO6FI2W3LIFX6ZNZQEX/bundle.json","state":"https://pith.science/pith/YT4NMLHNO6FI2W3LIFX6ZNZQEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YT4NMLHNO6FI2W3LIFX6ZNZQEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YT4NMLHNO6FI2W3LIFX6ZNZQEX","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":"5c726a3e93767c81124654dd3582bb32c2e59da11e6cf15bed7fa89f3a3b91d0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-21T18:42:51Z","title_canon_sha256":"ea5abedd797459bbe4dc2faec036a8fe2fce968af49bebdc082b388f02e48700"},"schema_version":"1.0","source":{"id":"1302.5371","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5371","created_at":"2026-05-18T01:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5371v1","created_at":"2026-05-18T01:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5371","created_at":"2026-05-18T01:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"YT4NMLHNO6FI","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YT4NMLHNO6FI2W3L","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YT4NMLHN","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:3d9f6f1faf6cbcc33fb500629afc288f7a43b8a1b24666f29cf8ab79a6fe7f6d","target":"graph","created_at":"2026-05-18T01:51:34Z","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":"A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable whose expectation is the desired sample average of the initial observations with a variance that depends on the step size of the algorithm and the variance of the communication noise. The asymptotic performance is characterized by deriving the asymptotic covariance matrix using results from stochastic approximation theory. It is shown that using bounded transmi","authors_text":"Andreas Spanias, Cihan Tepedelenlioglu, Mahesh Banavar, Sivaraman Dasarathan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-21T18:42:51Z","title":"Non-Linear Distributed Average Consensus using Bounded Transmissions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5371","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:cf7e98777e530533ad301f86ec9c6a5282982841a907a9712b42bb805865e105","target":"record","created_at":"2026-05-18T01:51:34Z","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":"5c726a3e93767c81124654dd3582bb32c2e59da11e6cf15bed7fa89f3a3b91d0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-21T18:42:51Z","title_canon_sha256":"ea5abedd797459bbe4dc2faec036a8fe2fce968af49bebdc082b388f02e48700"},"schema_version":"1.0","source":{"id":"1302.5371","kind":"arxiv","version":1}},"canonical_sha256":"c4f8d62ced778a8d5b6b416fecb73025ea9ad9fdf61399c029005dc5fdfced20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4f8d62ced778a8d5b6b416fecb73025ea9ad9fdf61399c029005dc5fdfced20","first_computed_at":"2026-05-18T01:51:34.387274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:51:34.387274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CKIuuGtF+sZUfxD94kGp2di0YywvRd6/c2KiTO2X7RZxTjpCZG1BuSwZRlH23RaEgNHsPoxJm1L6rsfYpPARAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:51:34.387870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5371","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf7e98777e530533ad301f86ec9c6a5282982841a907a9712b42bb805865e105","sha256:3d9f6f1faf6cbcc33fb500629afc288f7a43b8a1b24666f29cf8ab79a6fe7f6d"],"state_sha256":"c86705778e537f9cad4228daf062c3366dc360935b232d5783e1816aee5ee669"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S5sR47cXwMGdMmO+k03wa4awSetyIbIlFOxtEaWWePjXZI1LIl35G+ZnEqbjlyZ4qRjcZJ5o2HltJApohkx+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:20:29.779426Z","bundle_sha256":"acfc8cec12b5051d5e666cca4c2088911333af9848b912ea077ccd200278cbd9"}}