{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:M5FH54S37MFHRDIOCOQA4LR5FV","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":"ede170be2be203b242d18d57f63b2b41e95e20a7e3ec0a4f67ff2e50c4602daf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T14:30:15Z","title_canon_sha256":"41a342cc90c25c604f1690f9d7cd9762c96327cb2f15135419e10e69ffb07fbb"},"schema_version":"1.0","source":{"id":"2607.28281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28281","created_at":"2026-07-31T01:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28281v1","created_at":"2026-07-31T01:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28281","created_at":"2026-07-31T01:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"M5FH54S37MFH","created_at":"2026-07-31T01:37:08Z"},{"alias_kind":"pith_short_16","alias_value":"M5FH54S37MFHRDIO","created_at":"2026-07-31T01:37:08Z"},{"alias_kind":"pith_short_8","alias_value":"M5FH54S3","created_at":"2026-07-31T01:37:08Z"}],"graph_snapshots":[{"event_id":"sha256:b906af4fb9547f892be9cc69c528ef23b1a5927387999ca26faf87ff4e2427a5","target":"graph","created_at":"2026-07-31T01:37:08Z","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/2607.28281/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We determine the capacity of a family of $q$-ary sticky-insertion channels. Fix $q\\geq2$ and $d\\geq1$, and let $\\lambda$ be the unique positive solution of $\\lambda^d = (q-1) (\\lambda^{d-1} + \\cdots + \\lambda + 1 )$. We prove that, for every repetition law supported on $1+d\\mathbb{Z}_{\\geq0}$ and satisfying a coefficientwise-domination criterion with domination constant $\\gamma\\geq\\lambda^{-d}$, the Shannon capacity equals the zero-error capacity, both being $\\log_2\\lambda$ bits per symbol. We also exhibit explicit repetition laws satisfying these conditions, one of which is given by the weigh","authors_text":"Mladen Kova\\v{c}evi\\'{c}","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28281","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:dab1f6baa81e82726e74b603920c365931e97e67185bf9ca38ed319b17631a02","target":"record","created_at":"2026-07-31T01:37:08Z","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":"ede170be2be203b242d18d57f63b2b41e95e20a7e3ec0a4f67ff2e50c4602daf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T14:30:15Z","title_canon_sha256":"41a342cc90c25c604f1690f9d7cd9762c96327cb2f15135419e10e69ffb07fbb"},"schema_version":"1.0","source":{"id":"2607.28281","kind":"arxiv","version":1}},"canonical_sha256":"674a7ef25bfb0a788d0e13a00e2e3d2d6669cd29981a45b0503adf7bb53c371b","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"674a7ef25bfb0a788d0e13a00e2e3d2d6669cd29981a45b0503adf7bb53c371b","first_computed_at":"2026-07-31T01:37:08.250344Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:37:08.250344Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dab1f6baa81e82726e74b603920c365931e97e67185bf9ca38ed319b17631a02","sha256:b906af4fb9547f892be9cc69c528ef23b1a5927387999ca26faf87ff4e2427a5"],"state_sha256":"73d9ce8ff90a9992d4603ff1819e6f8298042f94c58856feb5bf0b7556b280cb"}