{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B5E37ETRLHEPXMEA7G3CHAVWPM","short_pith_number":"pith:B5E37ETR","canonical_record":{"source":{"id":"1502.02971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T16:28:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"423dd89c106eaf46b661791238ae19c5975101ac75c85df1cda6897bfb013c57","abstract_canon_sha256":"346d420121c90cd8627bd6442d0408a5a84eca80eea086563b6a7c05365494ba"},"schema_version":"1.0"},"canonical_sha256":"0f49bf927159c8fbb080f9b62382b67b28814f175081ed354593f4a8e475e8a3","source":{"kind":"arxiv","id":"1502.02971","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02971","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02971v1","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02971","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"B5E37ETRLHEP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B5E37ETRLHEPXMEA","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B5E37ETR","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B5E37ETRLHEPXMEA7G3CHAVWPM","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T16:28:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"423dd89c106eaf46b661791238ae19c5975101ac75c85df1cda6897bfb013c57","abstract_canon_sha256":"346d420121c90cd8627bd6442d0408a5a84eca80eea086563b6a7c05365494ba"},"schema_version":"1.0"},"canonical_sha256":"0f49bf927159c8fbb080f9b62382b67b28814f175081ed354593f4a8e475e8a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:30.145010Z","signature_b64":"TO15nEotStYQa7FklIjeZLhnUIBzZW7bTxG6758P0Z41aQ5MugnNUdWVFYy/biD2Q50Oq8uVTFzVqM6v3G2ECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f49bf927159c8fbb080f9b62382b67b28814f175081ed354593f4a8e475e8a3","last_reissued_at":"2026-05-18T02:27:30.144166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:30.144166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02971","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-05-18T02:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRYVNY0v74FXjiB6qe8bQ5SiCfzPEvTRxLYd/TJhoKjzXN31GxqKreP5lq1tMTbV0luoAkYjrmcvaEAzS4f/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:14:36.916434Z"},"content_sha256":"83273b56e4a7b0013435b5ce176e82f812d0a2e5bb0acc3c7798595a44b11cc3","schema_version":"1.0","event_id":"sha256:83273b56e4a7b0013435b5ce176e82f812d0a2e5bb0acc3c7798595a44b11cc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B5E37ETRLHEPXMEA7G3CHAVWPM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information complexity is computable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jon Schneider, Mark Braverman","submitted_at":"2015-02-10T16:28:02Z","abstract_excerpt":"The information complexity of a function $f$ is the minimum amount of information Alice and Bob need to exchange to compute the function $f$. In this paper we provide an algorithm for approximating the information complexity of an arbitrary function $f$ to within any additive error $\\alpha > 0$, thus resolving an open question as to whether information complexity is computable.\n  In the process, we give the first explicit upper bound on the rate of convergence of the information complexity of $f$ when restricted to $b$-bit protocols to the (unrestricted) information complexity of $f$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02971","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":""},"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-18T02:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gEzw9Yhq9/edy9rimcUhtSv0dJbYvLsDXLZUpk7TfxEjI9tdY3FOy2ybbpj1PB180JD8dudxJt/h9RBJUUJkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:14:36.917132Z"},"content_sha256":"dfe635f1d58b04671f00759ba171643b271cc1d120352290f1d41578f10d08d6","schema_version":"1.0","event_id":"sha256:dfe635f1d58b04671f00759ba171643b271cc1d120352290f1d41578f10d08d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5E37ETRLHEPXMEA7G3CHAVWPM/bundle.json","state_url":"https://pith.science/pith/B5E37ETRLHEPXMEA7G3CHAVWPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5E37ETRLHEPXMEA7G3CHAVWPM/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-06-11T21:14:36Z","links":{"resolver":"https://pith.science/pith/B5E37ETRLHEPXMEA7G3CHAVWPM","bundle":"https://pith.science/pith/B5E37ETRLHEPXMEA7G3CHAVWPM/bundle.json","state":"https://pith.science/pith/B5E37ETRLHEPXMEA7G3CHAVWPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5E37ETRLHEPXMEA7G3CHAVWPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B5E37ETRLHEPXMEA7G3CHAVWPM","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":"346d420121c90cd8627bd6442d0408a5a84eca80eea086563b6a7c05365494ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T16:28:02Z","title_canon_sha256":"423dd89c106eaf46b661791238ae19c5975101ac75c85df1cda6897bfb013c57"},"schema_version":"1.0","source":{"id":"1502.02971","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02971","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02971v1","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02971","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"B5E37ETRLHEP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B5E37ETRLHEPXMEA","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B5E37ETR","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:dfe635f1d58b04671f00759ba171643b271cc1d120352290f1d41578f10d08d6","target":"graph","created_at":"2026-05-18T02:27:30Z","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 information complexity of a function $f$ is the minimum amount of information Alice and Bob need to exchange to compute the function $f$. In this paper we provide an algorithm for approximating the information complexity of an arbitrary function $f$ to within any additive error $\\alpha > 0$, thus resolving an open question as to whether information complexity is computable.\n  In the process, we give the first explicit upper bound on the rate of convergence of the information complexity of $f$ when restricted to $b$-bit protocols to the (unrestricted) information complexity of $f$.","authors_text":"Jon Schneider, Mark Braverman","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T16:28:02Z","title":"Information complexity is computable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02971","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:83273b56e4a7b0013435b5ce176e82f812d0a2e5bb0acc3c7798595a44b11cc3","target":"record","created_at":"2026-05-18T02:27:30Z","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":"346d420121c90cd8627bd6442d0408a5a84eca80eea086563b6a7c05365494ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T16:28:02Z","title_canon_sha256":"423dd89c106eaf46b661791238ae19c5975101ac75c85df1cda6897bfb013c57"},"schema_version":"1.0","source":{"id":"1502.02971","kind":"arxiv","version":1}},"canonical_sha256":"0f49bf927159c8fbb080f9b62382b67b28814f175081ed354593f4a8e475e8a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f49bf927159c8fbb080f9b62382b67b28814f175081ed354593f4a8e475e8a3","first_computed_at":"2026-05-18T02:27:30.144166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:30.144166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TO15nEotStYQa7FklIjeZLhnUIBzZW7bTxG6758P0Z41aQ5MugnNUdWVFYy/biD2Q50Oq8uVTFzVqM6v3G2ECg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:30.145010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02971","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83273b56e4a7b0013435b5ce176e82f812d0a2e5bb0acc3c7798595a44b11cc3","sha256:dfe635f1d58b04671f00759ba171643b271cc1d120352290f1d41578f10d08d6"],"state_sha256":"7fb7c491591b2fe0fb4d2285b913533ec79c9bf5283b342c81384f778d0ce8ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FDzuF83wzV6YakaCduNX7gVyiAu4zGC8IBPkJYrRf4oF+EuoUsESuPxJJdFpl0qxP4Fse0S0OuszBSz/35OCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:14:36.921102Z","bundle_sha256":"233e666206ba1db3e362f74917d0b9864be7fac9ffacf6a3c656ad3df8e9a3b3"}}