{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VZIOS55IPHLUWWNURZJVQ7LKS3","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":"2028f0bad261d67f57cc9e5d092714ca846457914b2d92716cc1c8c4ad3a622d","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-09T18:53:56Z","title_canon_sha256":"4aead488153e26944c2d0ad1b7f928065f07840139569a0915583c5e55206ca4"},"schema_version":"1.0","source":{"id":"2605.09113","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.09113","created_at":"2026-05-22T01:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.09113v2","created_at":"2026-05-22T01:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09113","created_at":"2026-05-22T01:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"VZIOS55IPHLU","created_at":"2026-05-22T01:04:05Z"},{"alias_kind":"pith_short_16","alias_value":"VZIOS55IPHLUWWNU","created_at":"2026-05-22T01:04:05Z"},{"alias_kind":"pith_short_8","alias_value":"VZIOS55I","created_at":"2026-05-22T01:04:05Z"}],"graph_snapshots":[{"event_id":"sha256:e158174280330d74f7e59f7fe8f64b8350f862431dbcbffb74399cd481969318","target":"graph","created_at":"2026-05-22T01:04:05Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We propose a capacity-achieving construction of a weakly constrained codebook based on Eulerian cycles. We then obtain, via expurgation, weakly constrained codes with linear minimum distance and positive rate, and analyze the rates achievable. Finally, we propose a practical concatenated code construction that supports polynomial-time encoding and decoding."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the Eulerian cycle construction exactly meets the frequency prescriptions at capacity and that expurgation can be performed without violating the weak constraints or dropping the rate below positive while achieving linear distance."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Weakly constrained codes achieve capacity via Eulerian cycle constructions and support error correction with linear distance and positive rate through expurgation and concatenation."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Weakly constrained codes achieve capacity using Eulerian cycle constructions on graphs and yield positive-rate error-correcting versions after expurgation."}],"snapshot_sha256":"45b2184df5552ae16d964ac410e2d6e4acb4acd3876f16954dbd3fb08d8f70cd"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T08:22:01.657889Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T20:37:45.898849Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T13:31:18.814540Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T10:30:38.884512Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.09113/integrity.json","findings":[],"snapshot_sha256":"422841b6419b488af12f4d4f0cca9c7e6699b86e6bb006f02e7fcb4a6a30e0e8","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly constrained codebook based on Eulerian cycles. We then obtain, via expurgation, weakly constrained codes with linear minimum distance and positive rate, and analyze the rates achievable. Finally, we propose a practical concatenated code construction that supports polynomial-time encoding and decoding.","authors_text":"Michael Langberg, Navin Kashyap, Prachi Mishra, Sidharth Jaggi","cross_cats":["math.IT"],"headline":"Weakly constrained codes achieve capacity using Eulerian cycle constructions on graphs and yield positive-rate error-correcting versions after expurgation.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-09T18:53:56Z","title":"Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.09113","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T02:07:29.612355Z","id":"cef8441a-865c-420e-ba89-8cd734f6874e","model_set":{"reader":"grok-4.3"},"one_line_summary":"Weakly constrained codes achieve capacity via Eulerian cycle constructions and support error correction with linear distance and positive rate through expurgation and concatenation.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Weakly constrained codes achieve capacity using Eulerian cycle constructions on graphs and yield positive-rate error-correcting versions after expurgation.","strongest_claim":"We propose a capacity-achieving construction of a weakly constrained codebook based on Eulerian cycles. We then obtain, via expurgation, weakly constrained codes with linear minimum distance and positive rate, and analyze the rates achievable. Finally, we propose a practical concatenated code construction that supports polynomial-time encoding and decoding.","weakest_assumption":"That the Eulerian cycle construction exactly meets the frequency prescriptions at capacity and that expurgation can be performed without violating the weak constraints or dropping the rate below positive while achieving linear distance."}},"verdict_id":"cef8441a-865c-420e-ba89-8cd734f6874e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:73325e0ff33d343b8fa37a339686802a12eecc2609894cf1fe472e0c81a0e665","target":"record","created_at":"2026-05-22T01:04:05Z","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":"2028f0bad261d67f57cc9e5d092714ca846457914b2d92716cc1c8c4ad3a622d","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-09T18:53:56Z","title_canon_sha256":"4aead488153e26944c2d0ad1b7f928065f07840139569a0915583c5e55206ca4"},"schema_version":"1.0","source":{"id":"2605.09113","kind":"arxiv","version":2}},"canonical_sha256":"ae50e977a879d74b59b48e53587d6a96d8e9b8822dbf4c0992111037952d9cdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae50e977a879d74b59b48e53587d6a96d8e9b8822dbf4c0992111037952d9cdf","first_computed_at":"2026-05-22T01:04:05.753785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:05.753785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Vt+KkLfXbezFJFLVZ0dRv0VMJFOk+URYT9zj2JPNTkiatBCXdGbp+zGEB7txe+BS8P+fQvbsyqU1Bm9EgDBCw==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:05.754439Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.09113","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73325e0ff33d343b8fa37a339686802a12eecc2609894cf1fe472e0c81a0e665","sha256:e158174280330d74f7e59f7fe8f64b8350f862431dbcbffb74399cd481969318"],"state_sha256":"b2e881770f7d52ae422c5fab6986cb8b0772360231899afe5ff2b4843cbdd8a8"}