{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MPDJXEXA343IXTYWGO5YZHVGFB","short_pith_number":"pith:MPDJXEXA","schema_version":"1.0","canonical_sha256":"63c69b92e0df368bcf1633bb8c9ea6286709be137b1c41b791f481305cde37ed","source":{"kind":"arxiv","id":"1801.04686","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Coding for Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Changho Suh, Hyegyeong Park, Jaekyun Moon, Jy-yong Sohn, Kangwook Lee","submitted_at":"2018-01-15T07:51:15Z","abstract_excerpt":"Coding for distributed computing supports low-latency computation by relieving the burden of straggling workers. While most existing works assume a simple master-worker model, we consider a hierarchical computational structure consisting of groups of workers, motivated by the need to reflect the architectures of real-world distributed computing systems. In this work, we propose a hierarchical coding scheme for this model, as well as analyze its decoding cost and expected computation time. Specifically, we first provide upper and lower bounds on the expected computing time of the proposed schem"},"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":"1801.04686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-15T07:51:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a768903177347e96a029c54d40a2fc995ba91336359d1e5b67bd9854da5c469f","abstract_canon_sha256":"e271960e9a7f6c80bab1a364d9d435b0ab8c919d3f6e7e87796a5bff7edcfba2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.575462Z","signature_b64":"GLt0vzhdc32E0uJAr+yXNWx6fkyFeeaKXp/jq1LzRkb3QQNO5f0YPouiuBSZdWQj3F/QnHdqf74/DMhG04L9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c69b92e0df368bcf1633bb8c9ea6286709be137b1c41b791f481305cde37ed","last_reissued_at":"2026-05-18T00:26:03.574706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.574706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Coding for Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Changho Suh, Hyegyeong Park, Jaekyun Moon, Jy-yong Sohn, Kangwook Lee","submitted_at":"2018-01-15T07:51:15Z","abstract_excerpt":"Coding for distributed computing supports low-latency computation by relieving the burden of straggling workers. While most existing works assume a simple master-worker model, we consider a hierarchical computational structure consisting of groups of workers, motivated by the need to reflect the architectures of real-world distributed computing systems. In this work, we propose a hierarchical coding scheme for this model, as well as analyze its decoding cost and expected computation time. Specifically, we first provide upper and lower bounds on the expected computing time of the proposed schem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04686","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":"1801.04686","created_at":"2026-05-18T00:26:03.574814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04686v1","created_at":"2026-05-18T00:26:03.574814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04686","created_at":"2026-05-18T00:26:03.574814+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPDJXEXA343I","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPDJXEXA343IXTYW","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPDJXEXA","created_at":"2026-05-18T12:32:37.024351+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/MPDJXEXA343IXTYWGO5YZHVGFB","json":"https://pith.science/pith/MPDJXEXA343IXTYWGO5YZHVGFB.json","graph_json":"https://pith.science/api/pith-number/MPDJXEXA343IXTYWGO5YZHVGFB/graph.json","events_json":"https://pith.science/api/pith-number/MPDJXEXA343IXTYWGO5YZHVGFB/events.json","paper":"https://pith.science/paper/MPDJXEXA"},"agent_actions":{"view_html":"https://pith.science/pith/MPDJXEXA343IXTYWGO5YZHVGFB","download_json":"https://pith.science/pith/MPDJXEXA343IXTYWGO5YZHVGFB.json","view_paper":"https://pith.science/paper/MPDJXEXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04686&json=true","fetch_graph":"https://pith.science/api/pith-number/MPDJXEXA343IXTYWGO5YZHVGFB/graph.json","fetch_events":"https://pith.science/api/pith-number/MPDJXEXA343IXTYWGO5YZHVGFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPDJXEXA343IXTYWGO5YZHVGFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPDJXEXA343IXTYWGO5YZHVGFB/action/storage_attestation","attest_author":"https://pith.science/pith/MPDJXEXA343IXTYWGO5YZHVGFB/action/author_attestation","sign_citation":"https://pith.science/pith/MPDJXEXA343IXTYWGO5YZHVGFB/action/citation_signature","submit_replication":"https://pith.science/pith/MPDJXEXA343IXTYWGO5YZHVGFB/action/replication_record"}},"created_at":"2026-05-18T00:26:03.574814+00:00","updated_at":"2026-05-18T00:26:03.574814+00:00"}