{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VHR6C7VW5SFA3INWLSNAVOIM7I","short_pith_number":"pith:VHR6C7VW","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"},"canonical_sha256":"a9e3e17eb6ec8a0da1b65c9a0ab90cfa1d5aa33316d2344299cda7b33812f2d6","source":{"kind":"arxiv","id":"2601.12818","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.12818","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2601.12818v2","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.12818","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"VHR6C7VW5SFA","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"VHR6C7VW5SFA3INW","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"VHR6C7VW","created_at":"2026-06-02T02:04:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VHR6C7VW5SFA3INWLSNAVOIM7I","target":"record","payload":{"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"},"canonical_sha256":"a9e3e17eb6ec8a0da1b65c9a0ab90cfa1d5aa33316d2344299cda7b33812f2d6","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"},"source_kind":"arxiv","source_id":"2601.12818","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebJxjTwx3bYc1va1CBoLAE/P/84hGjalUJTqjhow4DTmGyU9uLt3HHgxMXRjRwTyDSUedBRIuR5+XhPWNYbVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:56:34.965607Z"},"content_sha256":"87a548e01a184a188f98af226116b39ad3af50220dfee24b8e109320092aa97d","schema_version":"1.0","event_id":"sha256:87a548e01a184a188f98af226116b39ad3af50220dfee24b8e109320092aa97d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VHR6C7VW5SFA3INWLSNAVOIM7I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXfYIjRtILBtV9lwbI7SQ/Do47Skon+jo2aQb8oFL5WGkI+QlWpTT0gwaDMf52fZUSS1bYW54tmKRNknH93RBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:56:34.965993Z"},"content_sha256":"378fb637253afef00bc4a2b60aef13b9d390b2f325c874789cf4588eae73fb39","schema_version":"1.0","event_id":"sha256:378fb637253afef00bc4a2b60aef13b9d390b2f325c874789cf4588eae73fb39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/bundle.json","state_url":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T22:56:34Z","links":{"resolver":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I","bundle":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/bundle.json","state":"https://pith.science/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHR6C7VW5SFA3INWLSNAVOIM7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VHR6C7VW5SFA3INWLSNAVOIM7I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8ce522818880e0c43b6b45785284dd5ea229fe7d3ddff9a52aed2ddd9e6a4a3d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-01-19T08:24:35Z","title_canon_sha256":"af7484535667d85b0268143ae5c5054d0ea9478021ccdb6312fc60afec72f3dd"},"schema_version":"1.0","source":{"id":"2601.12818","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.12818","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2601.12818v2","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.12818","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"VHR6C7VW5SFA","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"VHR6C7VW5SFA3INW","created_at":"2026-06-02T02:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"VHR6C7VW","created_at":"2026-06-02T02:04:49Z"}],"graph_snapshots":[{"event_id":"sha256:378fb637253afef00bc4a2b60aef13b9d390b2f325c874789cf4588eae73fb39","target":"graph","created_at":"2026-06-02T02:04:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.12818/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Jing Wang, Minjia Shi, Patrick Sol\\'e","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-01-19T08:24:35Z","title":"Perfect codes in weakly metric association schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.12818","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:87a548e01a184a188f98af226116b39ad3af50220dfee24b8e109320092aa97d","target":"record","created_at":"2026-06-02T02:04:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8ce522818880e0c43b6b45785284dd5ea229fe7d3ddff9a52aed2ddd9e6a4a3d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-01-19T08:24:35Z","title_canon_sha256":"af7484535667d85b0268143ae5c5054d0ea9478021ccdb6312fc60afec72f3dd"},"schema_version":"1.0","source":{"id":"2601.12818","kind":"arxiv","version":2}},"canonical_sha256":"a9e3e17eb6ec8a0da1b65c9a0ab90cfa1d5aa33316d2344299cda7b33812f2d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9e3e17eb6ec8a0da1b65c9a0ab90cfa1d5aa33316d2344299cda7b33812f2d6","first_computed_at":"2026-06-02T02:04:49.981759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:49.981759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qHktUGXvPbfG7cfvP/wO+21FW3hYT0LpAqSSc14WOoZQzwZvTaJsC2ce7BqJd5tqjb3NlkzY+5EwQVQNMwbIAA==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:49.982182Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.12818","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87a548e01a184a188f98af226116b39ad3af50220dfee24b8e109320092aa97d","sha256:378fb637253afef00bc4a2b60aef13b9d390b2f325c874789cf4588eae73fb39"],"state_sha256":"7515b7f8f44fe2966e603df60ff98db46ea15fd903a5f9efcdb5a62c870fc7e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DqA6G85Bpqq3qFmMfaY8ZBYGehfklm7gbfotlNqWbhPc15/4crFAnTmGiGnS5IKz9j9+tupo1XZpQL3ZZnQeCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:56:34.968206Z","bundle_sha256":"98b02595ff65265e03e5a9a0ead4381e32c65d3c4f5963644987f16205b64e84"}}