{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EZ3MR5PY4ZHGXHC4AUE7XJHTFQ","short_pith_number":"pith:EZ3MR5PY","canonical_record":{"source":{"id":"1708.01413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-04T08:18:26Z","cross_cats_sorted":["cs.DC","math.NA"],"title_canon_sha256":"354fa83c56ffd7bba5570119fbb6b9508468c568ffdd8400d38c65fb40f31c80","abstract_canon_sha256":"82125b5fd924bbf40350d3e15e69d52381e32067a183135401b1f3c2ed176857"},"schema_version":"1.0"},"canonical_sha256":"2676c8f5f8e64e6b9c5c0509fba4f32c10ed6f6812a9aaf189067b32f5b9a5db","source":{"kind":"arxiv","id":"1708.01413","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01413","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01413v2","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01413","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"EZ3MR5PY4ZHG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EZ3MR5PY4ZHGXHC4","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EZ3MR5PY","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EZ3MR5PY4ZHGXHC4AUE7XJHTFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-04T08:18:26Z","cross_cats_sorted":["cs.DC","math.NA"],"title_canon_sha256":"354fa83c56ffd7bba5570119fbb6b9508468c568ffdd8400d38c65fb40f31c80","abstract_canon_sha256":"82125b5fd924bbf40350d3e15e69d52381e32067a183135401b1f3c2ed176857"},"schema_version":"1.0"},"canonical_sha256":"2676c8f5f8e64e6b9c5c0509fba4f32c10ed6f6812a9aaf189067b32f5b9a5db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:22.831003Z","signature_b64":"rD2ngWxirqVespoUq985M3f5Hbmxh9q+V91r6opoHmFl/Juithf35CgjXT/DIZYtiO2ntBeUuSvL+caX2u1/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2676c8f5f8e64e6b9c5c0509fba4f32c10ed6f6812a9aaf189067b32f5b9a5db","last_reissued_at":"2026-05-18T00:28:22.830278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:22.830278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01413","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-05-18T00:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWunRH8liCvXVPyLcMytAlWRCoft5WFvd2m1qPt12N6CpfTksttYggkF/90/79ebMxlKXVgs1K0K7ucekuymCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:27:09.108201Z"},"content_sha256":"a0007f992a3d95023af846d696c65617c10981dbc2c4885221642b4ec2cc4e35","schema_version":"1.0","event_id":"sha256:a0007f992a3d95023af846d696c65617c10981dbc2c4885221642b4ec2cc4e35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EZ3MR5PY4ZHGXHC4AUE7XJHTFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Solution of Large-Scale Linear Systems via Accelerated Projection-Based Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.NA"],"primary_cat":"cs.LG","authors_text":"Babak Hassibi, Farshad Lahouti, Navid Azizan-Ruhi, Salman Avestimehr","submitted_at":"2017-08-04T08:18:26Z","abstract_excerpt":"Solving a large-scale system of linear equations is a key step at the heart of many algorithms in machine learning, scientific computing, and beyond. When the problem dimension is large, computational and/or memory constraints make it desirable, or even necessary, to perform the task in a distributed fashion. In this paper, we consider a common scenario in which a taskmaster intends to solve a large-scale system of linear equations by distributing subsets of the equations among a number of computing machines/cores. We propose an accelerated distributed consensus algorithm, in which at each ite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01413","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":""},"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:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtDr2eexEgcL7IIH62FUZ6YDHXr+pIZeP9uad86Hvhz8KxXP0fXtpw5K2Jc2bXFGPNQDpI+D/ZwDg5cV6NsrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:27:09.108637Z"},"content_sha256":"e0e0a0c678ecfa6f3e63606f89a1c53c4966c7703f086490f4af3e7c79c74534","schema_version":"1.0","event_id":"sha256:e0e0a0c678ecfa6f3e63606f89a1c53c4966c7703f086490f4af3e7c79c74534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZ3MR5PY4ZHGXHC4AUE7XJHTFQ/bundle.json","state_url":"https://pith.science/pith/EZ3MR5PY4ZHGXHC4AUE7XJHTFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZ3MR5PY4ZHGXHC4AUE7XJHTFQ/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-27T10:27:09Z","links":{"resolver":"https://pith.science/pith/EZ3MR5PY4ZHGXHC4AUE7XJHTFQ","bundle":"https://pith.science/pith/EZ3MR5PY4ZHGXHC4AUE7XJHTFQ/bundle.json","state":"https://pith.science/pith/EZ3MR5PY4ZHGXHC4AUE7XJHTFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZ3MR5PY4ZHGXHC4AUE7XJHTFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EZ3MR5PY4ZHGXHC4AUE7XJHTFQ","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":"82125b5fd924bbf40350d3e15e69d52381e32067a183135401b1f3c2ed176857","cross_cats_sorted":["cs.DC","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-04T08:18:26Z","title_canon_sha256":"354fa83c56ffd7bba5570119fbb6b9508468c568ffdd8400d38c65fb40f31c80"},"schema_version":"1.0","source":{"id":"1708.01413","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01413","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01413v2","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01413","created_at":"2026-05-18T00:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"EZ3MR5PY4ZHG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EZ3MR5PY4ZHGXHC4","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EZ3MR5PY","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:e0e0a0c678ecfa6f3e63606f89a1c53c4966c7703f086490f4af3e7c79c74534","target":"graph","created_at":"2026-05-18T00:28:22Z","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":"Solving a large-scale system of linear equations is a key step at the heart of many algorithms in machine learning, scientific computing, and beyond. When the problem dimension is large, computational and/or memory constraints make it desirable, or even necessary, to perform the task in a distributed fashion. In this paper, we consider a common scenario in which a taskmaster intends to solve a large-scale system of linear equations by distributing subsets of the equations among a number of computing machines/cores. We propose an accelerated distributed consensus algorithm, in which at each ite","authors_text":"Babak Hassibi, Farshad Lahouti, Navid Azizan-Ruhi, Salman Avestimehr","cross_cats":["cs.DC","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-04T08:18:26Z","title":"Distributed Solution of Large-Scale Linear Systems via Accelerated Projection-Based Consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01413","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:a0007f992a3d95023af846d696c65617c10981dbc2c4885221642b4ec2cc4e35","target":"record","created_at":"2026-05-18T00:28:22Z","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":"82125b5fd924bbf40350d3e15e69d52381e32067a183135401b1f3c2ed176857","cross_cats_sorted":["cs.DC","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-04T08:18:26Z","title_canon_sha256":"354fa83c56ffd7bba5570119fbb6b9508468c568ffdd8400d38c65fb40f31c80"},"schema_version":"1.0","source":{"id":"1708.01413","kind":"arxiv","version":2}},"canonical_sha256":"2676c8f5f8e64e6b9c5c0509fba4f32c10ed6f6812a9aaf189067b32f5b9a5db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2676c8f5f8e64e6b9c5c0509fba4f32c10ed6f6812a9aaf189067b32f5b9a5db","first_computed_at":"2026-05-18T00:28:22.830278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:22.830278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rD2ngWxirqVespoUq985M3f5Hbmxh9q+V91r6opoHmFl/Juithf35CgjXT/DIZYtiO2ntBeUuSvL+caX2u1/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:22.831003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01413","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0007f992a3d95023af846d696c65617c10981dbc2c4885221642b4ec2cc4e35","sha256:e0e0a0c678ecfa6f3e63606f89a1c53c4966c7703f086490f4af3e7c79c74534"],"state_sha256":"0836b77bd6431f7e3c4f551cb56729f3e34aaa84f9498b4967880f7ac2d4db1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0f6wTdUcEucItb1qUstc2uuUINgcOfdf4u3k0+zUwrRZJkf1uRPE/kYmtiE+DGFErQ8RsUSvqbOIKrcU46rvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:27:09.110926Z","bundle_sha256":"fafdbbda80a876ba4d1200f0293de6d930c0b923c2c9446351fab8447a415edf"}}