{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:TM3AO4TU3RWM7EWKXCTEMCRXDZ","short_pith_number":"pith:TM3AO4TU","canonical_record":{"source":{"id":"2304.01317","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2023-04-03T19:33:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc03a9f6b1b223607e7a427cb790cd1d97e96974e11af20c3efaf118195ba24e","abstract_canon_sha256":"b53731c6ace262d89ae512163d38b91d91909f9c6f6fed28b263add18c9f9fd8"},"schema_version":"1.0"},"canonical_sha256":"9b36077274dc6ccf92cab8a6460a371e70d259b4b0c1f231a001754d6ce4db54","source":{"kind":"arxiv","id":"2304.01317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.01317","created_at":"2026-07-05T05:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"2304.01317v1","created_at":"2026-07-05T05:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01317","created_at":"2026-07-05T05:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"TM3AO4TU3RWM","created_at":"2026-07-05T05:57:38Z"},{"alias_kind":"pith_short_16","alias_value":"TM3AO4TU3RWM7EWK","created_at":"2026-07-05T05:57:38Z"},{"alias_kind":"pith_short_8","alias_value":"TM3AO4TU","created_at":"2026-07-05T05:57:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:TM3AO4TU3RWM7EWKXCTEMCRXDZ","target":"record","payload":{"canonical_record":{"source":{"id":"2304.01317","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2023-04-03T19:33:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc03a9f6b1b223607e7a427cb790cd1d97e96974e11af20c3efaf118195ba24e","abstract_canon_sha256":"b53731c6ace262d89ae512163d38b91d91909f9c6f6fed28b263add18c9f9fd8"},"schema_version":"1.0"},"canonical_sha256":"9b36077274dc6ccf92cab8a6460a371e70d259b4b0c1f231a001754d6ce4db54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:57:38.861324Z","signature_b64":"i+E2Htim0b7FYc3wDaU6j0LKR2YKoDqDgiHtcAh6I9FqpVCpO/CyHuEu1ZX/VcNfkVDnGUCYlGd2hDdmVSgWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b36077274dc6ccf92cab8a6460a371e70d259b4b0c1f231a001754d6ce4db54","last_reissued_at":"2026-07-05T05:57:38.860820Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:57:38.860820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.01317","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-05T05:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/TWt1aatA8lpU5vPqpgmocIaMkGQ1ia5IK0hX3lKTZLO6s9wvg0y8dSdePNwN5asssmeXQVtQIw2smuzjL2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:27:40.691536Z"},"content_sha256":"91b533ecb0685d538122bb4ac36f746ac9455951fccc3de794289b5741055029","schema_version":"1.0","event_id":"sha256:91b533ecb0685d538122bb4ac36f746ac9455951fccc3de794289b5741055029"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:TM3AO4TU3RWM7EWKXCTEMCRXDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Framework for Parametric Constrained Coding","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adir Kobovich, Daniella Bar-Lev, Eitan Yaakobi, Orian Leitersdorf","submitted_at":"2023-04-03T19:33:42Z","abstract_excerpt":"Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While channels with fixed constraints have a general optimal solution, there is increasing demand for parametric constraints that are dependent on the message length. Several works have tackled such parametric constraints through iterative algorithms, yet they require complex constructions specific to each constraint to guarantee convergence through monotonic progression. In this paper, we propose a universal framework for tackling any parametric constrained-channel pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.01317","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/2304.01317/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-05T05:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQ3XqENp5x7xEO/p/7zScLjih8GMF5EONXU+Gw4SsIVl1e2UdJ5VJ9fWd9svwZjVrnUFONAoJmIh+YeIsaoYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:27:40.692030Z"},"content_sha256":"efe166ccc2b6c1f8b0988ad95c453208ef06b24108149ae5b5d075ef09cd72cb","schema_version":"1.0","event_id":"sha256:efe166ccc2b6c1f8b0988ad95c453208ef06b24108149ae5b5d075ef09cd72cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TM3AO4TU3RWM7EWKXCTEMCRXDZ/bundle.json","state_url":"https://pith.science/pith/TM3AO4TU3RWM7EWKXCTEMCRXDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TM3AO4TU3RWM7EWKXCTEMCRXDZ/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-08T21:27:40Z","links":{"resolver":"https://pith.science/pith/TM3AO4TU3RWM7EWKXCTEMCRXDZ","bundle":"https://pith.science/pith/TM3AO4TU3RWM7EWKXCTEMCRXDZ/bundle.json","state":"https://pith.science/pith/TM3AO4TU3RWM7EWKXCTEMCRXDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TM3AO4TU3RWM7EWKXCTEMCRXDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TM3AO4TU3RWM7EWKXCTEMCRXDZ","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":"b53731c6ace262d89ae512163d38b91d91909f9c6f6fed28b263add18c9f9fd8","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2023-04-03T19:33:42Z","title_canon_sha256":"cc03a9f6b1b223607e7a427cb790cd1d97e96974e11af20c3efaf118195ba24e"},"schema_version":"1.0","source":{"id":"2304.01317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.01317","created_at":"2026-07-05T05:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"2304.01317v1","created_at":"2026-07-05T05:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01317","created_at":"2026-07-05T05:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"TM3AO4TU3RWM","created_at":"2026-07-05T05:57:38Z"},{"alias_kind":"pith_short_16","alias_value":"TM3AO4TU3RWM7EWK","created_at":"2026-07-05T05:57:38Z"},{"alias_kind":"pith_short_8","alias_value":"TM3AO4TU","created_at":"2026-07-05T05:57:38Z"}],"graph_snapshots":[{"event_id":"sha256:efe166ccc2b6c1f8b0988ad95c453208ef06b24108149ae5b5d075ef09cd72cb","target":"graph","created_at":"2026-07-05T05:57:38Z","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/2304.01317/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While channels with fixed constraints have a general optimal solution, there is increasing demand for parametric constraints that are dependent on the message length. Several works have tackled such parametric constraints through iterative algorithms, yet they require complex constructions specific to each constraint to guarantee convergence through monotonic progression. In this paper, we propose a universal framework for tackling any parametric constrained-channel pro","authors_text":"Adir Kobovich, Daniella Bar-Lev, Eitan Yaakobi, Orian Leitersdorf","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2023-04-03T19:33:42Z","title":"Universal Framework for Parametric Constrained Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.01317","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:91b533ecb0685d538122bb4ac36f746ac9455951fccc3de794289b5741055029","target":"record","created_at":"2026-07-05T05:57:38Z","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":"b53731c6ace262d89ae512163d38b91d91909f9c6f6fed28b263add18c9f9fd8","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2023-04-03T19:33:42Z","title_canon_sha256":"cc03a9f6b1b223607e7a427cb790cd1d97e96974e11af20c3efaf118195ba24e"},"schema_version":"1.0","source":{"id":"2304.01317","kind":"arxiv","version":1}},"canonical_sha256":"9b36077274dc6ccf92cab8a6460a371e70d259b4b0c1f231a001754d6ce4db54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b36077274dc6ccf92cab8a6460a371e70d259b4b0c1f231a001754d6ce4db54","first_computed_at":"2026-07-05T05:57:38.860820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:57:38.860820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i+E2Htim0b7FYc3wDaU6j0LKR2YKoDqDgiHtcAh6I9FqpVCpO/CyHuEu1ZX/VcNfkVDnGUCYlGd2hDdmVSgWAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:57:38.861324Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.01317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91b533ecb0685d538122bb4ac36f746ac9455951fccc3de794289b5741055029","sha256:efe166ccc2b6c1f8b0988ad95c453208ef06b24108149ae5b5d075ef09cd72cb"],"state_sha256":"6e90edba2b8ba6bac2a4df20d9355534ef2c94934920e70f3dd7966d187f2b24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTlAHfvYPi6aN5mzlM9kR+VElapCLqLXjCA1luJsEEPzm6Tg0PqJ8QUKiIqP+QDXbDOgD+h8Cx2GmQuxptgEBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T21:27:40.695267Z","bundle_sha256":"52fac8c5eebc14a0dd991355da211e39fa5534a49e37ba237ab645a3c468f042"}}