{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KHUZ7SNPNBLRHO5YE32ZV6VQ3B","short_pith_number":"pith:KHUZ7SNP","canonical_record":{"source":{"id":"1703.03859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-10T22:25:56Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT","math.OC"],"title_canon_sha256":"9b6933d7da9f8248a71aa7712364f5a9f0948724e1f95bca0160d5d75af0c551","abstract_canon_sha256":"92417fadd5eae212acebc3d8cb31b8e5fe4bc1c97c36e16397285222fde082f2"},"schema_version":"1.0"},"canonical_sha256":"51e99fc9af685713bbb826f59afab0d8523e6737ac6ef61743ed7cc4dd3674ed","source":{"kind":"arxiv","id":"1703.03859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03859","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03859v1","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03859","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"pith_short_12","alias_value":"KHUZ7SNPNBLR","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHUZ7SNPNBLRHO5Y","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHUZ7SNP","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KHUZ7SNPNBLRHO5YE32ZV6VQ3B","target":"record","payload":{"canonical_record":{"source":{"id":"1703.03859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-10T22:25:56Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT","math.OC"],"title_canon_sha256":"9b6933d7da9f8248a71aa7712364f5a9f0948724e1f95bca0160d5d75af0c551","abstract_canon_sha256":"92417fadd5eae212acebc3d8cb31b8e5fe4bc1c97c36e16397285222fde082f2"},"schema_version":"1.0"},"canonical_sha256":"51e99fc9af685713bbb826f59afab0d8523e6737ac6ef61743ed7cc4dd3674ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:52.930084Z","signature_b64":"qk5DFVSKBQ8YglUX0DdVk+y+R6C1/oCmeRyHO3qsKTdXA1S1QlqAUOtr7gGUpoAsj581fCbSnoTcPlbg2kLTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51e99fc9af685713bbb826f59afab0d8523e6737ac6ef61743ed7cc4dd3674ed","last_reissued_at":"2026-05-18T00:48:52.929433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:52.929433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.03859","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-18T00:48:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gY2YEFzZfhYCZjneUe4ynPifjinilaLZ1UZExL2FRd4T6rmN4HA8Q8oHdtGRgx8KJaxkztc3TlXOljPy4bJCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:08:20.900149Z"},"content_sha256":"81b92270c9df6e838114a80318e4797e370fc650305fe189c557fb18205cc55d","schema_version":"1.0","event_id":"sha256:81b92270c9df6e838114a80318e4797e370fc650305fe189c557fb18205cc55d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KHUZ7SNPNBLRHO5YE32ZV6VQ3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov Chain Lifting and Distributed ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Guilherme Fran\\c{c}a, Jos\\'e Bento","submitted_at":"2017-03-10T22:25:56Z","abstract_excerpt":"The time to converge to the steady state of a finite Markov chain can be greatly reduced by a lifting operation, which creates a new Markov chain on an expanded state space. For a class of quadratic objectives, we show an analogous behavior where a distributed ADMM algorithm can be seen as a lifting of Gradient Descent algorithm. This provides a deep insight for its faster convergence rate under optimal parameter tuning. We conjecture that this gain is always present, as opposed to the lifting of a Markov chain which sometimes only provides a marginal speedup."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03859","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-18T00:48:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZpsLKKK8S67nGGFdHhdWnydD3qQsA6VlO0uo4RnNv05mTtBh9HxNfMtwnYZitC2DPgNq7hWhG5T3TmpbDyjBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:08:20.900970Z"},"content_sha256":"6b0d42af3011b960bbda1c19079670543cf31861e1f57fa49672e8ef9028bb73","schema_version":"1.0","event_id":"sha256:6b0d42af3011b960bbda1c19079670543cf31861e1f57fa49672e8ef9028bb73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHUZ7SNPNBLRHO5YE32ZV6VQ3B/bundle.json","state_url":"https://pith.science/pith/KHUZ7SNPNBLRHO5YE32ZV6VQ3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHUZ7SNPNBLRHO5YE32ZV6VQ3B/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-09T08:08:20Z","links":{"resolver":"https://pith.science/pith/KHUZ7SNPNBLRHO5YE32ZV6VQ3B","bundle":"https://pith.science/pith/KHUZ7SNPNBLRHO5YE32ZV6VQ3B/bundle.json","state":"https://pith.science/pith/KHUZ7SNPNBLRHO5YE32ZV6VQ3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHUZ7SNPNBLRHO5YE32ZV6VQ3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KHUZ7SNPNBLRHO5YE32ZV6VQ3B","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":"92417fadd5eae212acebc3d8cb31b8e5fe4bc1c97c36e16397285222fde082f2","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-10T22:25:56Z","title_canon_sha256":"9b6933d7da9f8248a71aa7712364f5a9f0948724e1f95bca0160d5d75af0c551"},"schema_version":"1.0","source":{"id":"1703.03859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03859","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03859v1","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03859","created_at":"2026-05-18T00:48:52Z"},{"alias_kind":"pith_short_12","alias_value":"KHUZ7SNPNBLR","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHUZ7SNPNBLRHO5Y","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHUZ7SNP","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:6b0d42af3011b960bbda1c19079670543cf31861e1f57fa49672e8ef9028bb73","target":"graph","created_at":"2026-05-18T00:48:52Z","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":"The time to converge to the steady state of a finite Markov chain can be greatly reduced by a lifting operation, which creates a new Markov chain on an expanded state space. For a class of quadratic objectives, we show an analogous behavior where a distributed ADMM algorithm can be seen as a lifting of Gradient Descent algorithm. This provides a deep insight for its faster convergence rate under optimal parameter tuning. We conjecture that this gain is always present, as opposed to the lifting of a Markov chain which sometimes only provides a marginal speedup.","authors_text":"Guilherme Fran\\c{c}a, Jos\\'e Bento","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-10T22:25:56Z","title":"Markov Chain Lifting and Distributed ADMM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03859","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:81b92270c9df6e838114a80318e4797e370fc650305fe189c557fb18205cc55d","target":"record","created_at":"2026-05-18T00:48:52Z","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":"92417fadd5eae212acebc3d8cb31b8e5fe4bc1c97c36e16397285222fde082f2","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-10T22:25:56Z","title_canon_sha256":"9b6933d7da9f8248a71aa7712364f5a9f0948724e1f95bca0160d5d75af0c551"},"schema_version":"1.0","source":{"id":"1703.03859","kind":"arxiv","version":1}},"canonical_sha256":"51e99fc9af685713bbb826f59afab0d8523e6737ac6ef61743ed7cc4dd3674ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51e99fc9af685713bbb826f59afab0d8523e6737ac6ef61743ed7cc4dd3674ed","first_computed_at":"2026-05-18T00:48:52.929433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:52.929433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qk5DFVSKBQ8YglUX0DdVk+y+R6C1/oCmeRyHO3qsKTdXA1S1QlqAUOtr7gGUpoAsj581fCbSnoTcPlbg2kLTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:52.930084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.03859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81b92270c9df6e838114a80318e4797e370fc650305fe189c557fb18205cc55d","sha256:6b0d42af3011b960bbda1c19079670543cf31861e1f57fa49672e8ef9028bb73"],"state_sha256":"13a09bb2cc736c6cb6f859948085938f8d3d2ad3cf60cc626c120dcba5307b1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cW6c5LVYUe9hVxB5ivUI+qFpLS+BIpGbLC34Ndm9Qpw7555UvnexjVX7CDO3I18tAg5bD7r/Anf6y72qIl7mBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:08:20.905732Z","bundle_sha256":"4eb24a205b8e7e0bf3e9676ee18bb8fca98538bff8c7eb5e50edda03a911bb9a"}}