{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L56TFYFCV67I2PIMWOUDLH7SJF","short_pith_number":"pith:L56TFYFC","schema_version":"1.0","canonical_sha256":"5f7d32e0a2afbe8d3d0cb3a8359ff249420c7150ba511f805827975e28c65c93","source":{"kind":"arxiv","id":"1712.02985","version":2},"attestation_state":"computed","paper":{"title":"A Classification of Functions in Multiterminal Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shun Watanabe","submitted_at":"2017-12-08T09:04:30Z","abstract_excerpt":"In the distributed function computation problem, dichotomy theorems, initiated by Han-Kobayashi, seek to classify functions by whether the rate regions for function computation improve on the Slepian-Wolf regions or not. In this paper, we develop a general approach to derive converse bounds on the distributed function computation problem. By using this approach, we recover the sufficiency part, i.e. the conditions such that the Slepian-Wolf regions become optimal, of the known dichotomy theorems in the two-terminal distributed computing. Furthermore, we derive an improved sufficient condition "},"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":"1712.02985","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-08T09:04:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98a31678cf7dcc835fc4e9f763074943de333d0a3bd531401e5d18576e0b5f43","abstract_canon_sha256":"b681729ad0ece75b98fea85490a4afa121de13763c1b714add53eb57edc50a94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:39.376658Z","signature_b64":"JcXMJ1lQLuYbJ7Pcpqw7zhWcX/GQqGXq7V1d5g5Wejg01o1TjqGJbWJFxJpugg9trdlX8hTI1W+fWOFZ1w1dAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f7d32e0a2afbe8d3d0cb3a8359ff249420c7150ba511f805827975e28c65c93","last_reissued_at":"2026-05-17T23:59:39.375685Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:39.375685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Classification of Functions in Multiterminal Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shun Watanabe","submitted_at":"2017-12-08T09:04:30Z","abstract_excerpt":"In the distributed function computation problem, dichotomy theorems, initiated by Han-Kobayashi, seek to classify functions by whether the rate regions for function computation improve on the Slepian-Wolf regions or not. In this paper, we develop a general approach to derive converse bounds on the distributed function computation problem. By using this approach, we recover the sufficiency part, i.e. the conditions such that the Slepian-Wolf regions become optimal, of the known dichotomy theorems in the two-terminal distributed computing. Furthermore, we derive an improved sufficient condition "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02985","kind":"arxiv","version":2},"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":"1712.02985","created_at":"2026-05-17T23:59:39.375863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.02985v2","created_at":"2026-05-17T23:59:39.375863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02985","created_at":"2026-05-17T23:59:39.375863+00:00"},{"alias_kind":"pith_short_12","alias_value":"L56TFYFCV67I","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L56TFYFCV67I2PIM","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L56TFYFC","created_at":"2026-05-18T12:31:28.150371+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/L56TFYFCV67I2PIMWOUDLH7SJF","json":"https://pith.science/pith/L56TFYFCV67I2PIMWOUDLH7SJF.json","graph_json":"https://pith.science/api/pith-number/L56TFYFCV67I2PIMWOUDLH7SJF/graph.json","events_json":"https://pith.science/api/pith-number/L56TFYFCV67I2PIMWOUDLH7SJF/events.json","paper":"https://pith.science/paper/L56TFYFC"},"agent_actions":{"view_html":"https://pith.science/pith/L56TFYFCV67I2PIMWOUDLH7SJF","download_json":"https://pith.science/pith/L56TFYFCV67I2PIMWOUDLH7SJF.json","view_paper":"https://pith.science/paper/L56TFYFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.02985&json=true","fetch_graph":"https://pith.science/api/pith-number/L56TFYFCV67I2PIMWOUDLH7SJF/graph.json","fetch_events":"https://pith.science/api/pith-number/L56TFYFCV67I2PIMWOUDLH7SJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L56TFYFCV67I2PIMWOUDLH7SJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L56TFYFCV67I2PIMWOUDLH7SJF/action/storage_attestation","attest_author":"https://pith.science/pith/L56TFYFCV67I2PIMWOUDLH7SJF/action/author_attestation","sign_citation":"https://pith.science/pith/L56TFYFCV67I2PIMWOUDLH7SJF/action/citation_signature","submit_replication":"https://pith.science/pith/L56TFYFCV67I2PIMWOUDLH7SJF/action/replication_record"}},"created_at":"2026-05-17T23:59:39.375863+00:00","updated_at":"2026-05-17T23:59:39.375863+00:00"}