{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:62EDVM5DAK63POU24FWPBFVOBE","short_pith_number":"pith:62EDVM5D","schema_version":"1.0","canonical_sha256":"f6883ab3a302bdb7ba9ae16cf096ae0900ae608b6dbdb7df9c90212b38e49d22","source":{"kind":"arxiv","id":"1606.02763","version":1},"attestation_state":"computed","paper":{"title":"On Matched Metric and Channel Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Artur Poplawski","submitted_at":"2016-06-08T21:37:15Z","abstract_excerpt":"The sufficient condition for partial function from the cartesian square of the finite set to the reals to be compatible with some metric on this set is given. It is then shown, that when afforementioned set and function are respectively a space of binary words of length n and probalities of receiving some word after sending the other word through Binary Assymetric Channel the condition is satisfied so the required metrics exist."},"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":"1606.02763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-08T21:37:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0d8e543a687617af424b3ffa25557e1ad26abac028fe2801cb9ec290ac3fe927","abstract_canon_sha256":"bd59545971ed8b866605800b85fe161627d3a411b057c6899cf59e7c619ca151"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:40.071804Z","signature_b64":"PbGbiXkqIJbCPjOar125IRmk9AK50hO6tGzpoFM7YG8CgUraVx2ZnINJds9Z7mf+ZeLcFHrgH3FfZb2WZ5GBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6883ab3a302bdb7ba9ae16cf096ae0900ae608b6dbdb7df9c90212b38e49d22","last_reissued_at":"2026-05-18T01:12:40.071458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:40.071458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Matched Metric and Channel Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Artur Poplawski","submitted_at":"2016-06-08T21:37:15Z","abstract_excerpt":"The sufficient condition for partial function from the cartesian square of the finite set to the reals to be compatible with some metric on this set is given. It is then shown, that when afforementioned set and function are respectively a space of binary words of length n and probalities of receiving some word after sending the other word through Binary Assymetric Channel the condition is satisfied so the required metrics exist."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02763","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":"1606.02763","created_at":"2026-05-18T01:12:40.071512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02763v1","created_at":"2026-05-18T01:12:40.071512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02763","created_at":"2026-05-18T01:12:40.071512+00:00"},{"alias_kind":"pith_short_12","alias_value":"62EDVM5DAK63","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"62EDVM5DAK63POU2","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"62EDVM5D","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07730","citing_title":"The Asymmetric Hamming Bidistance and Distributions over Binary Asymmetric Channels","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/62EDVM5DAK63POU24FWPBFVOBE","json":"https://pith.science/pith/62EDVM5DAK63POU24FWPBFVOBE.json","graph_json":"https://pith.science/api/pith-number/62EDVM5DAK63POU24FWPBFVOBE/graph.json","events_json":"https://pith.science/api/pith-number/62EDVM5DAK63POU24FWPBFVOBE/events.json","paper":"https://pith.science/paper/62EDVM5D"},"agent_actions":{"view_html":"https://pith.science/pith/62EDVM5DAK63POU24FWPBFVOBE","download_json":"https://pith.science/pith/62EDVM5DAK63POU24FWPBFVOBE.json","view_paper":"https://pith.science/paper/62EDVM5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02763&json=true","fetch_graph":"https://pith.science/api/pith-number/62EDVM5DAK63POU24FWPBFVOBE/graph.json","fetch_events":"https://pith.science/api/pith-number/62EDVM5DAK63POU24FWPBFVOBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62EDVM5DAK63POU24FWPBFVOBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62EDVM5DAK63POU24FWPBFVOBE/action/storage_attestation","attest_author":"https://pith.science/pith/62EDVM5DAK63POU24FWPBFVOBE/action/author_attestation","sign_citation":"https://pith.science/pith/62EDVM5DAK63POU24FWPBFVOBE/action/citation_signature","submit_replication":"https://pith.science/pith/62EDVM5DAK63POU24FWPBFVOBE/action/replication_record"}},"created_at":"2026-05-18T01:12:40.071512+00:00","updated_at":"2026-05-18T01:12:40.071512+00:00"}