{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2NOTQQXRMQIIT34NUZC5GQN7U2","short_pith_number":"pith:2NOTQQXR","canonical_record":{"source":{"id":"1804.10331","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-27T03:41:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"925a5abe920334aa2fffde0b2755acf7eab329eafb38d56a2be77504040323ac","abstract_canon_sha256":"aaf8fa95e1cfe00020b9087cef603205cb02226747cf9a5d1de335812520d6c4"},"schema_version":"1.0"},"canonical_sha256":"d35d3842f1641089ef8da645d341bfa6abb90402391c84c997dbf03c2d484f7e","source":{"kind":"arxiv","id":"1804.10331","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10331","created_at":"2026-07-05T00:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10331v5","created_at":"2026-07-05T00:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10331","created_at":"2026-07-05T00:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"2NOTQQXRMQII","created_at":"2026-07-05T00:16:02Z"},{"alias_kind":"pith_short_16","alias_value":"2NOTQQXRMQIIT34N","created_at":"2026-07-05T00:16:02Z"},{"alias_kind":"pith_short_8","alias_value":"2NOTQQXR","created_at":"2026-07-05T00:16:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2NOTQQXRMQIIT34NUZC5GQN7U2","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10331","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-27T03:41:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"925a5abe920334aa2fffde0b2755acf7eab329eafb38d56a2be77504040323ac","abstract_canon_sha256":"aaf8fa95e1cfe00020b9087cef603205cb02226747cf9a5d1de335812520d6c4"},"schema_version":"1.0"},"canonical_sha256":"d35d3842f1641089ef8da645d341bfa6abb90402391c84c997dbf03c2d484f7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:02.121539Z","signature_b64":"3FWuXiYYab0EfGPuKVaWnjiq//hh3lYCnN8z6RvKmzLAihWbhJ/9JDzJE05oFDd4kIV3gb8Lnjt2Xm9PirKABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d35d3842f1641089ef8da645d341bfa6abb90402391c84c997dbf03c2d484f7e","last_reissued_at":"2026-07-05T00:16:02.121180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:02.121180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10331","source_version":5,"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-07-05T00:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+LVZGEGmcap8Zyo14489tTKMXTeFtb94U6GQQmAhqG8ZQoAmHntEuqJsN/IoliLPwfQbUUMU3oSmsAo3Np+9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:53:33.801261Z"},"content_sha256":"bc28edb4758b0681985968a27ed7d61fe7c835edb15d0eaeea2be245984d7b1b","schema_version":"1.0","event_id":"sha256:bc28edb4758b0681985968a27ed7d61fe7c835edb15d0eaeea2be245984d7b1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2NOTQQXRMQIIT34NUZC5GQN7U2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Ankur Mallick, Ganesh Palanikumar, Gauri Joshi, Malhar Chaudhari, Utsav Sheth","submitted_at":"2018-04-27T03:41:04Z","abstract_excerpt":"Large-scale machine learning and data mining applications require computer systems to perform massive matrix-vector and matrix-matrix multiplication operations that need to be parallelized across multiple nodes. The presence of straggling nodes -- computing nodes that unpredictably slowdown or fail -- is a major bottleneck in such distributed computations. Ideal load balancing strategies that dynamically allocate more tasks to faster nodes require knowledge or monitoring of node speeds as well as the ability to quickly move data. Recently proposed fixed-rate erasure coding strategies can handl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10331","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1804.10331/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LmR+R4OfxyvKY/VVy6H3UacPerquWx5vUNUe7Mp5eKloVM0czCsQNXM1RUW0AqwQA98+vSZ/SAjCwFaxC2vGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:53:33.802221Z"},"content_sha256":"9cf3649b131e9885f168eaae976e00a18f78183d32479f3ccafd7096e8955a38","schema_version":"1.0","event_id":"sha256:9cf3649b131e9885f168eaae976e00a18f78183d32479f3ccafd7096e8955a38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NOTQQXRMQIIT34NUZC5GQN7U2/bundle.json","state_url":"https://pith.science/pith/2NOTQQXRMQIIT34NUZC5GQN7U2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NOTQQXRMQIIT34NUZC5GQN7U2/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-08-04T21:53:33Z","links":{"resolver":"https://pith.science/pith/2NOTQQXRMQIIT34NUZC5GQN7U2","bundle":"https://pith.science/pith/2NOTQQXRMQIIT34NUZC5GQN7U2/bundle.json","state":"https://pith.science/pith/2NOTQQXRMQIIT34NUZC5GQN7U2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NOTQQXRMQIIT34NUZC5GQN7U2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2NOTQQXRMQIIT34NUZC5GQN7U2","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":"aaf8fa95e1cfe00020b9087cef603205cb02226747cf9a5d1de335812520d6c4","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-27T03:41:04Z","title_canon_sha256":"925a5abe920334aa2fffde0b2755acf7eab329eafb38d56a2be77504040323ac"},"schema_version":"1.0","source":{"id":"1804.10331","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10331","created_at":"2026-07-05T00:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10331v5","created_at":"2026-07-05T00:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10331","created_at":"2026-07-05T00:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"2NOTQQXRMQII","created_at":"2026-07-05T00:16:02Z"},{"alias_kind":"pith_short_16","alias_value":"2NOTQQXRMQIIT34N","created_at":"2026-07-05T00:16:02Z"},{"alias_kind":"pith_short_8","alias_value":"2NOTQQXR","created_at":"2026-07-05T00:16:02Z"}],"graph_snapshots":[{"event_id":"sha256:9cf3649b131e9885f168eaae976e00a18f78183d32479f3ccafd7096e8955a38","target":"graph","created_at":"2026-07-05T00:16:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1804.10331/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large-scale machine learning and data mining applications require computer systems to perform massive matrix-vector and matrix-matrix multiplication operations that need to be parallelized across multiple nodes. The presence of straggling nodes -- computing nodes that unpredictably slowdown or fail -- is a major bottleneck in such distributed computations. Ideal load balancing strategies that dynamically allocate more tasks to faster nodes require knowledge or monitoring of node speeds as well as the ability to quickly move data. Recently proposed fixed-rate erasure coding strategies can handl","authors_text":"Ankur Mallick, Ganesh Palanikumar, Gauri Joshi, Malhar Chaudhari, Utsav Sheth","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-27T03:41:04Z","title":"Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10331","kind":"arxiv","version":5},"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:bc28edb4758b0681985968a27ed7d61fe7c835edb15d0eaeea2be245984d7b1b","target":"record","created_at":"2026-07-05T00:16:02Z","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":"aaf8fa95e1cfe00020b9087cef603205cb02226747cf9a5d1de335812520d6c4","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-27T03:41:04Z","title_canon_sha256":"925a5abe920334aa2fffde0b2755acf7eab329eafb38d56a2be77504040323ac"},"schema_version":"1.0","source":{"id":"1804.10331","kind":"arxiv","version":5}},"canonical_sha256":"d35d3842f1641089ef8da645d341bfa6abb90402391c84c997dbf03c2d484f7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d35d3842f1641089ef8da645d341bfa6abb90402391c84c997dbf03c2d484f7e","first_computed_at":"2026-07-05T00:16:02.121180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:02.121180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3FWuXiYYab0EfGPuKVaWnjiq//hh3lYCnN8z6RvKmzLAihWbhJ/9JDzJE05oFDd4kIV3gb8Lnjt2Xm9PirKABA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:02.121539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10331","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc28edb4758b0681985968a27ed7d61fe7c835edb15d0eaeea2be245984d7b1b","sha256:9cf3649b131e9885f168eaae976e00a18f78183d32479f3ccafd7096e8955a38"],"state_sha256":"23c722ffc2070e662a580f98272e0443e7f0fc104b12f6abe1e9fb351e2ac0ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8a/CQSeu58xy+t7tLmu/U8sKX80zFJDkSRPD5LU6DBxpViFhBFqKv3R0kS+7SiTV6B/DKetgrpDcrSL4qz84CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:53:33.920736Z","bundle_sha256":"33979632db7337c0a2800c09651522fa57d97ae1bb6771aaf5f30291e8cba440"}}