{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZX67QHNPIBK32UDXDQQ3DMNYYH","short_pith_number":"pith:ZX67QHNP","canonical_record":{"source":{"id":"1309.7264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-27T15:08:16Z","cross_cats_sorted":[],"title_canon_sha256":"f843c828a5ea6be42d061f273cf46a18f5aae46b47a1855b16b34aeaf432815f","abstract_canon_sha256":"ca4c1fe3e060fbd0fb44627fd13cee36f0f3aa2024077552b903de4e2586192e"},"schema_version":"1.0"},"canonical_sha256":"cdfdf81daf4055bd50771c21b1b1b8c1df40356af0986258c1de0a07892bf783","source":{"kind":"arxiv","id":"1309.7264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7264","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7264v1","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7264","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZX67QHNPIBK3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZX67QHNPIBK32UDX","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZX67QHNP","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZX67QHNPIBK32UDXDQQ3DMNYYH","target":"record","payload":{"canonical_record":{"source":{"id":"1309.7264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-27T15:08:16Z","cross_cats_sorted":[],"title_canon_sha256":"f843c828a5ea6be42d061f273cf46a18f5aae46b47a1855b16b34aeaf432815f","abstract_canon_sha256":"ca4c1fe3e060fbd0fb44627fd13cee36f0f3aa2024077552b903de4e2586192e"},"schema_version":"1.0"},"canonical_sha256":"cdfdf81daf4055bd50771c21b1b1b8c1df40356af0986258c1de0a07892bf783","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:59.720284Z","signature_b64":"zIdQJG+J/pElpddrJtNzjd8JfkOfpXKItgtIgafuAsNxik54a3Uc8qzygeSgLj1EVi/am++cAIaWJws1FOvqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdfdf81daf4055bd50771c21b1b1b8c1df40356af0986258c1de0a07892bf783","last_reissued_at":"2026-05-18T03:11:59.719458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:59.719458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.7264","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-18T03:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdTsaX5EeoS5Nvinr42NeEvwggfYXTw5Q1ZJz1xEWUhuQntz4TA/OXcsVBE1ozaNzjpMXwJQSF8e2swO/77+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:19:04.355264Z"},"content_sha256":"4924d75c143698a29f8da97b878dd07481baf47d9b48dd1be3885b70407907a8","schema_version":"1.0","event_id":"sha256:4924d75c143698a29f8da97b878dd07481baf47d9b48dd1be3885b70407907a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZX67QHNPIBK32UDXDQQ3DMNYYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Consensus in Distributed Networks using Total Variation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J\\'er\\'emie Jakubowicz, Pascal Bianchi, Walid Ben-Ameur","submitted_at":"2013-09-27T15:08:16Z","abstract_excerpt":"Consider a connected network of agents endowed with local cost functions representing private objectives. Agents seek to find an agreement on some minimizer of the aggregate cost, by means of repeated communications between neighbors. Consensus on the average over the network, usually addressed by gossip algorithms, is a special instance of this problem, corresponding to quadratic private objectives. Consensus on the median, or more generally quantiles, is also a special instance, as many more consensus problems. In this paper we show that optimizing the aggregate cost function regularized by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7264","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-18T03:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KWYQR2V7sSDkOvg4G8dsuDEMJa5jZfgB+a/wH2ewjs4YikwwrFmnWtqae0ehhRFkpqvoLAon3fCfUH/p3dkEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:19:04.355889Z"},"content_sha256":"92250aa5acccca198ce7fbca599efd362a545ea9a3840972a6a171ca3b64e1c5","schema_version":"1.0","event_id":"sha256:92250aa5acccca198ce7fbca599efd362a545ea9a3840972a6a171ca3b64e1c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZX67QHNPIBK32UDXDQQ3DMNYYH/bundle.json","state_url":"https://pith.science/pith/ZX67QHNPIBK32UDXDQQ3DMNYYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZX67QHNPIBK32UDXDQQ3DMNYYH/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-27T11:19:04Z","links":{"resolver":"https://pith.science/pith/ZX67QHNPIBK32UDXDQQ3DMNYYH","bundle":"https://pith.science/pith/ZX67QHNPIBK32UDXDQQ3DMNYYH/bundle.json","state":"https://pith.science/pith/ZX67QHNPIBK32UDXDQQ3DMNYYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZX67QHNPIBK32UDXDQQ3DMNYYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZX67QHNPIBK32UDXDQQ3DMNYYH","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":"ca4c1fe3e060fbd0fb44627fd13cee36f0f3aa2024077552b903de4e2586192e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-27T15:08:16Z","title_canon_sha256":"f843c828a5ea6be42d061f273cf46a18f5aae46b47a1855b16b34aeaf432815f"},"schema_version":"1.0","source":{"id":"1309.7264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7264","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7264v1","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7264","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZX67QHNPIBK3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZX67QHNPIBK32UDX","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZX67QHNP","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:92250aa5acccca198ce7fbca599efd362a545ea9a3840972a6a171ca3b64e1c5","target":"graph","created_at":"2026-05-18T03:11:59Z","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":"Consider a connected network of agents endowed with local cost functions representing private objectives. Agents seek to find an agreement on some minimizer of the aggregate cost, by means of repeated communications between neighbors. Consensus on the average over the network, usually addressed by gossip algorithms, is a special instance of this problem, corresponding to quadratic private objectives. Consensus on the median, or more generally quantiles, is also a special instance, as many more consensus problems. In this paper we show that optimizing the aggregate cost function regularized by ","authors_text":"J\\'er\\'emie Jakubowicz, Pascal Bianchi, Walid Ben-Ameur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-27T15:08:16Z","title":"Robust Consensus in Distributed Networks using Total Variation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7264","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:4924d75c143698a29f8da97b878dd07481baf47d9b48dd1be3885b70407907a8","target":"record","created_at":"2026-05-18T03:11:59Z","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":"ca4c1fe3e060fbd0fb44627fd13cee36f0f3aa2024077552b903de4e2586192e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-27T15:08:16Z","title_canon_sha256":"f843c828a5ea6be42d061f273cf46a18f5aae46b47a1855b16b34aeaf432815f"},"schema_version":"1.0","source":{"id":"1309.7264","kind":"arxiv","version":1}},"canonical_sha256":"cdfdf81daf4055bd50771c21b1b1b8c1df40356af0986258c1de0a07892bf783","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdfdf81daf4055bd50771c21b1b1b8c1df40356af0986258c1de0a07892bf783","first_computed_at":"2026-05-18T03:11:59.719458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:59.719458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zIdQJG+J/pElpddrJtNzjd8JfkOfpXKItgtIgafuAsNxik54a3Uc8qzygeSgLj1EVi/am++cAIaWJws1FOvqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:59.720284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4924d75c143698a29f8da97b878dd07481baf47d9b48dd1be3885b70407907a8","sha256:92250aa5acccca198ce7fbca599efd362a545ea9a3840972a6a171ca3b64e1c5"],"state_sha256":"1cc3fd7a7a54548c905dc9fce2551ff2ba048602c76437c149033b325dbb2ab8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OEMykvtGk8nWhQzNgaTvX/x+7wMCksQ03feWlYm6Hg/MQpkiX40aP2MJyWLJbUKXs08GrQIcXI34jYo3j/yQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:19:04.361042Z","bundle_sha256":"b492406750650f8456537cafaed195953abd5f932cf5b98f5b08c1c361002f13"}}