{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:A77UNKEVZFPZXSNJHD5TEWISA5","short_pith_number":"pith:A77UNKEV","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"},"canonical_sha256":"07ff46a895c95f9bc9a938fb325912077494889f0dcd72b2fcef5dcac738a5ca","source":{"kind":"arxiv","id":"2409.06425","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.06425","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"2409.06425v3","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06425","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"A77UNKEVZFPZ","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"A77UNKEVZFPZXSNJ","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"A77UNKEV","created_at":"2026-06-23T03:14:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:A77UNKEVZFPZXSNJHD5TEWISA5","target":"record","payload":{"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"},"canonical_sha256":"07ff46a895c95f9bc9a938fb325912077494889f0dcd72b2fcef5dcac738a5ca","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"},"source_kind":"arxiv","source_id":"2409.06425","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T03:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qu1BPh8w5gNAgyhT4eJ5pgqsw4F475ESP5+IH1jKAH1RWFubYUi9IGGpVTXcaiHLhGdQRmDmIe3oa54a3wKYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:36:45.019261Z"},"content_sha256":"773b407981c63a5460dc91e57f3203ebe2fd1a75b7faf2d23397a8a5a710c8a8","schema_version":"1.0","event_id":"sha256:773b407981c63a5460dc91e57f3203ebe2fd1a75b7faf2d23397a8a5a710c8a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:A77UNKEVZFPZXSNJHD5TEWISA5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T03:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z3+pWd0e0ivAz/yq8S2tqddpWRiX2DlIdsTVAmdqREHfA1qMPJkXMKenCR4hvaO8RjDEqJHloYnStXGlG+sCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:36:45.019691Z"},"content_sha256":"1669aef29e954ab0d214525133b20d8b3e3651794dc210d4da67c7c3d4e41799","schema_version":"1.0","event_id":"sha256:1669aef29e954ab0d214525133b20d8b3e3651794dc210d4da67c7c3d4e41799"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5/bundle.json","state_url":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A77UNKEVZFPZXSNJHD5TEWISA5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T10:36:45Z","links":{"resolver":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5","bundle":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5/bundle.json","state":"https://pith.science/pith/A77UNKEVZFPZXSNJHD5TEWISA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A77UNKEVZFPZXSNJHD5TEWISA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:A77UNKEVZFPZXSNJHD5TEWISA5","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":"d8340af9676462066aa511f75d01ab6850aea0cf858fbda102e1a46cb4d2ba07","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-10T11:15:33Z","title_canon_sha256":"90a29e4cc974312b75ae796c663a87be5cec5a9d95da0893f07b24aa12ebb443"},"schema_version":"1.0","source":{"id":"2409.06425","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.06425","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"2409.06425v3","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06425","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"A77UNKEVZFPZ","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"A77UNKEVZFPZXSNJ","created_at":"2026-06-23T03:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"A77UNKEV","created_at":"2026-06-23T03:14:26Z"}],"graph_snapshots":[{"event_id":"sha256:1669aef29e954ab0d214525133b20d8b3e3651794dc210d4da67c7c3d4e41799","target":"graph","created_at":"2026-06-23T03:14: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/2409.06425/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Maksim Zhukovskii, Oleg Pikhurko, Oleg Verbitsky","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-10T11:15:33Z","title":"New bounds for the optimal density of covering single-insertion codes via the Tur\\'an density"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.06425","kind":"arxiv","version":3},"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:773b407981c63a5460dc91e57f3203ebe2fd1a75b7faf2d23397a8a5a710c8a8","target":"record","created_at":"2026-06-23T03:14: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":"d8340af9676462066aa511f75d01ab6850aea0cf858fbda102e1a46cb4d2ba07","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-10T11:15:33Z","title_canon_sha256":"90a29e4cc974312b75ae796c663a87be5cec5a9d95da0893f07b24aa12ebb443"},"schema_version":"1.0","source":{"id":"2409.06425","kind":"arxiv","version":3}},"canonical_sha256":"07ff46a895c95f9bc9a938fb325912077494889f0dcd72b2fcef5dcac738a5ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07ff46a895c95f9bc9a938fb325912077494889f0dcd72b2fcef5dcac738a5ca","first_computed_at":"2026-06-23T03:14:26.928701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:14:26.928701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K0rsKMnlX1JXXjBCFKJOl6t+uSJsmGTwOy1DSGQjt2WXDvrGIbimvtPeetKK5U6MCxWJ0IpdemhozUUi3cIjDg==","signature_status":"signed_v1","signed_at":"2026-06-23T03:14:26.929078Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.06425","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:773b407981c63a5460dc91e57f3203ebe2fd1a75b7faf2d23397a8a5a710c8a8","sha256:1669aef29e954ab0d214525133b20d8b3e3651794dc210d4da67c7c3d4e41799"],"state_sha256":"8d8fdb85b1469853366965ed09efaaa847d9a0cf6e729705cba0ca02b285b681"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phA7EAWcs37Yhk1LwIG6frzjCLlG6ZtCtqkGuHgiX8JOz24Cq5D7Cpuooe3mBIEMVbjdOQSjLHse7uEontQJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T10:36:45.022112Z","bundle_sha256":"beadee431733ef06813ef2a222785878b3ba54e05df76f1afc6d3044e935ad6f"}}