{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:M5FH54S37MFHRDIOCOQA4LR5FV","short_pith_number":"pith:M5FH54S3","canonical_record":{"source":{"id":"2607.28281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T14:30:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41a342cc90c25c604f1690f9d7cd9762c96327cb2f15135419e10e69ffb07fbb","abstract_canon_sha256":"ede170be2be203b242d18d57f63b2b41e95e20a7e3ec0a4f67ff2e50c4602daf"},"schema_version":"1.0"},"canonical_sha256":"674a7ef25bfb0a788d0e13a00e2e3d2d6669cd29981a45b0503adf7bb53c371b","source":{"kind":"arxiv","id":"2607.28281","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:M5FH54S37MFHRDIOCOQA4LR5FV","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T14:30:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41a342cc90c25c604f1690f9d7cd9762c96327cb2f15135419e10e69ffb07fbb","abstract_canon_sha256":"ede170be2be203b242d18d57f63b2b41e95e20a7e3ec0a4f67ff2e50c4602daf"},"schema_version":"1.0"},"canonical_sha256":"674a7ef25bfb0a788d0e13a00e2e3d2d6669cd29981a45b0503adf7bb53c371b","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"674a7ef25bfb0a788d0e13a00e2e3d2d6669cd29981a45b0503adf7bb53c371b","last_reissued_at":"2026-07-31T01:37:08.250344Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:37:08.250344Z"},"source_kind":"arxiv","source_id":"2607.28281","source_version":1,"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-07-31T01:37:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ha8AzwTeCwDiZia7hiumY4KXD/TLr1u5bWodtSqK6C3laKl+zhHW67NIp5FJ6iRRpNEi/ZE39Xf/4G+EJR6CDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T12:48:16.010335Z"},"content_sha256":"dab1f6baa81e82726e74b603920c365931e97e67185bf9ca38ed319b17631a02","schema_version":"1.0","event_id":"sha256:dab1f6baa81e82726e74b603920c365931e97e67185bf9ca38ed319b17631a02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:M5FH54S37MFHRDIOCOQA4LR5FV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Capacity of a Family of Sticky Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mladen Kova\\v{c}evi\\'{c}","submitted_at":"2026-07-30T14:30:15Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28281","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/2607.28281/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-07-31T01:37:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pGffz/Dx50iA9CzQcyuvGMFZCYiaiqOtPT8j6HcBWVPt5kWsYAiX+fHXE33V3zh6W/gdT7WPU5qnKuW05vCNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T12:48:16.010718Z"},"content_sha256":"b906af4fb9547f892be9cc69c528ef23b1a5927387999ca26faf87ff4e2427a5","schema_version":"1.0","event_id":"sha256:b906af4fb9547f892be9cc69c528ef23b1a5927387999ca26faf87ff4e2427a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5FH54S37MFHRDIOCOQA4LR5FV/bundle.json","state_url":"https://pith.science/pith/M5FH54S37MFHRDIOCOQA4LR5FV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5FH54S37MFHRDIOCOQA4LR5FV/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-08-02T12:48:16Z","links":{"resolver":"https://pith.science/pith/M5FH54S37MFHRDIOCOQA4LR5FV","bundle":"https://pith.science/pith/M5FH54S37MFHRDIOCOQA4LR5FV/bundle.json","state":"https://pith.science/pith/M5FH54S37MFHRDIOCOQA4LR5FV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5FH54S37MFHRDIOCOQA4LR5FV/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4JmI8K5xH6brD6MKymHlCP6UDWvKP3sHtEmd5rmRDl1FP0kZqHEVOtkEH3UfjnK1O0lGBwu1ktoMlRXGIpTfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T12:48:16.013285Z","bundle_sha256":"a54f7e25efc927cab2553b043477d1c847d509fb395dd9e8692eea89ef7f27cc"}}