{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:552LNXKRSSECYP54VUFEV2FUJU","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":"23ef0e188e0c6222c56b1a043ce791b06844dca9c75c396c775193e6e49c0b90","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-11T09:55:57Z","title_canon_sha256":"3826cb6c342601130459a1ed347233a65b735cd98dafbf985905b74525b0ae3f"},"schema_version":"1.0","source":{"id":"2406.07112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.07112","created_at":"2026-07-05T08:30:18Z"},{"alias_kind":"arxiv_version","alias_value":"2406.07112v1","created_at":"2026-07-05T08:30:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07112","created_at":"2026-07-05T08:30:18Z"},{"alias_kind":"pith_short_12","alias_value":"552LNXKRSSEC","created_at":"2026-07-05T08:30:18Z"},{"alias_kind":"pith_short_16","alias_value":"552LNXKRSSECYP54","created_at":"2026-07-05T08:30:18Z"},{"alias_kind":"pith_short_8","alias_value":"552LNXKR","created_at":"2026-07-05T08:30:18Z"}],"graph_snapshots":[{"event_id":"sha256:07c5767b2cf60292a2d7af061348c1ade9c2b5617b9d40140a06c8cffee47585","target":"graph","created_at":"2026-07-05T08:30:18Z","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/2406.07112/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An anticode ${\\bf C} \\subset {\\bf F}_q^n$ with the diameter $\\delta$ is a code in ${\\bf F}_q^n$ such that the distance between any two distinct codewords in ${\\bf C}$ is at most $\\delta$. The famous Erd\\\"{o}s-Kleitman bound for a binary anticode ${\\bf C}$ of the length $n$ and the diameter $\\delta$ asserts that $$|{\\bf C}| \\leq \\Sigma_{i=0}^{\\frac{\\delta}{2}} \\displaystyle{n \\choose i}.$$ In this paper, we give an antiGriesmer bound for $q$-ary projective linear anticodes, which is stronger than the above Erd\\\"{o}s-Kleitman bound for binary anticodes. The antiGriesmer bound is a lower bound on","authors_text":"Conghui Xie, Hao Chen","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-11T09:55:57Z","title":"Linear Codes from Projective Linear Anticodes Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07112","kind":"arxiv","version":1},"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:5be3fe9028eb2349dc191f50fbbaba524da7944bd02e0475b7f97dd019e47727","target":"record","created_at":"2026-07-05T08:30:18Z","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":"23ef0e188e0c6222c56b1a043ce791b06844dca9c75c396c775193e6e49c0b90","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-11T09:55:57Z","title_canon_sha256":"3826cb6c342601130459a1ed347233a65b735cd98dafbf985905b74525b0ae3f"},"schema_version":"1.0","source":{"id":"2406.07112","kind":"arxiv","version":1}},"canonical_sha256":"ef74b6dd5194882c3fbcad0a4ae8b44d3189fe8a570de9a394b625d013e7f563","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef74b6dd5194882c3fbcad0a4ae8b44d3189fe8a570de9a394b625d013e7f563","first_computed_at":"2026-07-05T08:30:18.641905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:30:18.641905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bIrK56Eqn3GA1brdvKvjyJtqsuyR8V3X9LyiToe7obBJTaw+24KbhTGujRWXUcay/nHwCNKZpG5oRJjd2QeAAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:30:18.642306Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.07112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5be3fe9028eb2349dc191f50fbbaba524da7944bd02e0475b7f97dd019e47727","sha256:07c5767b2cf60292a2d7af061348c1ade9c2b5617b9d40140a06c8cffee47585"],"state_sha256":"02a5fabfc7ee43abaf340be5a462cfd37cf4c44d094779162a29c8f46793bc5e"}