{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DDTPSXCNTU7ELUBFWBHEA24CBZ","short_pith_number":"pith:DDTPSXCN","schema_version":"1.0","canonical_sha256":"18e6f95c4d9d3e45d025b04e406b820e7cfff04bf9a37f0735010ab5e8a7fb8b","source":{"kind":"arxiv","id":"2405.08732","version":1},"attestation_state":"computed","paper":{"title":"Multi-Server Multi-Function Distributed Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Berksan Serbetci, Derya Malak, Mohammad Reza Deylam Salehi, Petros Elia","submitted_at":"2024-05-14T16:17:43Z","abstract_excerpt":"The work here studies the communication cost for a multi-server multi-task distributed computation framework, and does so for a broad class of functions and data statistics. Considering the framework where a user seeks the computation of multiple complex (conceivably non-linear) tasks from a set of distributed servers, we establish communication cost upper bounds for a variety of data statistics, function classes and data placements across the servers. To do so, we proceed to apply, for the first time here, K\\\"orner's characteristic graph approach -- which is known to capture the structural pr"},"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":"2405.08732","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-14T16:17:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6164ec4f4b7c74508040b378e68a91162881e82f7e4b74274078a208db99b81","abstract_canon_sha256":"52d5993f2f4f0c581c928516573b3b410fa61e7e3896824451e500e609aac893"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:19:04.640174Z","signature_b64":"yKjlL9ONYEbG14qKS2JHti5hnYII883bOi2L0c7b4g1FUYNNyjN9bR3LVvNDiAwOASD9ndL48SvE5+dGbiGiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18e6f95c4d9d3e45d025b04e406b820e7cfff04bf9a37f0735010ab5e8a7fb8b","last_reissued_at":"2026-07-05T08:19:04.639775Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:19:04.639775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Server Multi-Function Distributed Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Berksan Serbetci, Derya Malak, Mohammad Reza Deylam Salehi, Petros Elia","submitted_at":"2024-05-14T16:17:43Z","abstract_excerpt":"The work here studies the communication cost for a multi-server multi-task distributed computation framework, and does so for a broad class of functions and data statistics. Considering the framework where a user seeks the computation of multiple complex (conceivably non-linear) tasks from a set of distributed servers, we establish communication cost upper bounds for a variety of data statistics, function classes and data placements across the servers. To do so, we proceed to apply, for the first time here, K\\\"orner's characteristic graph approach -- which is known to capture the structural pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.08732","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/2405.08732/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":"2405.08732","created_at":"2026-07-05T08:19:04.639833+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.08732v1","created_at":"2026-07-05T08:19:04.639833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08732","created_at":"2026-07-05T08:19:04.639833+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDTPSXCNTU7E","created_at":"2026-07-05T08:19:04.639833+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDTPSXCNTU7ELUBF","created_at":"2026-07-05T08:19:04.639833+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDTPSXCN","created_at":"2026-07-05T08:19:04.639833+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/DDTPSXCNTU7ELUBFWBHEA24CBZ","json":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ.json","graph_json":"https://pith.science/api/pith-number/DDTPSXCNTU7ELUBFWBHEA24CBZ/graph.json","events_json":"https://pith.science/api/pith-number/DDTPSXCNTU7ELUBFWBHEA24CBZ/events.json","paper":"https://pith.science/paper/DDTPSXCN"},"agent_actions":{"view_html":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ","download_json":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ.json","view_paper":"https://pith.science/paper/DDTPSXCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.08732&json=true","fetch_graph":"https://pith.science/api/pith-number/DDTPSXCNTU7ELUBFWBHEA24CBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DDTPSXCNTU7ELUBFWBHEA24CBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/action/storage_attestation","attest_author":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/action/author_attestation","sign_citation":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/action/citation_signature","submit_replication":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/action/replication_record"}},"created_at":"2026-07-05T08:19:04.639833+00:00","updated_at":"2026-07-05T08:19:04.639833+00:00"}