{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q3ET6SQY4W353ITQCMNFBDSZJM","short_pith_number":"pith:Q3ET6SQY","schema_version":"1.0","canonical_sha256":"86c93f4a18e5b7dda270131a508e594b3467d5bf418da040b2b1e6c12eb5bae0","source":{"kind":"arxiv","id":"1802.03049","version":1},"attestation_state":"computed","paper":{"title":"Leveraging Coding Techniques for Speeding up Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Konstantinos Konstantinidis","submitted_at":"2018-02-08T21:10:01Z","abstract_excerpt":"Large scale clusters leveraging distributed computing frameworks such as MapReduce routinely process data that are on the orders of petabytes or more. The sheer size of the data precludes the processing of the data on a single computer. The philosophy in these methods is to partition the overall job into smaller tasks that are executed on different servers; this is called the map phase. This is followed by a data shuffling phase where appropriate data is exchanged between the servers. The final so-called reduce phase, completes the computation.\n  One potential approach, explored in prior work "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.03049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-08T21:10:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e675d441cf184a90bdf13f1ed016a3a55394a8129e45c503f9e288334e3ce7f8","abstract_canon_sha256":"40a3fb8b4cbd3e98b7dc2dc3231680ecd9684b789cc047467084b55986dd53b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:02.165488Z","signature_b64":"kJa9bqW7/BxK7pCn+xweDM0LI9HRcb4Ozn5NUQrODr59TgcMVOBJOqbrUSwVyk0IoxydPhJJPCmER4EC6WI4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86c93f4a18e5b7dda270131a508e594b3467d5bf418da040b2b1e6c12eb5bae0","last_reissued_at":"2026-05-18T00:24:02.164996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:02.164996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leveraging Coding Techniques for Speeding up Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Konstantinos Konstantinidis","submitted_at":"2018-02-08T21:10:01Z","abstract_excerpt":"Large scale clusters leveraging distributed computing frameworks such as MapReduce routinely process data that are on the orders of petabytes or more. The sheer size of the data precludes the processing of the data on a single computer. The philosophy in these methods is to partition the overall job into smaller tasks that are executed on different servers; this is called the map phase. This is followed by a data shuffling phase where appropriate data is exchanged between the servers. The final so-called reduce phase, completes the computation.\n  One potential approach, explored in prior work "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03049","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.03049","created_at":"2026-05-18T00:24:02.165068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03049v1","created_at":"2026-05-18T00:24:02.165068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03049","created_at":"2026-05-18T00:24:02.165068+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3ET6SQY4W35","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3ET6SQY4W353ITQ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3ET6SQY","created_at":"2026-05-18T12:32:46.962924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q3ET6SQY4W353ITQCMNFBDSZJM","json":"https://pith.science/pith/Q3ET6SQY4W353ITQCMNFBDSZJM.json","graph_json":"https://pith.science/api/pith-number/Q3ET6SQY4W353ITQCMNFBDSZJM/graph.json","events_json":"https://pith.science/api/pith-number/Q3ET6SQY4W353ITQCMNFBDSZJM/events.json","paper":"https://pith.science/paper/Q3ET6SQY"},"agent_actions":{"view_html":"https://pith.science/pith/Q3ET6SQY4W353ITQCMNFBDSZJM","download_json":"https://pith.science/pith/Q3ET6SQY4W353ITQCMNFBDSZJM.json","view_paper":"https://pith.science/paper/Q3ET6SQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03049&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3ET6SQY4W353ITQCMNFBDSZJM/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3ET6SQY4W353ITQCMNFBDSZJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3ET6SQY4W353ITQCMNFBDSZJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3ET6SQY4W353ITQCMNFBDSZJM/action/storage_attestation","attest_author":"https://pith.science/pith/Q3ET6SQY4W353ITQCMNFBDSZJM/action/author_attestation","sign_citation":"https://pith.science/pith/Q3ET6SQY4W353ITQCMNFBDSZJM/action/citation_signature","submit_replication":"https://pith.science/pith/Q3ET6SQY4W353ITQCMNFBDSZJM/action/replication_record"}},"created_at":"2026-05-18T00:24:02.165068+00:00","updated_at":"2026-05-18T00:24:02.165068+00:00"}