{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IZNWZ7LJHF524FDEUS3NEPZK3C","short_pith_number":"pith:IZNWZ7LJ","schema_version":"1.0","canonical_sha256":"465b6cfd69397bae1464a4b6d23f2ad8baa148ff6f6e443e31f4625e28c0f8bf","source":{"kind":"arxiv","id":"2605.19094","version":1},"attestation_state":"computed","paper":{"title":"A Note on the Asymptotic Least Density of Covering Codes in $[q]^n$","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrey Shapiro","submitted_at":"2026-05-18T20:30:23Z","abstract_excerpt":"In this short note we revisit the upper bound of the asymptotic least density of covering codes of radius $R$ in $[q]^n$ established by Krivelevich, Sudakov, and Vu. We show that by using a slightly different optimization in their core theorem we can obtain a constant factor improvement to their upper bound."},"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":"2605.19094","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T20:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"7e3ffd1681ad66065d3d22fcd26c29d197c7a865e90fb73e9b3142c7f7b4c9fb","abstract_canon_sha256":"e6afe302c0cc36f47972f25174e29261cca74597bbdf83dd794e5fbeafd11941"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:26.927533Z","signature_b64":"dsazDRd4R+iqGu0bhc7Nt52VNl6SXWNUqP7+Dx6dHya9WuturJ+WWOHkux90ezogwycD8jLqnuux2Mo9xoncBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"465b6cfd69397bae1464a4b6d23f2ad8baa148ff6f6e443e31f4625e28c0f8bf","last_reissued_at":"2026-05-20T01:05:26.926784Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:26.926784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Asymptotic Least Density of Covering Codes in $[q]^n$","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrey Shapiro","submitted_at":"2026-05-18T20:30:23Z","abstract_excerpt":"In this short note we revisit the upper bound of the asymptotic least density of covering codes of radius $R$ in $[q]^n$ established by Krivelevich, Sudakov, and Vu. We show that by using a slightly different optimization in their core theorem we can obtain a constant factor improvement to their upper bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19094","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/2605.19094/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":"2605.19094","created_at":"2026-05-20T01:05:26.926902+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19094v1","created_at":"2026-05-20T01:05:26.926902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19094","created_at":"2026-05-20T01:05:26.926902+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZNWZ7LJHF52","created_at":"2026-05-20T01:05:26.926902+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZNWZ7LJHF524FDE","created_at":"2026-05-20T01:05:26.926902+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZNWZ7LJ","created_at":"2026-05-20T01:05:26.926902+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/IZNWZ7LJHF524FDEUS3NEPZK3C","json":"https://pith.science/pith/IZNWZ7LJHF524FDEUS3NEPZK3C.json","graph_json":"https://pith.science/api/pith-number/IZNWZ7LJHF524FDEUS3NEPZK3C/graph.json","events_json":"https://pith.science/api/pith-number/IZNWZ7LJHF524FDEUS3NEPZK3C/events.json","paper":"https://pith.science/paper/IZNWZ7LJ"},"agent_actions":{"view_html":"https://pith.science/pith/IZNWZ7LJHF524FDEUS3NEPZK3C","download_json":"https://pith.science/pith/IZNWZ7LJHF524FDEUS3NEPZK3C.json","view_paper":"https://pith.science/paper/IZNWZ7LJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19094&json=true","fetch_graph":"https://pith.science/api/pith-number/IZNWZ7LJHF524FDEUS3NEPZK3C/graph.json","fetch_events":"https://pith.science/api/pith-number/IZNWZ7LJHF524FDEUS3NEPZK3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZNWZ7LJHF524FDEUS3NEPZK3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZNWZ7LJHF524FDEUS3NEPZK3C/action/storage_attestation","attest_author":"https://pith.science/pith/IZNWZ7LJHF524FDEUS3NEPZK3C/action/author_attestation","sign_citation":"https://pith.science/pith/IZNWZ7LJHF524FDEUS3NEPZK3C/action/citation_signature","submit_replication":"https://pith.science/pith/IZNWZ7LJHF524FDEUS3NEPZK3C/action/replication_record"}},"created_at":"2026-05-20T01:05:26.926902+00:00","updated_at":"2026-05-20T01:05:26.926902+00:00"}