{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SH357I6WURZTEWKIYVUU2E76XP","short_pith_number":"pith:SH357I6W","canonical_record":{"source":{"id":"2501.07967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-01-14T09:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"bc401d643cb1b909d1023925122c1fbe0fd92bbdb35a67917b9b24f3aac722d3","abstract_canon_sha256":"ecabd850e5d66a3427c6e79ee610f0ddc0e3dd267903f4c52d12a96c3a9de323"},"schema_version":"1.0"},"canonical_sha256":"91f7dfa3d6a473325948c5694d13febbd9def70df2334c031b74749232bd62ce","source":{"kind":"arxiv","id":"2501.07967","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07967","created_at":"2026-07-05T10:00:53Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07967v1","created_at":"2026-07-05T10:00:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07967","created_at":"2026-07-05T10:00:53Z"},{"alias_kind":"pith_short_12","alias_value":"SH357I6WURZT","created_at":"2026-07-05T10:00:53Z"},{"alias_kind":"pith_short_16","alias_value":"SH357I6WURZTEWKI","created_at":"2026-07-05T10:00:53Z"},{"alias_kind":"pith_short_8","alias_value":"SH357I6W","created_at":"2026-07-05T10:00:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SH357I6WURZTEWKIYVUU2E76XP","target":"record","payload":{"canonical_record":{"source":{"id":"2501.07967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-01-14T09:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"bc401d643cb1b909d1023925122c1fbe0fd92bbdb35a67917b9b24f3aac722d3","abstract_canon_sha256":"ecabd850e5d66a3427c6e79ee610f0ddc0e3dd267903f4c52d12a96c3a9de323"},"schema_version":"1.0"},"canonical_sha256":"91f7dfa3d6a473325948c5694d13febbd9def70df2334c031b74749232bd62ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:53.092870Z","signature_b64":"+wTodxgz8n4tWKskqGk76CnWhl7elq6mtz2lh3bUbspBpkMefr4B/nKfkzeYwJfaCZnH7Sm+zy55dGFqmROXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91f7dfa3d6a473325948c5694d13febbd9def70df2334c031b74749232bd62ce","last_reissued_at":"2026-07-05T10:00:53.092341Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:53.092341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.07967","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-07-05T10:00:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jN9+TCzJUHRvPO9IQaCtGdB3iiWmAbR95/xIOEJY1qCZzrIB5tr+s+mSOs0H1RmVyLiB/L6EJr+AEgiM7nzECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:34:57.217737Z"},"content_sha256":"857c6e9fbf4595f5174aee318b351d7d6d931c403dfb4dea41d03aa87dc739ab","schema_version":"1.0","event_id":"sha256:857c6e9fbf4595f5174aee318b351d7d6d931c403dfb4dea41d03aa87dc739ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SH357I6WURZTEWKIYVUU2E76XP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Learning with Approximate Finite-Time Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Aaron Fainman, Stefan Vlaski","submitted_at":"2025-01-14T09:37:12Z","abstract_excerpt":"The performance of algorithms for decentralized optimization is affected by both the optimization error and the consensus error, the latter of which arises from the variation between agents' local models. Classically, algorithms employ averaging and gradient-tracking mechanisms with constant combination matrices to drive the collection of agents to consensus. Recent works have demonstrated that using sequences of combination matrices that achieve finite-time consensus (FTC) can result in improved communication efficiency or iteration complexity for decentralized optimization. Notably, these st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07967","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.07967/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-05T10:00:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+iZjaKD0dzwEyDUqIgjbeHAb4xLd/OazBiR70wCZvBdlgCX9QVMfg+w+MPfbG4irHRgXbr5a2EKQuYO+owOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:34:57.218289Z"},"content_sha256":"33f2278ea54ac3d8f74b36326f92c3f9ee9a06946cdc8f8c02f245c9231c31b9","schema_version":"1.0","event_id":"sha256:33f2278ea54ac3d8f74b36326f92c3f9ee9a06946cdc8f8c02f245c9231c31b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SH357I6WURZTEWKIYVUU2E76XP/bundle.json","state_url":"https://pith.science/pith/SH357I6WURZTEWKIYVUU2E76XP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SH357I6WURZTEWKIYVUU2E76XP/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-06T21:34:57Z","links":{"resolver":"https://pith.science/pith/SH357I6WURZTEWKIYVUU2E76XP","bundle":"https://pith.science/pith/SH357I6WURZTEWKIYVUU2E76XP/bundle.json","state":"https://pith.science/pith/SH357I6WURZTEWKIYVUU2E76XP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SH357I6WURZTEWKIYVUU2E76XP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SH357I6WURZTEWKIYVUU2E76XP","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":"ecabd850e5d66a3427c6e79ee610f0ddc0e3dd267903f4c52d12a96c3a9de323","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-01-14T09:37:12Z","title_canon_sha256":"bc401d643cb1b909d1023925122c1fbe0fd92bbdb35a67917b9b24f3aac722d3"},"schema_version":"1.0","source":{"id":"2501.07967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07967","created_at":"2026-07-05T10:00:53Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07967v1","created_at":"2026-07-05T10:00:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07967","created_at":"2026-07-05T10:00:53Z"},{"alias_kind":"pith_short_12","alias_value":"SH357I6WURZT","created_at":"2026-07-05T10:00:53Z"},{"alias_kind":"pith_short_16","alias_value":"SH357I6WURZTEWKI","created_at":"2026-07-05T10:00:53Z"},{"alias_kind":"pith_short_8","alias_value":"SH357I6W","created_at":"2026-07-05T10:00:53Z"}],"graph_snapshots":[{"event_id":"sha256:33f2278ea54ac3d8f74b36326f92c3f9ee9a06946cdc8f8c02f245c9231c31b9","target":"graph","created_at":"2026-07-05T10:00:53Z","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/2501.07967/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The performance of algorithms for decentralized optimization is affected by both the optimization error and the consensus error, the latter of which arises from the variation between agents' local models. Classically, algorithms employ averaging and gradient-tracking mechanisms with constant combination matrices to drive the collection of agents to consensus. Recent works have demonstrated that using sequences of combination matrices that achieve finite-time consensus (FTC) can result in improved communication efficiency or iteration complexity for decentralized optimization. Notably, these st","authors_text":"Aaron Fainman, Stefan Vlaski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-01-14T09:37:12Z","title":"Decentralized Learning with Approximate Finite-Time Consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07967","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:857c6e9fbf4595f5174aee318b351d7d6d931c403dfb4dea41d03aa87dc739ab","target":"record","created_at":"2026-07-05T10:00:53Z","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":"ecabd850e5d66a3427c6e79ee610f0ddc0e3dd267903f4c52d12a96c3a9de323","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-01-14T09:37:12Z","title_canon_sha256":"bc401d643cb1b909d1023925122c1fbe0fd92bbdb35a67917b9b24f3aac722d3"},"schema_version":"1.0","source":{"id":"2501.07967","kind":"arxiv","version":1}},"canonical_sha256":"91f7dfa3d6a473325948c5694d13febbd9def70df2334c031b74749232bd62ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91f7dfa3d6a473325948c5694d13febbd9def70df2334c031b74749232bd62ce","first_computed_at":"2026-07-05T10:00:53.092341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:00:53.092341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+wTodxgz8n4tWKskqGk76CnWhl7elq6mtz2lh3bUbspBpkMefr4B/nKfkzeYwJfaCZnH7Sm+zy55dGFqmROXBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:00:53.092870Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.07967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:857c6e9fbf4595f5174aee318b351d7d6d931c403dfb4dea41d03aa87dc739ab","sha256:33f2278ea54ac3d8f74b36326f92c3f9ee9a06946cdc8f8c02f245c9231c31b9"],"state_sha256":"48010f758d0674556ca7257bf4bcb256a9eb4aa148ce9b1c413100bc93095098"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9i5+zc67QEXtsQWdLP5+ocnpLZhIdU5TCzjkmmprWzJbEWBTpM8LlMfMv6ZpYvlWTR+uCvj1Y6rApLnIruTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T21:34:57.223781Z","bundle_sha256":"f31340eeaffa424e4932333b31c5c65883fbe94b213f95a179391ebd5232e9c5"}}