{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2RHXLDTBPH4IPMHXMTATCOETKA","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":"9c36406decc56f6a7c74bd6727753c48ca8381d07633a07ee6006b387fc73f1f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-05T12:11:50Z","title_canon_sha256":"3accf2b0821e574ec6e7f039227e2ccf559301bdc5fe6775536efd5398dca1b9"},"schema_version":"1.0","source":{"id":"1805.02049","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02049","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02049v2","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02049","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"pith_short_12","alias_value":"2RHXLDTBPH4I","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2RHXLDTBPH4IPMHX","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2RHXLDTB","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:f4552df561d9a291c9e57c695ebc7b187fbed1bc6467e03b1792f4e9ff3b138c","target":"graph","created_at":"2026-05-17T23:58:30Z","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"},"paper":{"abstract_excerpt":"We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise asymptotic estimates on the density functions of several classes of codes that are extremal with respect to minimum distance, covering radius, and maximality. The techniques developed in this paper apply to various distance functions, including the Hamming and the rank metric distances. Applications of our results show that, unlike the $\\mathbb{F}_{q^m}$-li","authors_text":"Alberto Ravagnani, Eimear Byrne","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-05T12:11:50Z","title":"Partition-Balanced Families of Codes and Asymptotic Enumeration in Coding Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02049","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:444dbb497fd5482277bdfc6561f4522c5d14fbc21964d7bc24bc57983357b4ac","target":"record","created_at":"2026-05-17T23:58:30Z","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":"9c36406decc56f6a7c74bd6727753c48ca8381d07633a07ee6006b387fc73f1f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-05T12:11:50Z","title_canon_sha256":"3accf2b0821e574ec6e7f039227e2ccf559301bdc5fe6775536efd5398dca1b9"},"schema_version":"1.0","source":{"id":"1805.02049","kind":"arxiv","version":2}},"canonical_sha256":"d44f758e6179f887b0f764c13138935036e3896c9fb8fe534bba939f3239f63f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d44f758e6179f887b0f764c13138935036e3896c9fb8fe534bba939f3239f63f","first_computed_at":"2026-05-17T23:58:30.871775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:30.871775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NqaB5c6k7u2JqOhRdQOSaehOmCGzZJwBDcX9zs4Warg0gBLSM+jasY8yjcnDoQhqlk1bfoXNGkRrkcWsll8dAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:30.872260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02049","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:444dbb497fd5482277bdfc6561f4522c5d14fbc21964d7bc24bc57983357b4ac","sha256:f4552df561d9a291c9e57c695ebc7b187fbed1bc6467e03b1792f4e9ff3b138c"],"state_sha256":"480106c9a24c4016800ff4d209af182fde6e0971d27ddf28426b42e07be5aca9"}