{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IZNWZ7LJHF524FDEUS3NEPZK3C","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":"e6afe302c0cc36f47972f25174e29261cca74597bbdf83dd794e5fbeafd11941","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T20:30:23Z","title_canon_sha256":"7e3ffd1681ad66065d3d22fcd26c29d197c7a865e90fb73e9b3142c7f7b4c9fb"},"schema_version":"1.0","source":{"id":"2605.19094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19094","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19094v1","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19094","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"IZNWZ7LJHF52","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"pith_short_16","alias_value":"IZNWZ7LJHF524FDE","created_at":"2026-05-20T01:05:26Z"},{"alias_kind":"pith_short_8","alias_value":"IZNWZ7LJ","created_at":"2026-05-20T01:05:26Z"}],"graph_snapshots":[{"event_id":"sha256:fed19e4a5a806f3e3c02d777bf5efff686b40233d2c67344a67035f7c8322a45","target":"graph","created_at":"2026-05-20T01:05:26Z","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/2605.19094/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Andrey Shapiro","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T20:30:23Z","title":"A Note on the Asymptotic Least Density of Covering Codes in $[q]^n$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19094","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:4157938c95ee42ce662ce8f63ae0b68716d33a18bd5fa595ea6e74ab90ea5102","target":"record","created_at":"2026-05-20T01:05:26Z","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":"e6afe302c0cc36f47972f25174e29261cca74597bbdf83dd794e5fbeafd11941","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T20:30:23Z","title_canon_sha256":"7e3ffd1681ad66065d3d22fcd26c29d197c7a865e90fb73e9b3142c7f7b4c9fb"},"schema_version":"1.0","source":{"id":"2605.19094","kind":"arxiv","version":1}},"canonical_sha256":"465b6cfd69397bae1464a4b6d23f2ad8baa148ff6f6e443e31f4625e28c0f8bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"465b6cfd69397bae1464a4b6d23f2ad8baa148ff6f6e443e31f4625e28c0f8bf","first_computed_at":"2026-05-20T01:05:26.926784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:26.926784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dsazDRd4R+iqGu0bhc7Nt52VNl6SXWNUqP7+Dx6dHya9WuturJ+WWOHkux90ezogwycD8jLqnuux2Mo9xoncBA==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:26.927533Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4157938c95ee42ce662ce8f63ae0b68716d33a18bd5fa595ea6e74ab90ea5102","sha256:fed19e4a5a806f3e3c02d777bf5efff686b40233d2c67344a67035f7c8322a45"],"state_sha256":"abaa6f48c3ace60ae5d69cfa16772e94e6f857d4134de4e5238c18607fafba39"}