{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GASA5OXBCZN2G7Z4GBO4EGLDL4","short_pith_number":"pith:GASA5OXB","canonical_record":{"source":{"id":"1805.06046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-15T22:08:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b92ac6e272e7f710c18f5893d05fcc49e290d7c6b170b4bc7be41cda6d92b8ee","abstract_canon_sha256":"9a4484decaec3d1f43ebd6416ce82fb7b72e00c2755f1ffd1292e15e975b107f"},"schema_version":"1.0"},"canonical_sha256":"30240ebae1165ba37f3c305dc219635f309d7ead14b34247925d4ba670f9acd7","source":{"kind":"arxiv","id":"1805.06046","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06046","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06046v1","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06046","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"GASA5OXBCZN2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GASA5OXBCZN2G7Z4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GASA5OXB","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GASA5OXBCZN2G7Z4GBO4EGLDL4","target":"record","payload":{"canonical_record":{"source":{"id":"1805.06046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-15T22:08:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b92ac6e272e7f710c18f5893d05fcc49e290d7c6b170b4bc7be41cda6d92b8ee","abstract_canon_sha256":"9a4484decaec3d1f43ebd6416ce82fb7b72e00c2755f1ffd1292e15e975b107f"},"schema_version":"1.0"},"canonical_sha256":"30240ebae1165ba37f3c305dc219635f309d7ead14b34247925d4ba670f9acd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:49.057542Z","signature_b64":"iDxr/MSGDICqj1hed7lFdJPKTHrr0ORy8nrjm2WeaBt0exKiqiY7WgYp4Upn3JiqbDfGNViW85np4jct7NP7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30240ebae1165ba37f3c305dc219635f309d7ead14b34247925d4ba670f9acd7","last_reissued_at":"2026-05-18T00:15:49.056704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:49.056704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.06046","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:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/LRYLeikR8JbelxRV2126NJY1V1QgkhqaqhxAJ6Y2PQ2IMo2FiHsTlYLE3ouYOlj8UztupsLu/ylvl5ARAKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:10:07.264725Z"},"content_sha256":"793b7bfbf4883b9e028373712bc0365f5fc091e47947054f9aafc6a9721701ae","schema_version":"1.0","event_id":"sha256:793b7bfbf4883b9e028373712bc0365f5fc091e47947054f9aafc6a9721701ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GASA5OXBCZN2G7Z4GBO4EGLDL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Iterative Computing using Substitute Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Malhar Chaudhari, Pulkit Grover, Soummya Kar, Yaoqing Yang","submitted_at":"2018-05-15T22:08:05Z","abstract_excerpt":"In this paper, we propose a new coded computing technique called \"substitute decoding\" for general iterative distributed computation tasks. In the first part of the paper, we use PageRank as a simple example to show that substitute decoding can make the computation of power iterations solving PageRank on sparse matrices robust to erasures in distributed systems. For these sparse matrices, codes with dense generator matrices can significantly increase storage costs and codes with low-density generator matrices (LDGM) are preferred. Surprisingly, we show through both theoretical analysis and sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06046","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:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97j95Uip1wmfFm0d/Lmas3fTcMI2NNlnM3/zYah2rWhE6+nmB8g/I7bqfxdyaQTGzAG356QNvEKJjrZ68IALDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:10:07.265287Z"},"content_sha256":"c7a6da5e2446702d7e3da430cd0172dfe3ea1144b8520b6ec62f3547023a607f","schema_version":"1.0","event_id":"sha256:c7a6da5e2446702d7e3da430cd0172dfe3ea1144b8520b6ec62f3547023a607f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GASA5OXBCZN2G7Z4GBO4EGLDL4/bundle.json","state_url":"https://pith.science/pith/GASA5OXBCZN2G7Z4GBO4EGLDL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GASA5OXBCZN2G7Z4GBO4EGLDL4/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-26T01:10:07Z","links":{"resolver":"https://pith.science/pith/GASA5OXBCZN2G7Z4GBO4EGLDL4","bundle":"https://pith.science/pith/GASA5OXBCZN2G7Z4GBO4EGLDL4/bundle.json","state":"https://pith.science/pith/GASA5OXBCZN2G7Z4GBO4EGLDL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GASA5OXBCZN2G7Z4GBO4EGLDL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GASA5OXBCZN2G7Z4GBO4EGLDL4","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":"9a4484decaec3d1f43ebd6416ce82fb7b72e00c2755f1ffd1292e15e975b107f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-15T22:08:05Z","title_canon_sha256":"b92ac6e272e7f710c18f5893d05fcc49e290d7c6b170b4bc7be41cda6d92b8ee"},"schema_version":"1.0","source":{"id":"1805.06046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06046","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06046v1","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06046","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"GASA5OXBCZN2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GASA5OXBCZN2G7Z4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GASA5OXB","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:c7a6da5e2446702d7e3da430cd0172dfe3ea1144b8520b6ec62f3547023a607f","target":"graph","created_at":"2026-05-18T00:15:49Z","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":"In this paper, we propose a new coded computing technique called \"substitute decoding\" for general iterative distributed computation tasks. In the first part of the paper, we use PageRank as a simple example to show that substitute decoding can make the computation of power iterations solving PageRank on sparse matrices robust to erasures in distributed systems. For these sparse matrices, codes with dense generator matrices can significantly increase storage costs and codes with low-density generator matrices (LDGM) are preferred. Surprisingly, we show through both theoretical analysis and sim","authors_text":"Malhar Chaudhari, 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":"2018-05-15T22:08:05Z","title":"Coded Iterative Computing using Substitute Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06046","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:793b7bfbf4883b9e028373712bc0365f5fc091e47947054f9aafc6a9721701ae","target":"record","created_at":"2026-05-18T00:15:49Z","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":"9a4484decaec3d1f43ebd6416ce82fb7b72e00c2755f1ffd1292e15e975b107f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-15T22:08:05Z","title_canon_sha256":"b92ac6e272e7f710c18f5893d05fcc49e290d7c6b170b4bc7be41cda6d92b8ee"},"schema_version":"1.0","source":{"id":"1805.06046","kind":"arxiv","version":1}},"canonical_sha256":"30240ebae1165ba37f3c305dc219635f309d7ead14b34247925d4ba670f9acd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30240ebae1165ba37f3c305dc219635f309d7ead14b34247925d4ba670f9acd7","first_computed_at":"2026-05-18T00:15:49.056704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:49.056704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iDxr/MSGDICqj1hed7lFdJPKTHrr0ORy8nrjm2WeaBt0exKiqiY7WgYp4Upn3JiqbDfGNViW85np4jct7NP7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:49.057542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:793b7bfbf4883b9e028373712bc0365f5fc091e47947054f9aafc6a9721701ae","sha256:c7a6da5e2446702d7e3da430cd0172dfe3ea1144b8520b6ec62f3547023a607f"],"state_sha256":"aad9c6c24d53463192765287e370933e4b042255084a0280e77e8fe810b3e9cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cmm0Fes7mfNHcRpMQiR+6Ls+0SJroKWzlC+KayVx1VZIrix+Jm2N1YJ4eU9JPpd4Kp5+XLQFp+/gpkGAQAMKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:10:07.268945Z","bundle_sha256":"9a0a64d06a82962e21bc2c29a8fcfaf5185a84db7fdfa394b8835a8d96170eca"}}