{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BIQJD2WYDHJZVSOUIJ2XFHQPV6","short_pith_number":"pith:BIQJD2WY","schema_version":"1.0","canonical_sha256":"0a2091ead819d39ac9d44275729e0fafa97201063aaedd868ea441dbadafa509","source":{"kind":"arxiv","id":"2309.04305","version":1},"attestation_state":"computed","paper":{"title":"A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gaojun Luo, Martianus Frederic Ezerman, San Ling, Xiwang Cao, Yingjie Cheng","submitted_at":"2023-09-08T13:07:33Z","abstract_excerpt":"A coded distributed computing (CDC) system aims to reduce the communication load in the MapReduce framework. Such a system has $K$ nodes, $N$ input files, and $Q$ Reduce functions. Each input file is mapped by $r$ nodes and each Reduce function is computed by $s$ nodes. The objective is to achieve the maximum multicast gain. There are known CDC schemes that achieve optimal communication load. In some prominent known schemes, however, $N$ and $Q$ grow too fast in terms of $K$, greatly reducing their gains in practical scenarios. To mitigate the situation, some asymptotically optimal cascaded CD"},"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":"2309.04305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-09-08T13:07:33Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"d8a66f22148e1b0a7ee01f087b60e4993a859d863878cef7f7e34f586424b3f5","abstract_canon_sha256":"309ce0e24a40c297f93b58874960646a8ec3924afde9e98e46519f4dc1a36747"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:48:58.035603Z","signature_b64":"Zgw2v7r1RPh/tLIrrrEmFl98rJJF2MgRXhAYjTy/DU1m11g0tRDJZQCkdJRNsHqnGlareqagoVGfyryIZomKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a2091ead819d39ac9d44275729e0fafa97201063aaedd868ea441dbadafa509","last_reissued_at":"2026-07-05T06:48:58.035090Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:48:58.035090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gaojun Luo, Martianus Frederic Ezerman, San Ling, Xiwang Cao, Yingjie Cheng","submitted_at":"2023-09-08T13:07:33Z","abstract_excerpt":"A coded distributed computing (CDC) system aims to reduce the communication load in the MapReduce framework. Such a system has $K$ nodes, $N$ input files, and $Q$ Reduce functions. Each input file is mapped by $r$ nodes and each Reduce function is computed by $s$ nodes. The objective is to achieve the maximum multicast gain. There are known CDC schemes that achieve optimal communication load. In some prominent known schemes, however, $N$ and $Q$ grow too fast in terms of $K$, greatly reducing their gains in practical scenarios. To mitigate the situation, some asymptotically optimal cascaded CD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.04305","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.04305/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.04305","created_at":"2026-07-05T06:48:58.035142+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.04305v1","created_at":"2026-07-05T06:48:58.035142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.04305","created_at":"2026-07-05T06:48:58.035142+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIQJD2WYDHJZ","created_at":"2026-07-05T06:48:58.035142+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIQJD2WYDHJZVSOU","created_at":"2026-07-05T06:48:58.035142+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIQJD2WY","created_at":"2026-07-05T06:48:58.035142+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/BIQJD2WYDHJZVSOUIJ2XFHQPV6","json":"https://pith.science/pith/BIQJD2WYDHJZVSOUIJ2XFHQPV6.json","graph_json":"https://pith.science/api/pith-number/BIQJD2WYDHJZVSOUIJ2XFHQPV6/graph.json","events_json":"https://pith.science/api/pith-number/BIQJD2WYDHJZVSOUIJ2XFHQPV6/events.json","paper":"https://pith.science/paper/BIQJD2WY"},"agent_actions":{"view_html":"https://pith.science/pith/BIQJD2WYDHJZVSOUIJ2XFHQPV6","download_json":"https://pith.science/pith/BIQJD2WYDHJZVSOUIJ2XFHQPV6.json","view_paper":"https://pith.science/paper/BIQJD2WY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.04305&json=true","fetch_graph":"https://pith.science/api/pith-number/BIQJD2WYDHJZVSOUIJ2XFHQPV6/graph.json","fetch_events":"https://pith.science/api/pith-number/BIQJD2WYDHJZVSOUIJ2XFHQPV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIQJD2WYDHJZVSOUIJ2XFHQPV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIQJD2WYDHJZVSOUIJ2XFHQPV6/action/storage_attestation","attest_author":"https://pith.science/pith/BIQJD2WYDHJZVSOUIJ2XFHQPV6/action/author_attestation","sign_citation":"https://pith.science/pith/BIQJD2WYDHJZVSOUIJ2XFHQPV6/action/citation_signature","submit_replication":"https://pith.science/pith/BIQJD2WYDHJZVSOUIJ2XFHQPV6/action/replication_record"}},"created_at":"2026-07-05T06:48:58.035142+00:00","updated_at":"2026-07-05T06:48:58.035142+00:00"}