{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MECSOHMFYJ7KJ6ZTMR7VDWGSZM","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":"c85d252bcf6ee7dd06475ee831518ccc7120a2f4555f69768275debaba288e59","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T15:32:33Z","title_canon_sha256":"1cb5c53a482660043cc0639edef244006ba2996b3716e54823f266329abc4b5f"},"schema_version":"1.0","source":{"id":"1102.2799","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2799","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2799v2","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2799","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"MECSOHMFYJ7K","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MECSOHMFYJ7KJ6ZT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MECSOHMF","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:e1a045cc4a22e49341007e83d0c27e918ee9174d102951051d38cc257141fa70","target":"graph","created_at":"2026-05-18T04:28:38Z","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":"Let $S_n^\\lambda$ be the set of all permutations over the multiset $\\{\\overbrace{1,...,1}^{\\lambda},...,\\overbrace{m,...,m}^\\lambda\\}$ where $n=m\\lambda$. A frequency permutation array (FPA) of minimum distance $d$ is a subset of $S_n^\\lambda$ in which every two elements have distance at least $d$. FPAs have many applications related to error correcting codes. In coding theory, the Gilbert-Varshamov bound and the sphere-packing bound are derived from the size of balls of certain radii. We propose two efficient algorithms that compute the ball size of frequency permutations under Chebyshev dist","authors_text":"Min-Zheng Shieh, Shi-Chun Tsai","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T15:32:33Z","title":"Computing the Ball Size of Frequency Permutations under Chebyshev Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2799","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:e6dd2fa39b0289b8a5ccb566b669f1751861e13672ad8af26372d1c092c66eb3","target":"record","created_at":"2026-05-18T04:28:38Z","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":"c85d252bcf6ee7dd06475ee831518ccc7120a2f4555f69768275debaba288e59","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T15:32:33Z","title_canon_sha256":"1cb5c53a482660043cc0639edef244006ba2996b3716e54823f266329abc4b5f"},"schema_version":"1.0","source":{"id":"1102.2799","kind":"arxiv","version":2}},"canonical_sha256":"6105271d85c27ea4fb33647f51d8d2cb2b6e208805ae5f60944a3fa3232c083a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6105271d85c27ea4fb33647f51d8d2cb2b6e208805ae5f60944a3fa3232c083a","first_computed_at":"2026-05-18T04:28:38.763188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:38.763188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Db6PgZfEtwz0NLC8o+UYRL1J715i6cBbdG80JozwTscR4RdMrFUm/UFq6+ZwMWvjBkiduCco9iriUKGXRpmoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:38.763986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2799","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6dd2fa39b0289b8a5ccb566b669f1751861e13672ad8af26372d1c092c66eb3","sha256:e1a045cc4a22e49341007e83d0c27e918ee9174d102951051d38cc257141fa70"],"state_sha256":"0024e34e2f4fcd223fa29b41e1134b9c81198d250523b60cda193fc5988cbcf9"}