{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GMZN2C4THNHVJRW3ZTETOETWXX","short_pith_number":"pith:GMZN2C4T","canonical_record":{"source":{"id":"1806.06140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-15T22:07:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74d4b4ec7bd52d6b4efdfd9a66e66682684ed71f1e3c470054641b123de4b58e","abstract_canon_sha256":"bb90741f7b62008c098ba479831142668715579058e1547f4621f84aecdd43fe"},"schema_version":"1.0"},"canonical_sha256":"3332dd0b933b4f54c6dbccc9371276bdcc4834581ff8a78251a9e9345b194826","source":{"kind":"arxiv","id":"1806.06140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06140","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06140v1","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06140","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"pith_short_12","alias_value":"GMZN2C4THNHV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GMZN2C4THNHVJRW3","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GMZN2C4T","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GMZN2C4THNHVJRW3ZTETOETWXX","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-15T22:07:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74d4b4ec7bd52d6b4efdfd9a66e66682684ed71f1e3c470054641b123de4b58e","abstract_canon_sha256":"bb90741f7b62008c098ba479831142668715579058e1547f4621f84aecdd43fe"},"schema_version":"1.0"},"canonical_sha256":"3332dd0b933b4f54c6dbccc9371276bdcc4834581ff8a78251a9e9345b194826","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:03.545090Z","signature_b64":"bsnC1HOcteLvSb7iDDSRPfUg1HksWOOqM/sR3f6OAJcvRWltmJdmUU5hrqryXf+hLRKY8ceEFUsx4mKvKYsKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3332dd0b933b4f54c6dbccc9371276bdcc4834581ff8a78251a9e9345b194826","last_reissued_at":"2026-05-18T00:13:03.544387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:03.544387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06140","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:13:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8aGbSUMvOH6A9QuVFL4ybHhz8DucqKQ/G5Crzbt+Hc7tIG8r2Gli3kSc0B3EIt8ZCduedh5y5OKtd9DFpReHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:14:52.030007Z"},"content_sha256":"0b835d09cdb5f0c3a4f6b960d5100312ef748fc365883138b060cb39e39b2510","schema_version":"1.0","event_id":"sha256:0b835d09cdb5f0c3a4f6b960d5100312ef748fc365883138b060cb39e39b2510"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GMZN2C4THNHVJRW3ZTETOETWXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Straggler-Resilient and Communication-Efficient Distributed Iterative Linear Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzin Haddadpour, Malhar Chaudhari, Pulkit Grover, Viveck R Cadambe, Yaoqing Yang","submitted_at":"2018-06-15T22:07:03Z","abstract_excerpt":"We propose a novel distributed iterative linear inverse solver method. Our method, PolyLin, has significantly lower communication cost, both in terms of number of rounds as well as number of bits, in comparison with the state of the art at the cost of higher computational complexity and storage. Our algorithm also has a built-in resilience to straggling and faulty computation nodes. We develop a natural variant of our main algorithm that trades off communication cost for computational complexity. Our method is inspired by ideas in error correcting codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06140","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:13:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"www5Q/2OsthnDKgnnRVGuW8w1ErjglxINr6eZKpmaLXzu/oXJquiTY7IA2zfCj0uEmRB0xkQAin0srxuYkKbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:14:52.030354Z"},"content_sha256":"6a580c49ed440d2bcd8fc469f039e5d34b91c9f7a88304dac9818997d08236b9","schema_version":"1.0","event_id":"sha256:6a580c49ed440d2bcd8fc469f039e5d34b91c9f7a88304dac9818997d08236b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMZN2C4THNHVJRW3ZTETOETWXX/bundle.json","state_url":"https://pith.science/pith/GMZN2C4THNHVJRW3ZTETOETWXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMZN2C4THNHVJRW3ZTETOETWXX/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-09T12:14:52Z","links":{"resolver":"https://pith.science/pith/GMZN2C4THNHVJRW3ZTETOETWXX","bundle":"https://pith.science/pith/GMZN2C4THNHVJRW3ZTETOETWXX/bundle.json","state":"https://pith.science/pith/GMZN2C4THNHVJRW3ZTETOETWXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMZN2C4THNHVJRW3ZTETOETWXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GMZN2C4THNHVJRW3ZTETOETWXX","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":"bb90741f7b62008c098ba479831142668715579058e1547f4621f84aecdd43fe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-15T22:07:03Z","title_canon_sha256":"74d4b4ec7bd52d6b4efdfd9a66e66682684ed71f1e3c470054641b123de4b58e"},"schema_version":"1.0","source":{"id":"1806.06140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06140","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06140v1","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06140","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"pith_short_12","alias_value":"GMZN2C4THNHV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GMZN2C4THNHVJRW3","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GMZN2C4T","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:6a580c49ed440d2bcd8fc469f039e5d34b91c9f7a88304dac9818997d08236b9","target":"graph","created_at":"2026-05-18T00:13:03Z","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":"We propose a novel distributed iterative linear inverse solver method. Our method, PolyLin, has significantly lower communication cost, both in terms of number of rounds as well as number of bits, in comparison with the state of the art at the cost of higher computational complexity and storage. Our algorithm also has a built-in resilience to straggling and faulty computation nodes. We develop a natural variant of our main algorithm that trades off communication cost for computational complexity. Our method is inspired by ideas in error correcting codes.","authors_text":"Farzin Haddadpour, Malhar Chaudhari, Pulkit Grover, Viveck R Cadambe, Yaoqing Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-15T22:07:03Z","title":"Straggler-Resilient and Communication-Efficient Distributed Iterative Linear Solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06140","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:0b835d09cdb5f0c3a4f6b960d5100312ef748fc365883138b060cb39e39b2510","target":"record","created_at":"2026-05-18T00:13:03Z","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":"bb90741f7b62008c098ba479831142668715579058e1547f4621f84aecdd43fe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-15T22:07:03Z","title_canon_sha256":"74d4b4ec7bd52d6b4efdfd9a66e66682684ed71f1e3c470054641b123de4b58e"},"schema_version":"1.0","source":{"id":"1806.06140","kind":"arxiv","version":1}},"canonical_sha256":"3332dd0b933b4f54c6dbccc9371276bdcc4834581ff8a78251a9e9345b194826","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3332dd0b933b4f54c6dbccc9371276bdcc4834581ff8a78251a9e9345b194826","first_computed_at":"2026-05-18T00:13:03.544387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:03.544387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bsnC1HOcteLvSb7iDDSRPfUg1HksWOOqM/sR3f6OAJcvRWltmJdmUU5hrqryXf+hLRKY8ceEFUsx4mKvKYsKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:03.545090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b835d09cdb5f0c3a4f6b960d5100312ef748fc365883138b060cb39e39b2510","sha256:6a580c49ed440d2bcd8fc469f039e5d34b91c9f7a88304dac9818997d08236b9"],"state_sha256":"03b5afc1f15036ed178bb8e9ecdb74e3a1ec4e10011f0090b045f23810989b14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ve25JE9flA7ZCDG/p1KKSX1ZDpNdcNoJw2pkRIlGLZWYRX8GNuF22zznoMkGecyrqnnX3O9zyOTUKAjy7GEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:14:52.032265Z","bundle_sha256":"d9c4789373b196d75fea15a7dd75b0aff18b702b35d32112d5e5df75dfae86d9"}}