{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LU6CQ7EUOEJAC6AHYMJ2IWZY5B","short_pith_number":"pith:LU6CQ7EU","schema_version":"1.0","canonical_sha256":"5d3c287c947112017807c313a45b38e8516ffb9591121b231f2d5ff4cf4d567c","source":{"kind":"arxiv","id":"1201.1633","version":1},"attestation_state":"computed","paper":{"title":"On the minimality of Hamming compatible metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Othman Echi, Parsa Bakhtary","submitted_at":"2012-01-08T14:55:52Z","abstract_excerpt":"A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric, compute the cardinality of a sphere with respect to this metric, and show this metric is minimal in the class of all \"well-behaved\" Hamming compatible metrics."},"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":"1201.1633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-08T14:55:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de1239fd9cf758a717cd14ec7944e0426e077c5b0efb37bb915f5eda951df335","abstract_canon_sha256":"a84b8c619a622052bb3799700541c5769aa46a11b1e305bf56ad880f1956787e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:02.913562Z","signature_b64":"aiVp9Qmm0q9yw9STHyVLEONFRYJJ7/yqlku8cI3zdKoABKoASyVGZ+FrdHL4BwZwp2RgwUpXq44nAxNiogoBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d3c287c947112017807c313a45b38e8516ffb9591121b231f2d5ff4cf4d567c","last_reissued_at":"2026-05-18T04:05:02.912888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:02.912888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the minimality of Hamming compatible metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Othman Echi, Parsa Bakhtary","submitted_at":"2012-01-08T14:55:52Z","abstract_excerpt":"A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric, compute the cardinality of a sphere with respect to this metric, and show this metric is minimal in the class of all \"well-behaved\" Hamming compatible metrics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1633","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":"1201.1633","created_at":"2026-05-18T04:05:02.912989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1633v1","created_at":"2026-05-18T04:05:02.912989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1633","created_at":"2026-05-18T04:05:02.912989+00:00"},{"alias_kind":"pith_short_12","alias_value":"LU6CQ7EUOEJA","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LU6CQ7EUOEJAC6AH","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LU6CQ7EU","created_at":"2026-05-18T12:27:14.488303+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/LU6CQ7EUOEJAC6AHYMJ2IWZY5B","json":"https://pith.science/pith/LU6CQ7EUOEJAC6AHYMJ2IWZY5B.json","graph_json":"https://pith.science/api/pith-number/LU6CQ7EUOEJAC6AHYMJ2IWZY5B/graph.json","events_json":"https://pith.science/api/pith-number/LU6CQ7EUOEJAC6AHYMJ2IWZY5B/events.json","paper":"https://pith.science/paper/LU6CQ7EU"},"agent_actions":{"view_html":"https://pith.science/pith/LU6CQ7EUOEJAC6AHYMJ2IWZY5B","download_json":"https://pith.science/pith/LU6CQ7EUOEJAC6AHYMJ2IWZY5B.json","view_paper":"https://pith.science/paper/LU6CQ7EU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1633&json=true","fetch_graph":"https://pith.science/api/pith-number/LU6CQ7EUOEJAC6AHYMJ2IWZY5B/graph.json","fetch_events":"https://pith.science/api/pith-number/LU6CQ7EUOEJAC6AHYMJ2IWZY5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LU6CQ7EUOEJAC6AHYMJ2IWZY5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LU6CQ7EUOEJAC6AHYMJ2IWZY5B/action/storage_attestation","attest_author":"https://pith.science/pith/LU6CQ7EUOEJAC6AHYMJ2IWZY5B/action/author_attestation","sign_citation":"https://pith.science/pith/LU6CQ7EUOEJAC6AHYMJ2IWZY5B/action/citation_signature","submit_replication":"https://pith.science/pith/LU6CQ7EUOEJAC6AHYMJ2IWZY5B/action/replication_record"}},"created_at":"2026-05-18T04:05:02.912989+00:00","updated_at":"2026-05-18T04:05:02.912989+00:00"}