{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VHR6C7VW5SFA3INWLSNAVOIM7I","short_pith_number":"pith:VHR6C7VW","schema_version":"1.0","canonical_sha256":"a9e3e17eb6ec8a0da1b65c9a0ab90cfa1d5aa33316d2344299cda7b33812f2d6","source":{"kind":"arxiv","id":"2601.12818","version":2},"attestation_state":"computed","paper":{"title":"Perfect codes in weakly metric association schemes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Jing Wang, Minjia Shi, Patrick Sol\\'e","submitted_at":"2026-01-19T08:24:35Z","abstract_excerpt":"The Lloyd Theorem of (Sol\\'e, 1989) is combined with the Schwartz-Zippel Lemma of theoretical computer science to derive non-existence results for perfect codes in the Lee metric, NRT metric, mixed Hamming metric, and for the sum-rank distance. The proofs are based on asymptotic enumeration of integer partitions. The framework is the new concept of {\\em polynomial} weakly metric association schemes.\n  A connection between this notion and the recent theory of multivariate P-polynomial schemes of ( Bannai et al. 2025) and of $m$-distance regular graphs ( Bernard et al 2025) is pointed out."},"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":"2601.12818","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-01-19T08:24:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"af7484535667d85b0268143ae5c5054d0ea9478021ccdb6312fc60afec72f3dd","abstract_canon_sha256":"8ce522818880e0c43b6b45785284dd5ea229fe7d3ddff9a52aed2ddd9e6a4a3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:49.982182Z","signature_b64":"qHktUGXvPbfG7cfvP/wO+21FW3hYT0LpAqSSc14WOoZQzwZvTaJsC2ce7BqJd5tqjb3NlkzY+5EwQVQNMwbIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e3e17eb6ec8a0da1b65c9a0ab90cfa1d5aa33316d2344299cda7b33812f2d6","last_reissued_at":"2026-06-02T02:04:49.981759Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:49.981759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect codes in weakly metric association schemes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Jing Wang, Minjia Shi, Patrick Sol\\'e","submitted_at":"2026-01-19T08:24:35Z","abstract_excerpt":"The Lloyd Theorem of (Sol\\'e, 1989) is combined with the Schwartz-Zippel Lemma of theoretical computer science to derive non-existence results for perfect codes in the Lee metric, NRT metric, mixed Hamming metric, and for the sum-rank distance. The proofs are based on asymptotic enumeration of integer partitions. The framework is the new concept of {\\em polynomial} weakly metric association schemes.\n  A connection between this notion and the recent theory of multivariate P-polynomial schemes of ( Bannai et al. 2025) and of $m$-distance regular graphs ( Bernard et al 2025) is pointed out."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.12818","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.12818/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2601.12818","created_at":"2026-06-02T02:04:49.981821+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.12818v2","created_at":"2026-06-02T02:04:49.981821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.12818","created_at":"2026-06-02T02:04:49.981821+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHR6C7VW5SFA","created_at":"2026-06-02T02:04:49.981821+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHR6C7VW5SFA3INW","created_at":"2026-06-02T02:04:49.981821+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHR6C7VW","created_at":"2026-06-02T02:04:49.981821+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.17122","citing_title":"Codes and designs in multivariate $Q$-polynomial association schemes","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I","json":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I.json","graph_json":"https://pith.science/api/pith-number/VHR6C7VW5SFA3INWLSNAVOIM7I/graph.json","events_json":"https://pith.science/api/pith-number/VHR6C7VW5SFA3INWLSNAVOIM7I/events.json","paper":"https://pith.science/paper/VHR6C7VW"},"agent_actions":{"view_html":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I","download_json":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I.json","view_paper":"https://pith.science/paper/VHR6C7VW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.12818&json=true","fetch_graph":"https://pith.science/api/pith-number/VHR6C7VW5SFA3INWLSNAVOIM7I/graph.json","fetch_events":"https://pith.science/api/pith-number/VHR6C7VW5SFA3INWLSNAVOIM7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/action/storage_attestation","attest_author":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/action/author_attestation","sign_citation":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/action/citation_signature","submit_replication":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/action/replication_record"}},"created_at":"2026-06-02T02:04:49.981821+00:00","updated_at":"2026-06-02T02:04:49.981821+00:00"}