{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A77UNKEVZFPZXSNJHD5TEWISA5","short_pith_number":"pith:A77UNKEV","schema_version":"1.0","canonical_sha256":"07ff46a895c95f9bc9a938fb325912077494889f0dcd72b2fcef5dcac738a5ca","source":{"kind":"arxiv","id":"2409.06425","version":3},"attestation_state":"computed","paper":{"title":"New bounds for the optimal density of covering single-insertion codes via the Tur\\'an density","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii, Oleg Pikhurko, Oleg Verbitsky","submitted_at":"2024-09-10T11:15:33Z","abstract_excerpt":"We prove that the density of any covering single-insertion code $C\\subseteq X^r$ over the $n$-symbol alphabet $X$ cannot be smaller than $1/r+\\delta_r$ for some positive real $\\delta_r$ not depending on $n$. This improves the volume lower bound of $1/(r+1)$. On the other hand, we observe that, for all sufficiently large $r$, if $n$ tends to infinity then the asymptotic upper bound of $7/(r+1)$ due to Lenz et al (2021) can be improved to $4.911/(r+1)$.\n  Both the lower and the upper bounds are achieved by relating the code density to the Tur\\'an density from extremal combinatorics. For the last"},"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":"2409.06425","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-10T11:15:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"90a29e4cc974312b75ae796c663a87be5cec5a9d95da0893f07b24aa12ebb443","abstract_canon_sha256":"d8340af9676462066aa511f75d01ab6850aea0cf858fbda102e1a46cb4d2ba07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:26.929078Z","signature_b64":"K0rsKMnlX1JXXjBCFKJOl6t+uSJsmGTwOy1DSGQjt2WXDvrGIbimvtPeetKK5U6MCxWJ0IpdemhozUUi3cIjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07ff46a895c95f9bc9a938fb325912077494889f0dcd72b2fcef5dcac738a5ca","last_reissued_at":"2026-06-23T03:14:26.928701Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:26.928701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds for the optimal density of covering single-insertion codes via the Tur\\'an density","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii, Oleg Pikhurko, Oleg Verbitsky","submitted_at":"2024-09-10T11:15:33Z","abstract_excerpt":"We prove that the density of any covering single-insertion code $C\\subseteq X^r$ over the $n$-symbol alphabet $X$ cannot be smaller than $1/r+\\delta_r$ for some positive real $\\delta_r$ not depending on $n$. This improves the volume lower bound of $1/(r+1)$. On the other hand, we observe that, for all sufficiently large $r$, if $n$ tends to infinity then the asymptotic upper bound of $7/(r+1)$ due to Lenz et al (2021) can be improved to $4.911/(r+1)$.\n  Both the lower and the upper bounds are achieved by relating the code density to the Tur\\'an density from extremal combinatorics. For the last"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.06425","kind":"arxiv","version":3},"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/2409.06425/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":"2409.06425","created_at":"2026-06-23T03:14:26.928753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.06425v3","created_at":"2026-06-23T03:14:26.928753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06425","created_at":"2026-06-23T03:14:26.928753+00:00"},{"alias_kind":"pith_short_12","alias_value":"A77UNKEVZFPZ","created_at":"2026-06-23T03:14:26.928753+00:00"},{"alias_kind":"pith_short_16","alias_value":"A77UNKEVZFPZXSNJ","created_at":"2026-06-23T03:14:26.928753+00:00"},{"alias_kind":"pith_short_8","alias_value":"A77UNKEV","created_at":"2026-06-23T03:14:26.928753+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/A77UNKEVZFPZXSNJHD5TEWISA5","json":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5.json","graph_json":"https://pith.science/api/pith-number/A77UNKEVZFPZXSNJHD5TEWISA5/graph.json","events_json":"https://pith.science/api/pith-number/A77UNKEVZFPZXSNJHD5TEWISA5/events.json","paper":"https://pith.science/paper/A77UNKEV"},"agent_actions":{"view_html":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5","download_json":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5.json","view_paper":"https://pith.science/paper/A77UNKEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.06425&json=true","fetch_graph":"https://pith.science/api/pith-number/A77UNKEVZFPZXSNJHD5TEWISA5/graph.json","fetch_events":"https://pith.science/api/pith-number/A77UNKEVZFPZXSNJHD5TEWISA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5/action/storage_attestation","attest_author":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5/action/author_attestation","sign_citation":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5/action/citation_signature","submit_replication":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5/action/replication_record"}},"created_at":"2026-06-23T03:14:26.928753+00:00","updated_at":"2026-06-23T03:14:26.928753+00:00"}