{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QQFC5GBPGKL2VGLT6UNWKPTJCV","short_pith_number":"pith:QQFC5GBP","canonical_record":{"source":{"id":"1706.00163","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-01T04:35:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"69a253f9bf0cd255770a6c6217818287aa2c6a89189d852c96ef67ef7b8ae680","abstract_canon_sha256":"9b9422242aeb847a9837fbe190f2b7631a784b4e1b9f130122b642624fc71e4a"},"schema_version":"1.0"},"canonical_sha256":"840a2e982f3297aa9973f51b653e69156da3ba1879a87ed0055fbf9539d95bf6","source":{"kind":"arxiv","id":"1706.00163","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00163","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00163v3","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00163","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"QQFC5GBPGKL2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QQFC5GBPGKL2VGLT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QQFC5GBP","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QQFC5GBPGKL2VGLT6UNWKPTJCV","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00163","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-01T04:35:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"69a253f9bf0cd255770a6c6217818287aa2c6a89189d852c96ef67ef7b8ae680","abstract_canon_sha256":"9b9422242aeb847a9837fbe190f2b7631a784b4e1b9f130122b642624fc71e4a"},"schema_version":"1.0"},"canonical_sha256":"840a2e982f3297aa9973f51b653e69156da3ba1879a87ed0055fbf9539d95bf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:08.017632Z","signature_b64":"BPkrsntMVaQhKBkw7k9BKXEEmhZFhCVis9KrDbQVNKbNKQlOkquSjkEc0lG0/xSUP/9CAdh8Ee2dUVwaqrFECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"840a2e982f3297aa9973f51b653e69156da3ba1879a87ed0055fbf9539d95bf6","last_reissued_at":"2026-05-18T00:43:08.016875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:08.016875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00163","source_version":3,"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:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFMunQDTvs6iwRXIrbmx4iPFVozxe6RqV5C6Td9oswGGPczaOiKLNtsegr8lLn4lN8T96fglqWlOb2YkqQ/+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:26:03.980612Z"},"content_sha256":"eafb751962327a804272beb0bb58cdb8baeb80f2b9e10b0f287fd7987a854395","schema_version":"1.0","event_id":"sha256:eafb751962327a804272beb0bb58cdb8baeb80f2b9e10b0f287fd7987a854395"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QQFC5GBPGKL2VGLT6UNWKPTJCV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding Method for Parallel Iterative Linear Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pulkit Grover, Soummya Kar, Yaoqing Yang","submitted_at":"2017-06-01T04:35:33Z","abstract_excerpt":"Computationally intensive distributed and parallel computing is often bottlenecked by a small set of slow workers known as stragglers. In this paper, we utilize the emerging idea of \"coded computation\" to design a novel error-correcting-code inspired technique for solving linear inverse problems under specific iterative methods in a parallelized implementation affected by stragglers. Example applications include inverse problems in machine learning on graphs, such as personalized PageRank and sampling on graphs. We provably show that our coded-computation technique can reduce the mean-squared "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00163","kind":"arxiv","version":3},"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:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrafJto0tGBzNZ71ljcshrvi1S2y7PuPE68D/tJcrrRNrvFGqNGHgFIVGbL5dGmBENXaNviDzZb+ReQZBNPxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:26:03.980960Z"},"content_sha256":"d4a2cab078d221e481b7f48664347ba3e2e33d9df2dbe1b4784fac29db2392cf","schema_version":"1.0","event_id":"sha256:d4a2cab078d221e481b7f48664347ba3e2e33d9df2dbe1b4784fac29db2392cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQFC5GBPGKL2VGLT6UNWKPTJCV/bundle.json","state_url":"https://pith.science/pith/QQFC5GBPGKL2VGLT6UNWKPTJCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQFC5GBPGKL2VGLT6UNWKPTJCV/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-28T00:26:03Z","links":{"resolver":"https://pith.science/pith/QQFC5GBPGKL2VGLT6UNWKPTJCV","bundle":"https://pith.science/pith/QQFC5GBPGKL2VGLT6UNWKPTJCV/bundle.json","state":"https://pith.science/pith/QQFC5GBPGKL2VGLT6UNWKPTJCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQFC5GBPGKL2VGLT6UNWKPTJCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QQFC5GBPGKL2VGLT6UNWKPTJCV","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":"9b9422242aeb847a9837fbe190f2b7631a784b4e1b9f130122b642624fc71e4a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-01T04:35:33Z","title_canon_sha256":"69a253f9bf0cd255770a6c6217818287aa2c6a89189d852c96ef67ef7b8ae680"},"schema_version":"1.0","source":{"id":"1706.00163","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00163","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00163v3","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00163","created_at":"2026-05-18T00:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"QQFC5GBPGKL2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QQFC5GBPGKL2VGLT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QQFC5GBP","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:d4a2cab078d221e481b7f48664347ba3e2e33d9df2dbe1b4784fac29db2392cf","target":"graph","created_at":"2026-05-18T00:43:08Z","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":"Computationally intensive distributed and parallel computing is often bottlenecked by a small set of slow workers known as stragglers. In this paper, we utilize the emerging idea of \"coded computation\" to design a novel error-correcting-code inspired technique for solving linear inverse problems under specific iterative methods in a parallelized implementation affected by stragglers. Example applications include inverse problems in machine learning on graphs, such as personalized PageRank and sampling on graphs. We provably show that our coded-computation technique can reduce the mean-squared ","authors_text":"Pulkit Grover, Soummya Kar, Yaoqing Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-01T04:35:33Z","title":"Coding Method for Parallel Iterative Linear Solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00163","kind":"arxiv","version":3},"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:eafb751962327a804272beb0bb58cdb8baeb80f2b9e10b0f287fd7987a854395","target":"record","created_at":"2026-05-18T00:43:08Z","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":"9b9422242aeb847a9837fbe190f2b7631a784b4e1b9f130122b642624fc71e4a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-01T04:35:33Z","title_canon_sha256":"69a253f9bf0cd255770a6c6217818287aa2c6a89189d852c96ef67ef7b8ae680"},"schema_version":"1.0","source":{"id":"1706.00163","kind":"arxiv","version":3}},"canonical_sha256":"840a2e982f3297aa9973f51b653e69156da3ba1879a87ed0055fbf9539d95bf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"840a2e982f3297aa9973f51b653e69156da3ba1879a87ed0055fbf9539d95bf6","first_computed_at":"2026-05-18T00:43:08.016875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:08.016875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BPkrsntMVaQhKBkw7k9BKXEEmhZFhCVis9KrDbQVNKbNKQlOkquSjkEc0lG0/xSUP/9CAdh8Ee2dUVwaqrFECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:08.017632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00163","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eafb751962327a804272beb0bb58cdb8baeb80f2b9e10b0f287fd7987a854395","sha256:d4a2cab078d221e481b7f48664347ba3e2e33d9df2dbe1b4784fac29db2392cf"],"state_sha256":"04ad46dd3f398758acc714cfa8fece76035b1193d618c8e3fa49c580681e22b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCHhEZrtPn2JdLark0NBpG81ICCLiHhuKTpVWekXdtjuZA5d80X6iofQusgWK+56nVN3LtR/rQSuyQ9l/ZzYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:26:03.982934Z","bundle_sha256":"786ca24bc36d64b9f100c24d2f14a8b55485a0696de8689a68eb6f05808c5121"}}