{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7FXQMXLVJLQK5HLXLUY6U7DG5S","short_pith_number":"pith:7FXQMXLV","canonical_record":{"source":{"id":"1605.07094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-05-23T17:04:57Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"bbcb2c5e44923903544485d3854805abb338e28d4e119250be22c49248c45995","abstract_canon_sha256":"6e7a7969c1d4036f3efba0cfd21f00e9903275f630465a8e8051ae0b809d1f9f"},"schema_version":"1.0"},"canonical_sha256":"f96f065d754ae0ae9d775d31ea7c66ec8cad42d5227074782412869719065ab9","source":{"kind":"arxiv","id":"1605.07094","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07094","created_at":"2026-05-18T00:47:20Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07094v2","created_at":"2026-05-18T00:47:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07094","created_at":"2026-05-18T00:47:20Z"},{"alias_kind":"pith_short_12","alias_value":"7FXQMXLVJLQK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7FXQMXLVJLQK5HLX","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7FXQMXLV","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7FXQMXLVJLQK5HLXLUY6U7DG5S","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-05-23T17:04:57Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"bbcb2c5e44923903544485d3854805abb338e28d4e119250be22c49248c45995","abstract_canon_sha256":"6e7a7969c1d4036f3efba0cfd21f00e9903275f630465a8e8051ae0b809d1f9f"},"schema_version":"1.0"},"canonical_sha256":"f96f065d754ae0ae9d775d31ea7c66ec8cad42d5227074782412869719065ab9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:20.940076Z","signature_b64":"51bVkbgtmDB6aFdom+dd2PUvDdLfoBBk6EMVWsxa/tnD/MTu7/K17vKP+IgK/i40RBLkVZca+in8vK5s6uAtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f96f065d754ae0ae9d775d31ea7c66ec8cad42d5227074782412869719065ab9","last_reissued_at":"2026-05-18T00:47:20.939537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:20.939537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07094","source_version":2,"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:47:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TgeQYGweqKC+O2FlkwdlPmU3VHRsCaSmuP1LGnYNnSBDClAALjL9E5d7SvejlNhtwq0EV5azybg+0Y/Lox9TDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:08:26.666677Z"},"content_sha256":"5ecaa49ba55198241e5469d14ad78b762ef5615f62e25c7574d3ab507b4c1899","schema_version":"1.0","event_id":"sha256:5ecaa49ba55198241e5469d14ad78b762ef5615f62e25c7574d3ab507b4c1899"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7FXQMXLVJLQK5HLXLUY6U7DG5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the expected minimum error probability in equientropic channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"q-bio.NC","authors_text":"Bernhard Sch\\\"olkopf, Moritz Grosse-Wentrup, Sebastian Weichwald, Tatiana Fomina","submitted_at":"2016-05-23T17:04:57Z","abstract_excerpt":"While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely many bits. In this note, we characterise the quality of a code (i. e. a given encoding routine) by an upper bound on the expected minimum error probability that can be achieved when using this code. We show that for equientropic channels this upper bound is minimal for codes with maximal marginal entropy. As an instructive example we show for the additive wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07094","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"},"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:47:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4yGk8mxblZ8pr9Iebv/9VEFb29XKFfLHmwHD6NwBF+8N6zXldQgwj6NZOdfv+DMnc3jLvfn91vQF36DRZe7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:08:26.667062Z"},"content_sha256":"b9e911ac433212255c5f19e4cbe2f3b1aeb8694ef6f7583b688cbea93b939a12","schema_version":"1.0","event_id":"sha256:b9e911ac433212255c5f19e4cbe2f3b1aeb8694ef6f7583b688cbea93b939a12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FXQMXLVJLQK5HLXLUY6U7DG5S/bundle.json","state_url":"https://pith.science/pith/7FXQMXLVJLQK5HLXLUY6U7DG5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FXQMXLVJLQK5HLXLUY6U7DG5S/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-24T13:08:26Z","links":{"resolver":"https://pith.science/pith/7FXQMXLVJLQK5HLXLUY6U7DG5S","bundle":"https://pith.science/pith/7FXQMXLVJLQK5HLXLUY6U7DG5S/bundle.json","state":"https://pith.science/pith/7FXQMXLVJLQK5HLXLUY6U7DG5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FXQMXLVJLQK5HLXLUY6U7DG5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7FXQMXLVJLQK5HLXLUY6U7DG5S","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":"6e7a7969c1d4036f3efba0cfd21f00e9903275f630465a8e8051ae0b809d1f9f","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-05-23T17:04:57Z","title_canon_sha256":"bbcb2c5e44923903544485d3854805abb338e28d4e119250be22c49248c45995"},"schema_version":"1.0","source":{"id":"1605.07094","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07094","created_at":"2026-05-18T00:47:20Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07094v2","created_at":"2026-05-18T00:47:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07094","created_at":"2026-05-18T00:47:20Z"},{"alias_kind":"pith_short_12","alias_value":"7FXQMXLVJLQK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7FXQMXLVJLQK5HLX","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7FXQMXLV","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:b9e911ac433212255c5f19e4cbe2f3b1aeb8694ef6f7583b688cbea93b939a12","target":"graph","created_at":"2026-05-18T00:47:20Z","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":"While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely many bits. In this note, we characterise the quality of a code (i. e. a given encoding routine) by an upper bound on the expected minimum error probability that can be achieved when using this code. We show that for equientropic channels this upper bound is minimal for codes with maximal marginal entropy. As an instructive example we show for the additive wh","authors_text":"Bernhard Sch\\\"olkopf, Moritz Grosse-Wentrup, Sebastian Weichwald, Tatiana Fomina","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-05-23T17:04:57Z","title":"A note on the expected minimum error probability in equientropic channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07094","kind":"arxiv","version":2},"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:5ecaa49ba55198241e5469d14ad78b762ef5615f62e25c7574d3ab507b4c1899","target":"record","created_at":"2026-05-18T00:47:20Z","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":"6e7a7969c1d4036f3efba0cfd21f00e9903275f630465a8e8051ae0b809d1f9f","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-05-23T17:04:57Z","title_canon_sha256":"bbcb2c5e44923903544485d3854805abb338e28d4e119250be22c49248c45995"},"schema_version":"1.0","source":{"id":"1605.07094","kind":"arxiv","version":2}},"canonical_sha256":"f96f065d754ae0ae9d775d31ea7c66ec8cad42d5227074782412869719065ab9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f96f065d754ae0ae9d775d31ea7c66ec8cad42d5227074782412869719065ab9","first_computed_at":"2026-05-18T00:47:20.939537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:20.939537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"51bVkbgtmDB6aFdom+dd2PUvDdLfoBBk6EMVWsxa/tnD/MTu7/K17vKP+IgK/i40RBLkVZca+in8vK5s6uAtDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:20.940076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07094","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ecaa49ba55198241e5469d14ad78b762ef5615f62e25c7574d3ab507b4c1899","sha256:b9e911ac433212255c5f19e4cbe2f3b1aeb8694ef6f7583b688cbea93b939a12"],"state_sha256":"d7d6b138aa8e3faa56e2cd9403454782312966860c758d71c967fed5febccca1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eg2VOOMpdu5yUbEMzqP/nklTOLas370mp8+er2/OQF6b616fPQSWJka1pjQdT6ZNxNl70letuxmi3ayre6ElDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:08:26.669804Z","bundle_sha256":"ad8ec1b63799c7d2f9fb6f2459f740b0746b633dd53beac477e6620dd01858cf"}}