{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DDTPSXCNTU7ELUBFWBHEA24CBZ","short_pith_number":"pith:DDTPSXCN","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"},"canonical_sha256":"18e6f95c4d9d3e45d025b04e406b820e7cfff04bf9a37f0735010ab5e8a7fb8b","source":{"kind":"arxiv","id":"2405.08732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.08732","created_at":"2026-07-05T08:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"2405.08732v1","created_at":"2026-07-05T08:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08732","created_at":"2026-07-05T08:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"DDTPSXCNTU7E","created_at":"2026-07-05T08:19:04Z"},{"alias_kind":"pith_short_16","alias_value":"DDTPSXCNTU7ELUBF","created_at":"2026-07-05T08:19:04Z"},{"alias_kind":"pith_short_8","alias_value":"DDTPSXCN","created_at":"2026-07-05T08:19:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DDTPSXCNTU7ELUBFWBHEA24CBZ","target":"record","payload":{"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"},"canonical_sha256":"18e6f95c4d9d3e45d025b04e406b820e7cfff04bf9a37f0735010ab5e8a7fb8b","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"},"source_kind":"arxiv","source_id":"2405.08732","source_version":1,"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-05T08:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNYDNNni3a6iM4V4xQe7ryPF7DxSWU7PigyygmH+lK0iHLi8zfh3VK8mhNpMSjPg48OfPM/mlgNyU5T1nWJ8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T19:37:18.294685Z"},"content_sha256":"450ce68592ab9909e0631df3188ca96f4adcd34f42a1672cd6b758796c6f07a0","schema_version":"1.0","event_id":"sha256:450ce68592ab9909e0631df3188ca96f4adcd34f42a1672cd6b758796c6f07a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DDTPSXCNTU7ELUBFWBHEA24CBZ","target":"graph","payload":{"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"},"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-05T08:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdRZ3h8A2tzGeOcI7u+wEdmS2gChqASTnANIZZxndRYyBbieTmXDlx1dI6HtXyDS+oWVmLlr6ZXgtA97SrOTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T19:37:18.295074Z"},"content_sha256":"1b888fe28e1be661e8697dcfd4c74f8217525aafca9124c5cc35b282daaaa3c3","schema_version":"1.0","event_id":"sha256:1b888fe28e1be661e8697dcfd4c74f8217525aafca9124c5cc35b282daaaa3c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/bundle.json","state_url":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/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-07-15T19:37:18Z","links":{"resolver":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ","bundle":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/bundle.json","state":"https://pith.science/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDTPSXCNTU7ELUBFWBHEA24CBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DDTPSXCNTU7ELUBFWBHEA24CBZ","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":"52d5993f2f4f0c581c928516573b3b410fa61e7e3896824451e500e609aac893","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-14T16:17:43Z","title_canon_sha256":"b6164ec4f4b7c74508040b378e68a91162881e82f7e4b74274078a208db99b81"},"schema_version":"1.0","source":{"id":"2405.08732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.08732","created_at":"2026-07-05T08:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"2405.08732v1","created_at":"2026-07-05T08:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08732","created_at":"2026-07-05T08:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"DDTPSXCNTU7E","created_at":"2026-07-05T08:19:04Z"},{"alias_kind":"pith_short_16","alias_value":"DDTPSXCNTU7ELUBF","created_at":"2026-07-05T08:19:04Z"},{"alias_kind":"pith_short_8","alias_value":"DDTPSXCN","created_at":"2026-07-05T08:19:04Z"}],"graph_snapshots":[{"event_id":"sha256:1b888fe28e1be661e8697dcfd4c74f8217525aafca9124c5cc35b282daaaa3c3","target":"graph","created_at":"2026-07-05T08:19:04Z","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/2405.08732/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Berksan Serbetci, Derya Malak, Mohammad Reza Deylam Salehi, Petros Elia","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-14T16:17:43Z","title":"Multi-Server Multi-Function Distributed Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.08732","kind":"arxiv","version":1},"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:450ce68592ab9909e0631df3188ca96f4adcd34f42a1672cd6b758796c6f07a0","target":"record","created_at":"2026-07-05T08:19:04Z","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":"52d5993f2f4f0c581c928516573b3b410fa61e7e3896824451e500e609aac893","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-14T16:17:43Z","title_canon_sha256":"b6164ec4f4b7c74508040b378e68a91162881e82f7e4b74274078a208db99b81"},"schema_version":"1.0","source":{"id":"2405.08732","kind":"arxiv","version":1}},"canonical_sha256":"18e6f95c4d9d3e45d025b04e406b820e7cfff04bf9a37f0735010ab5e8a7fb8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18e6f95c4d9d3e45d025b04e406b820e7cfff04bf9a37f0735010ab5e8a7fb8b","first_computed_at":"2026-07-05T08:19:04.639775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:19:04.639775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yKjlL9ONYEbG14qKS2JHti5hnYII883bOi2L0c7b4g1FUYNNyjN9bR3LVvNDiAwOASD9ndL48SvE5+dGbiGiDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:19:04.640174Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.08732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:450ce68592ab9909e0631df3188ca96f4adcd34f42a1672cd6b758796c6f07a0","sha256:1b888fe28e1be661e8697dcfd4c74f8217525aafca9124c5cc35b282daaaa3c3"],"state_sha256":"2903b1f22ecf5f8cc7eba535193ddb4dc61e0a5f7e528de2dc888098afbdf010"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZDWxucS948wyTWybuz8DyRoCHoo4WHDF96EdN17PzLBr6DR/qUHmulZlIQdvAiPIovUabNdOjXA+H//g6WQyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-15T19:37:18.297231Z","bundle_sha256":"4d148d32c642760f41724254726c820fd3780a0676c099535d8f0c54064404d7"}}