{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VYI74ZWRWMX7GCLW7C4SMNXF2R","short_pith_number":"pith:VYI74ZWR","canonical_record":{"source":{"id":"1802.02049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-06T16:33:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"32159372896238aef6b145bd67697bbdf9d51d9d8c4e73cd4bc53f97eea538f0","abstract_canon_sha256":"6fbd63906d105bae04c916bf997d3f866cf2be0c3fb82b50039631ae88619e1c"},"schema_version":"1.0"},"canonical_sha256":"ae11fe66d1b32ff30976f8b92636e5d47a22b2f609ae834381e2f51a4f830976","source":{"kind":"arxiv","id":"1802.02049","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02049","created_at":"2026-05-18T00:24:11Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02049v1","created_at":"2026-05-18T00:24:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02049","created_at":"2026-05-18T00:24:11Z"},{"alias_kind":"pith_short_12","alias_value":"VYI74ZWRWMX7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VYI74ZWRWMX7GCLW","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VYI74ZWR","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VYI74ZWRWMX7GCLW7C4SMNXF2R","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-06T16:33:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"32159372896238aef6b145bd67697bbdf9d51d9d8c4e73cd4bc53f97eea538f0","abstract_canon_sha256":"6fbd63906d105bae04c916bf997d3f866cf2be0c3fb82b50039631ae88619e1c"},"schema_version":"1.0"},"canonical_sha256":"ae11fe66d1b32ff30976f8b92636e5d47a22b2f609ae834381e2f51a4f830976","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:11.060016Z","signature_b64":"MRaE2EQ9goWDEaSEX7jqNRRMeO3GjgpvAOHiiTVhge+DBV5BNDj4hwuq0deIlZmkSnFXSjQ2cWPkbnAO4fvcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae11fe66d1b32ff30976f8b92636e5d47a22b2f609ae834381e2f51a4f830976","last_reissued_at":"2026-05-18T00:24:11.059338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:11.059338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02049","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-18T00:24:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5vZBPnySvpc3PwtrhlrFWeNOZafvQkUShxf9SKEnlUw+XwI7uVAdLdOsCnFcf/AdscwH1sHrsKoK+dcDgBywBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:55:24.736187Z"},"content_sha256":"037aa2643b35de992ddf177cce254e432f3ba32eb2ea9c4245026d2c0629b9c8","schema_version":"1.0","event_id":"sha256:037aa2643b35de992ddf177cce254e432f3ba32eb2ea9c4245026d2c0629b9c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VYI74ZWRWMX7GCLW7C4SMNXF2R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distance Between Channels: the average error of mismatched channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marcelo Firer, Rafael G. L. D'Oliveira","submitted_at":"2018-02-06T16:33:33Z","abstract_excerpt":"Two channels are equivalent if their maximum likelihood (ML) decoders coincide for every code. We show that this equivalence relation partitions the space of channels into a generalized hyperplane arrangement. With this, we define a coding distance between channels in terms of their ML-decoders which is meaningful from the decoding point of view, in the sense that the closer two channels are, the larger is the probability of them sharing the same ML-decoder. We give explicit formulas for these probabilities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02049","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-18T00:24:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bp7bT4yrV7TjX5R2PHvMTEZb9KIpgnyBT6dueeOJJoo/92oAIG/tJV2bX70MGAYE+7trN3Fpdjsb26vVxSOCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:55:24.736553Z"},"content_sha256":"df7a7654e5a5d7525c7b785f0418ad000a6fca5a011ade51c69f51015f48fae5","schema_version":"1.0","event_id":"sha256:df7a7654e5a5d7525c7b785f0418ad000a6fca5a011ade51c69f51015f48fae5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/bundle.json","state_url":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/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-20T22:55:24Z","links":{"resolver":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R","bundle":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/bundle.json","state":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VYI74ZWRWMX7GCLW7C4SMNXF2R","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":"6fbd63906d105bae04c916bf997d3f866cf2be0c3fb82b50039631ae88619e1c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-06T16:33:33Z","title_canon_sha256":"32159372896238aef6b145bd67697bbdf9d51d9d8c4e73cd4bc53f97eea538f0"},"schema_version":"1.0","source":{"id":"1802.02049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02049","created_at":"2026-05-18T00:24:11Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02049v1","created_at":"2026-05-18T00:24:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02049","created_at":"2026-05-18T00:24:11Z"},{"alias_kind":"pith_short_12","alias_value":"VYI74ZWRWMX7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VYI74ZWRWMX7GCLW","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VYI74ZWR","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:df7a7654e5a5d7525c7b785f0418ad000a6fca5a011ade51c69f51015f48fae5","target":"graph","created_at":"2026-05-18T00:24:11Z","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":"Two channels are equivalent if their maximum likelihood (ML) decoders coincide for every code. We show that this equivalence relation partitions the space of channels into a generalized hyperplane arrangement. With this, we define a coding distance between channels in terms of their ML-decoders which is meaningful from the decoding point of view, in the sense that the closer two channels are, the larger is the probability of them sharing the same ML-decoder. We give explicit formulas for these probabilities.","authors_text":"Marcelo Firer, Rafael G. L. D'Oliveira","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-06T16:33:33Z","title":"A Distance Between Channels: the average error of mismatched channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02049","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:037aa2643b35de992ddf177cce254e432f3ba32eb2ea9c4245026d2c0629b9c8","target":"record","created_at":"2026-05-18T00:24:11Z","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":"6fbd63906d105bae04c916bf997d3f866cf2be0c3fb82b50039631ae88619e1c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-06T16:33:33Z","title_canon_sha256":"32159372896238aef6b145bd67697bbdf9d51d9d8c4e73cd4bc53f97eea538f0"},"schema_version":"1.0","source":{"id":"1802.02049","kind":"arxiv","version":1}},"canonical_sha256":"ae11fe66d1b32ff30976f8b92636e5d47a22b2f609ae834381e2f51a4f830976","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae11fe66d1b32ff30976f8b92636e5d47a22b2f609ae834381e2f51a4f830976","first_computed_at":"2026-05-18T00:24:11.059338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:11.059338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MRaE2EQ9goWDEaSEX7jqNRRMeO3GjgpvAOHiiTVhge+DBV5BNDj4hwuq0deIlZmkSnFXSjQ2cWPkbnAO4fvcCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:11.060016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:037aa2643b35de992ddf177cce254e432f3ba32eb2ea9c4245026d2c0629b9c8","sha256:df7a7654e5a5d7525c7b785f0418ad000a6fca5a011ade51c69f51015f48fae5"],"state_sha256":"c8599a06f8d5e9e03a69afabf32afd78bf129deedb1b3cdad794c370339b13bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCP5Q9B2/3ruzayZE8WqxwKWDei0z2V4Qd17zx3odLAQ8xgw6D5N2hq3X/Ze7C7lJPiq9iCOL5uDXOevHhwVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T22:55:24.738368Z","bundle_sha256":"fae8c26518091ab41dab247d5eaf13ead7a174e564e96a6b63379ce2a56e2bd4"}}