{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TRN3J5ARDB2RHBV3U5ICIDS2I7","short_pith_number":"pith:TRN3J5AR","schema_version":"1.0","canonical_sha256":"9c5bb4f41118751386bba750240e5a47d5c0ab2cdea89df2fa4adcf573c8c68a","source":{"kind":"arxiv","id":"1510.03104","version":2},"attestation_state":"computed","paper":{"title":"Channel Metrization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Marcelo Firer, Rafael G. L. D'Oliveira","submitted_at":"2015-10-11T21:25:37Z","abstract_excerpt":"We present an algorithm that, given a channel, determines if there is a distance for it such that the maximum likelihood decoder coincides with the minimum distance decoder.\n  We also show that any metric, up to a decoding equivalence, can be isometrically embedded into the hypercube with the Hamming metric, and thus, in terms of decoding, the Hamming metric is universal."},"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":"1510.03104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-11T21:25:37Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"a643accb409cd9bcfc11fc07036d4c0b7575c872e08f707ec262ac8a72fb6fe0","abstract_canon_sha256":"10907962de5e831a95165678676e9dd9ac67b0a94495486eee2ceb8fdaf59805"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:01.305369Z","signature_b64":"hbGt7SrQt/WnRYdNfbsotYCGOkqyOiA+d4evM6NlO2LIKst/+Lpj7dh4aONzuJ/kzyavmnumPRSZpjKEKL4eDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c5bb4f41118751386bba750240e5a47d5c0ab2cdea89df2fa4adcf573c8c68a","last_reissued_at":"2026-05-18T01:20:01.304611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:01.304611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channel Metrization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Marcelo Firer, Rafael G. L. D'Oliveira","submitted_at":"2015-10-11T21:25:37Z","abstract_excerpt":"We present an algorithm that, given a channel, determines if there is a distance for it such that the maximum likelihood decoder coincides with the minimum distance decoder.\n  We also show that any metric, up to a decoding equivalence, can be isometrically embedded into the hypercube with the Hamming metric, and thus, in terms of decoding, the Hamming metric is universal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03104","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.03104","created_at":"2026-05-18T01:20:01.304729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03104v2","created_at":"2026-05-18T01:20:01.304729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03104","created_at":"2026-05-18T01:20:01.304729+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRN3J5ARDB2R","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRN3J5ARDB2RHBV3","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRN3J5AR","created_at":"2026-05-18T12:29:42.218222+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/TRN3J5ARDB2RHBV3U5ICIDS2I7","json":"https://pith.science/pith/TRN3J5ARDB2RHBV3U5ICIDS2I7.json","graph_json":"https://pith.science/api/pith-number/TRN3J5ARDB2RHBV3U5ICIDS2I7/graph.json","events_json":"https://pith.science/api/pith-number/TRN3J5ARDB2RHBV3U5ICIDS2I7/events.json","paper":"https://pith.science/paper/TRN3J5AR"},"agent_actions":{"view_html":"https://pith.science/pith/TRN3J5ARDB2RHBV3U5ICIDS2I7","download_json":"https://pith.science/pith/TRN3J5ARDB2RHBV3U5ICIDS2I7.json","view_paper":"https://pith.science/paper/TRN3J5AR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03104&json=true","fetch_graph":"https://pith.science/api/pith-number/TRN3J5ARDB2RHBV3U5ICIDS2I7/graph.json","fetch_events":"https://pith.science/api/pith-number/TRN3J5ARDB2RHBV3U5ICIDS2I7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRN3J5ARDB2RHBV3U5ICIDS2I7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRN3J5ARDB2RHBV3U5ICIDS2I7/action/storage_attestation","attest_author":"https://pith.science/pith/TRN3J5ARDB2RHBV3U5ICIDS2I7/action/author_attestation","sign_citation":"https://pith.science/pith/TRN3J5ARDB2RHBV3U5ICIDS2I7/action/citation_signature","submit_replication":"https://pith.science/pith/TRN3J5ARDB2RHBV3U5ICIDS2I7/action/replication_record"}},"created_at":"2026-05-18T01:20:01.304729+00:00","updated_at":"2026-05-18T01:20:01.304729+00:00"}