{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LXCJKANDZHNFNRBZAIG5DETLXR","short_pith_number":"pith:LXCJKAND","canonical_record":{"source":{"id":"1602.08204","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T05:48:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00af51afb705f69976af1f87adbbf2b62f2b7da89640d62fb83414c8a7483b54","abstract_canon_sha256":"59ebf0b615ab8056abb95028004e6e66394340f9cea374b7fbd1670b87478d6e"},"schema_version":"1.0"},"canonical_sha256":"5dc49501a3c9da56c439020dd1926bbc4e2c76f0c06026a825601f1d71c7e569","source":{"kind":"arxiv","id":"1602.08204","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08204","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08204v3","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08204","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"LXCJKANDZHNF","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXCJKANDZHNFNRBZ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXCJKAND","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LXCJKANDZHNFNRBZAIG5DETLXR","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08204","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T05:48:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00af51afb705f69976af1f87adbbf2b62f2b7da89640d62fb83414c8a7483b54","abstract_canon_sha256":"59ebf0b615ab8056abb95028004e6e66394340f9cea374b7fbd1670b87478d6e"},"schema_version":"1.0"},"canonical_sha256":"5dc49501a3c9da56c439020dd1926bbc4e2c76f0c06026a825601f1d71c7e569","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:46.856912Z","signature_b64":"1nxQTAejdVCup7ZgA07ndlfhh5VJaWerwP04CjW3RFOyo7k9w3QbrBV2Rira3Kd5kPCI8Cd1ZYbEeDFGZ4f1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dc49501a3c9da56c439020dd1926bbc4e2c76f0c06026a825601f1d71c7e569","last_reissued_at":"2026-05-18T00:40:46.856232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:46.856232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08204","source_version":3,"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-05-18T00:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bc3j9SQ1owdU6lI2F16NEaD1NCNLmhHRsjn2gKamDoNeBe5RdSXoD5J5ptSzMzCT96vvLJDN/KFEPPLFainzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:52:10.563235Z"},"content_sha256":"2f65f3ea5d7e4dd49ac6dd8f80f2202d7e5c52a3020a6df8e7dd18356c111c9f","schema_version":"1.0","event_id":"sha256:2f65f3ea5d7e4dd49ac6dd8f80f2202d7e5c52a3020a6df8e7dd18356c111c9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LXCJKANDZHNFNRBZAIG5DETLXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Distributed Computing for Functions with Certain Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shigeaki Kuzuoka, Shun Watanabe","submitted_at":"2016-02-26T05:48:00Z","abstract_excerpt":"The problem of distributed function computation is studied, where functions to be computed is not necessarily symbol-wise. A new method to derive a converse bound for distributed computing is proposed; from the structure of functions to be computed, information that is inevitably conveyed to the decoder is identified, and the bound is derived in terms of the optimal rate needed to send that information. The class of informative functions is introduced, and, for the class of smooth sources, the optimal rate for computing those functions is characterized. Furthermore, for i.i.d. sources with joi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08204","kind":"arxiv","version":3},"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"},"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-05-18T00:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xI70kRMG0bmfy3sKT4aETb/1LJmtQqbVeYCLi6fQmyKfgqgpxDU3QbREiQj627G+npO70O72v4Rr79eJ0kb0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:52:10.563932Z"},"content_sha256":"879d876bc6666874dc3617311b668584de370b1642f52d61a67b9295b5f42feb","schema_version":"1.0","event_id":"sha256:879d876bc6666874dc3617311b668584de370b1642f52d61a67b9295b5f42feb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXCJKANDZHNFNRBZAIG5DETLXR/bundle.json","state_url":"https://pith.science/pith/LXCJKANDZHNFNRBZAIG5DETLXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXCJKANDZHNFNRBZAIG5DETLXR/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-05-27T03:52:10Z","links":{"resolver":"https://pith.science/pith/LXCJKANDZHNFNRBZAIG5DETLXR","bundle":"https://pith.science/pith/LXCJKANDZHNFNRBZAIG5DETLXR/bundle.json","state":"https://pith.science/pith/LXCJKANDZHNFNRBZAIG5DETLXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXCJKANDZHNFNRBZAIG5DETLXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LXCJKANDZHNFNRBZAIG5DETLXR","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":"59ebf0b615ab8056abb95028004e6e66394340f9cea374b7fbd1670b87478d6e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T05:48:00Z","title_canon_sha256":"00af51afb705f69976af1f87adbbf2b62f2b7da89640d62fb83414c8a7483b54"},"schema_version":"1.0","source":{"id":"1602.08204","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08204","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08204v3","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08204","created_at":"2026-05-18T00:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"LXCJKANDZHNF","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXCJKANDZHNFNRBZ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXCJKAND","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:879d876bc6666874dc3617311b668584de370b1642f52d61a67b9295b5f42feb","target":"graph","created_at":"2026-05-18T00:40:46Z","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"},"paper":{"abstract_excerpt":"The problem of distributed function computation is studied, where functions to be computed is not necessarily symbol-wise. A new method to derive a converse bound for distributed computing is proposed; from the structure of functions to be computed, information that is inevitably conveyed to the decoder is identified, and the bound is derived in terms of the optimal rate needed to send that information. The class of informative functions is introduced, and, for the class of smooth sources, the optimal rate for computing those functions is characterized. Furthermore, for i.i.d. sources with joi","authors_text":"Shigeaki Kuzuoka, Shun Watanabe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T05:48:00Z","title":"On Distributed Computing for Functions with Certain Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08204","kind":"arxiv","version":3},"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:2f65f3ea5d7e4dd49ac6dd8f80f2202d7e5c52a3020a6df8e7dd18356c111c9f","target":"record","created_at":"2026-05-18T00:40:46Z","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":"59ebf0b615ab8056abb95028004e6e66394340f9cea374b7fbd1670b87478d6e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T05:48:00Z","title_canon_sha256":"00af51afb705f69976af1f87adbbf2b62f2b7da89640d62fb83414c8a7483b54"},"schema_version":"1.0","source":{"id":"1602.08204","kind":"arxiv","version":3}},"canonical_sha256":"5dc49501a3c9da56c439020dd1926bbc4e2c76f0c06026a825601f1d71c7e569","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dc49501a3c9da56c439020dd1926bbc4e2c76f0c06026a825601f1d71c7e569","first_computed_at":"2026-05-18T00:40:46.856232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:46.856232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1nxQTAejdVCup7ZgA07ndlfhh5VJaWerwP04CjW3RFOyo7k9w3QbrBV2Rira3Kd5kPCI8Cd1ZYbEeDFGZ4f1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:46.856912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08204","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f65f3ea5d7e4dd49ac6dd8f80f2202d7e5c52a3020a6df8e7dd18356c111c9f","sha256:879d876bc6666874dc3617311b668584de370b1642f52d61a67b9295b5f42feb"],"state_sha256":"dbcae12609abd5952a4e93936238300757394846abd18170a008437a304521a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlIbccHFk1SKrFyf9QF6SeJG0Y+KVrvYi5WlZkfpZls5DkyDr6HRW972XgeftfmeVQy9NsYmEaeVIUVomni0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:52:10.567293Z","bundle_sha256":"8e61885e39cb19185a18effc9a3e6accaf85afd1ce7cb0e645dafc9b43fb27c8"}}