{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JQRLRUCV6WPN3TWPXIBN3F7W4O","short_pith_number":"pith:JQRLRUCV","canonical_record":{"source":{"id":"2404.07018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-10T14:09:46Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"2650a646af554cdce3d0fdae82d64418d5d95078478523e3bd255ee52663dab2","abstract_canon_sha256":"a5582a8d548dc0a0e1ecd9898d25474eed5d76c8a30f2c11de0ec18fc0952530"},"schema_version":"1.0"},"canonical_sha256":"4c22b8d055f59eddcecfba02dd97f6e3a38f3d11a9bda89b898cf61e31e4b5db","source":{"kind":"arxiv","id":"2404.07018","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.07018","created_at":"2026-07-05T08:28:09Z"},{"alias_kind":"arxiv_version","alias_value":"2404.07018v2","created_at":"2026-07-05T08:28:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07018","created_at":"2026-07-05T08:28:09Z"},{"alias_kind":"pith_short_12","alias_value":"JQRLRUCV6WPN","created_at":"2026-07-05T08:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"JQRLRUCV6WPN3TWP","created_at":"2026-07-05T08:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"JQRLRUCV","created_at":"2026-07-05T08:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JQRLRUCV6WPN3TWPXIBN3F7W4O","target":"record","payload":{"canonical_record":{"source":{"id":"2404.07018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-10T14:09:46Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"2650a646af554cdce3d0fdae82d64418d5d95078478523e3bd255ee52663dab2","abstract_canon_sha256":"a5582a8d548dc0a0e1ecd9898d25474eed5d76c8a30f2c11de0ec18fc0952530"},"schema_version":"1.0"},"canonical_sha256":"4c22b8d055f59eddcecfba02dd97f6e3a38f3d11a9bda89b898cf61e31e4b5db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:09.251412Z","signature_b64":"MkOg5itdwplullDhIkMMj7t5/W4+ynPeOnevYeUFSXgr/IueenapD1nCLjx9naD9AnHpxuZr1S7b1qj7YBbKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c22b8d055f59eddcecfba02dd97f6e3a38f3d11a9bda89b898cf61e31e4b5db","last_reissued_at":"2026-07-05T08:28:09.250970Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:09.250970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.07018","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-07-05T08:28:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LUOztXLbB2sb4JY2ks/nKxLLPvZ18/eTW0Ip9zXdAI/hOztdY7pGLaDh0swPsdF86kdiXykebiJA83ZFDl5jBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:12:24.985290Z"},"content_sha256":"002b594f91fe8c6c53af5312c4186f1a7bc6937a98d09823ba8e46580c9e7b68","schema_version":"1.0","event_id":"sha256:002b594f91fe8c6c53af5312c4186f1a7bc6937a98d09823ba8e46580c9e7b68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JQRLRUCV6WPN3TWPXIBN3F7W4O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learned Finite-Time Consensus for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"math.OC","authors_text":"Aaron Fainman, Stefan Vlaski","submitted_at":"2024-04-10T14:09:46Z","abstract_excerpt":"Most algorithms for decentralized learning employ a consensus or diffusion mechanism to drive agents to a common solution of a global optimization problem. Generally this takes the form of linear averaging, at a rate of contraction determined by the mixing rate of the underlying network topology. For very sparse graphs this can yield a bottleneck, slowing down the convergence of the learning algorithm. We show that a sequence of matrices achieving finite-time consensus can be learned for unknown graph topologies in a decentralized manner by solving a constrained matrix factorization problem. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07018","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.07018/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:28:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lt7TtyCKpTWiBQ9mmzy016eRWpWQc4Y7SRuGKnLCxTxy46KpJ63k8x0vmcW6fR9ZG+LuaU5eFmpmxbp7n6osCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:12:24.985791Z"},"content_sha256":"cd709c23d964f7901bf3704e320f0712ed0d0f0a16bf8418f9b56a5b797ec157","schema_version":"1.0","event_id":"sha256:cd709c23d964f7901bf3704e320f0712ed0d0f0a16bf8418f9b56a5b797ec157"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQRLRUCV6WPN3TWPXIBN3F7W4O/bundle.json","state_url":"https://pith.science/pith/JQRLRUCV6WPN3TWPXIBN3F7W4O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQRLRUCV6WPN3TWPXIBN3F7W4O/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-08-10T03:12:24Z","links":{"resolver":"https://pith.science/pith/JQRLRUCV6WPN3TWPXIBN3F7W4O","bundle":"https://pith.science/pith/JQRLRUCV6WPN3TWPXIBN3F7W4O/bundle.json","state":"https://pith.science/pith/JQRLRUCV6WPN3TWPXIBN3F7W4O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQRLRUCV6WPN3TWPXIBN3F7W4O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JQRLRUCV6WPN3TWPXIBN3F7W4O","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":"a5582a8d548dc0a0e1ecd9898d25474eed5d76c8a30f2c11de0ec18fc0952530","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-10T14:09:46Z","title_canon_sha256":"2650a646af554cdce3d0fdae82d64418d5d95078478523e3bd255ee52663dab2"},"schema_version":"1.0","source":{"id":"2404.07018","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.07018","created_at":"2026-07-05T08:28:09Z"},{"alias_kind":"arxiv_version","alias_value":"2404.07018v2","created_at":"2026-07-05T08:28:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07018","created_at":"2026-07-05T08:28:09Z"},{"alias_kind":"pith_short_12","alias_value":"JQRLRUCV6WPN","created_at":"2026-07-05T08:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"JQRLRUCV6WPN3TWP","created_at":"2026-07-05T08:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"JQRLRUCV","created_at":"2026-07-05T08:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:cd709c23d964f7901bf3704e320f0712ed0d0f0a16bf8418f9b56a5b797ec157","target":"graph","created_at":"2026-07-05T08:28:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.07018/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most algorithms for decentralized learning employ a consensus or diffusion mechanism to drive agents to a common solution of a global optimization problem. Generally this takes the form of linear averaging, at a rate of contraction determined by the mixing rate of the underlying network topology. For very sparse graphs this can yield a bottleneck, slowing down the convergence of the learning algorithm. We show that a sequence of matrices achieving finite-time consensus can be learned for unknown graph topologies in a decentralized manner by solving a constrained matrix factorization problem. W","authors_text":"Aaron Fainman, Stefan Vlaski","cross_cats":["eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-10T14:09:46Z","title":"Learned Finite-Time Consensus for Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07018","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:002b594f91fe8c6c53af5312c4186f1a7bc6937a98d09823ba8e46580c9e7b68","target":"record","created_at":"2026-07-05T08:28:09Z","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":"a5582a8d548dc0a0e1ecd9898d25474eed5d76c8a30f2c11de0ec18fc0952530","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-10T14:09:46Z","title_canon_sha256":"2650a646af554cdce3d0fdae82d64418d5d95078478523e3bd255ee52663dab2"},"schema_version":"1.0","source":{"id":"2404.07018","kind":"arxiv","version":2}},"canonical_sha256":"4c22b8d055f59eddcecfba02dd97f6e3a38f3d11a9bda89b898cf61e31e4b5db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c22b8d055f59eddcecfba02dd97f6e3a38f3d11a9bda89b898cf61e31e4b5db","first_computed_at":"2026-07-05T08:28:09.250970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:28:09.250970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MkOg5itdwplullDhIkMMj7t5/W4+ynPeOnevYeUFSXgr/IueenapD1nCLjx9naD9AnHpxuZr1S7b1qj7YBbKCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:28:09.251412Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.07018","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:002b594f91fe8c6c53af5312c4186f1a7bc6937a98d09823ba8e46580c9e7b68","sha256:cd709c23d964f7901bf3704e320f0712ed0d0f0a16bf8418f9b56a5b797ec157"],"state_sha256":"88b09d2d89e6de95df745252c652f40fb7b958a90e6ada246d836f427f2aa644"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"py6qxkHNpdp+b/KXvCjW/5ABcjeQjuLaT0nVFSJJjFnSH7AnaFJbiE0agmdrFg8/LnHrn3DQvswjUIuoee4dAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:12:24.989304Z","bundle_sha256":"270f153ac9a6165907249932a4eb391e4a84c7e69e1f60d58a3d7c93c29b1198"}}