{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VYI74ZWRWMX7GCLW7C4SMNXF2R","short_pith_number":"pith:VYI74ZWR","schema_version":"1.0","canonical_sha256":"ae11fe66d1b32ff30976f8b92636e5d47a22b2f609ae834381e2f51a4f830976","source":{"kind":"arxiv","id":"1802.02049","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.02049","created_at":"2026-05-18T00:24:11.059447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02049v1","created_at":"2026-05-18T00:24:11.059447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02049","created_at":"2026-05-18T00:24:11.059447+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYI74ZWRWMX7","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYI74ZWRWMX7GCLW","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYI74ZWR","created_at":"2026-05-18T12:32:59.047623+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/VYI74ZWRWMX7GCLW7C4SMNXF2R","json":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R.json","graph_json":"https://pith.science/api/pith-number/VYI74ZWRWMX7GCLW7C4SMNXF2R/graph.json","events_json":"https://pith.science/api/pith-number/VYI74ZWRWMX7GCLW7C4SMNXF2R/events.json","paper":"https://pith.science/paper/VYI74ZWR"},"agent_actions":{"view_html":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R","download_json":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R.json","view_paper":"https://pith.science/paper/VYI74ZWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02049&json=true","fetch_graph":"https://pith.science/api/pith-number/VYI74ZWRWMX7GCLW7C4SMNXF2R/graph.json","fetch_events":"https://pith.science/api/pith-number/VYI74ZWRWMX7GCLW7C4SMNXF2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/action/storage_attestation","attest_author":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/action/author_attestation","sign_citation":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/action/citation_signature","submit_replication":"https://pith.science/pith/VYI74ZWRWMX7GCLW7C4SMNXF2R/action/replication_record"}},"created_at":"2026-05-18T00:24:11.059447+00:00","updated_at":"2026-05-18T00:24:11.059447+00:00"}