{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:552LNXKRSSECYP54VUFEV2FUJU","short_pith_number":"pith:552LNXKR","schema_version":"1.0","canonical_sha256":"ef74b6dd5194882c3fbcad0a4ae8b44d3189fe8a570de9a394b625d013e7f563","source":{"kind":"arxiv","id":"2406.07112","version":1},"attestation_state":"computed","paper":{"title":"Linear Codes from Projective Linear Anticodes Revisited","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Conghui Xie, Hao Chen","submitted_at":"2024-06-11T09:55:57Z","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"},"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":"2406.07112","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-06-11T09:55:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3826cb6c342601130459a1ed347233a65b735cd98dafbf985905b74525b0ae3f","abstract_canon_sha256":"23ef0e188e0c6222c56b1a043ce791b06844dca9c75c396c775193e6e49c0b90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:18.642306Z","signature_b64":"bIrK56Eqn3GA1brdvKvjyJtqsuyR8V3X9LyiToe7obBJTaw+24KbhTGujRWXUcay/nHwCNKZpG5oRJjd2QeAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef74b6dd5194882c3fbcad0a4ae8b44d3189fe8a570de9a394b625d013e7f563","last_reissued_at":"2026-07-05T08:30:18.641905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:18.641905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Codes from Projective Linear Anticodes Revisited","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Conghui Xie, Hao Chen","submitted_at":"2024-06-11T09:55:57Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07112","kind":"arxiv","version":1},"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/2406.07112/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":"2406.07112","created_at":"2026-07-05T08:30:18.641958+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.07112v1","created_at":"2026-07-05T08:30:18.641958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07112","created_at":"2026-07-05T08:30:18.641958+00:00"},{"alias_kind":"pith_short_12","alias_value":"552LNXKRSSEC","created_at":"2026-07-05T08:30:18.641958+00:00"},{"alias_kind":"pith_short_16","alias_value":"552LNXKRSSECYP54","created_at":"2026-07-05T08:30:18.641958+00:00"},{"alias_kind":"pith_short_8","alias_value":"552LNXKR","created_at":"2026-07-05T08:30:18.641958+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/552LNXKRSSECYP54VUFEV2FUJU","json":"https://pith.science/pith/552LNXKRSSECYP54VUFEV2FUJU.json","graph_json":"https://pith.science/api/pith-number/552LNXKRSSECYP54VUFEV2FUJU/graph.json","events_json":"https://pith.science/api/pith-number/552LNXKRSSECYP54VUFEV2FUJU/events.json","paper":"https://pith.science/paper/552LNXKR"},"agent_actions":{"view_html":"https://pith.science/pith/552LNXKRSSECYP54VUFEV2FUJU","download_json":"https://pith.science/pith/552LNXKRSSECYP54VUFEV2FUJU.json","view_paper":"https://pith.science/paper/552LNXKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.07112&json=true","fetch_graph":"https://pith.science/api/pith-number/552LNXKRSSECYP54VUFEV2FUJU/graph.json","fetch_events":"https://pith.science/api/pith-number/552LNXKRSSECYP54VUFEV2FUJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/552LNXKRSSECYP54VUFEV2FUJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/552LNXKRSSECYP54VUFEV2FUJU/action/storage_attestation","attest_author":"https://pith.science/pith/552LNXKRSSECYP54VUFEV2FUJU/action/author_attestation","sign_citation":"https://pith.science/pith/552LNXKRSSECYP54VUFEV2FUJU/action/citation_signature","submit_replication":"https://pith.science/pith/552LNXKRSSECYP54VUFEV2FUJU/action/replication_record"}},"created_at":"2026-07-05T08:30:18.641958+00:00","updated_at":"2026-07-05T08:30:18.641958+00:00"}