{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GILLLN7O3APQCZ7KEVX2TLS7PM","short_pith_number":"pith:GILLLN7O","canonical_record":{"source":{"id":"1401.2612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-12T12:08:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af4ec7713639a7d017a79f71a26eaab8aa926a7f6ef36ee25b619d91ebae3887","abstract_canon_sha256":"2a8e40cd0abb6903bbb31b3e8981a4636f5aadf3abecef2a36cd54c55d343212"},"schema_version":"1.0"},"canonical_sha256":"3216b5b7eed81f0167ea256fa9ae5f7b065cf1de78fc2462aa31610f8a5f4ff2","source":{"kind":"arxiv","id":"1401.2612","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2612","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2612v2","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2612","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"GILLLN7O3APQ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GILLLN7O3APQCZ7K","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GILLLN7O","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GILLLN7O3APQCZ7KEVX2TLS7PM","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-12T12:08:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af4ec7713639a7d017a79f71a26eaab8aa926a7f6ef36ee25b619d91ebae3887","abstract_canon_sha256":"2a8e40cd0abb6903bbb31b3e8981a4636f5aadf3abecef2a36cd54c55d343212"},"schema_version":"1.0"},"canonical_sha256":"3216b5b7eed81f0167ea256fa9ae5f7b065cf1de78fc2462aa31610f8a5f4ff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:01.677096Z","signature_b64":"oF5sxiDt1RaiQPNmj3+rQoV3xiqnzS9tLarM2KsgqaxghcYOEqJ3WHQpdqE+7ynr3pXOdoFIdjzi7pWhlR4AAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3216b5b7eed81f0167ea256fa9ae5f7b065cf1de78fc2462aa31610f8a5f4ff2","last_reissued_at":"2026-05-18T02:29:01.676509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:01.676509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2612","source_version":2,"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-05-18T02:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUc1UreWgrl7XLXOFeQuckfMNOAPoN5mMD4ki3y15Aco29R2FPX5iqn8X9zGUkRDNCn3ipdbq9MatGkPwWaoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:43:05.705390Z"},"content_sha256":"352c9c1bb46f8c842f5b033b9b3812773ba6f8a3318f91178e5cec40fda48723","schema_version":"1.0","event_id":"sha256:352c9c1bb46f8c842f5b033b9b3812773ba6f8a3318f91178e5cec40fda48723"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GILLLN7O3APQCZ7KEVX2TLS7PM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-constrained Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Moshe Schwartz, Ohad Elishco, Tom Meyerovitch","submitted_at":"2014-01-12T12:08:31Z","abstract_excerpt":"When transmitting information over a noisy channel, two approaches, dating back to Shannon's work, are common: assuming the channel errors are independent of the transmitted content and devising an error-correcting code, or assuming the errors are data dependent and devising a constrained-coding scheme that eliminates all offending data patterns. In this paper we analyze a middle road, which we call a semiconstrained system. In such a system, which is an extension of the channel with cost constraints model, we do not eliminate the error-causing sequences entirely, but rather restrict the frequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2612","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T02:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"isOCj2PEsZfdtxxiewJ5+RG2LqYWj6fYIzb+bjoylTubBEX0CaGCeuGFi220vj2asiDEwKrS5RmkTOuSvIP3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:43:05.706040Z"},"content_sha256":"e8ee04105eeb41894621f21649569aa311b99372cc3b6a9f6e58bca4d5e62815","schema_version":"1.0","event_id":"sha256:e8ee04105eeb41894621f21649569aa311b99372cc3b6a9f6e58bca4d5e62815"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GILLLN7O3APQCZ7KEVX2TLS7PM/bundle.json","state_url":"https://pith.science/pith/GILLLN7O3APQCZ7KEVX2TLS7PM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GILLLN7O3APQCZ7KEVX2TLS7PM/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-06-11T22:43:05Z","links":{"resolver":"https://pith.science/pith/GILLLN7O3APQCZ7KEVX2TLS7PM","bundle":"https://pith.science/pith/GILLLN7O3APQCZ7KEVX2TLS7PM/bundle.json","state":"https://pith.science/pith/GILLLN7O3APQCZ7KEVX2TLS7PM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GILLLN7O3APQCZ7KEVX2TLS7PM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GILLLN7O3APQCZ7KEVX2TLS7PM","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":"2a8e40cd0abb6903bbb31b3e8981a4636f5aadf3abecef2a36cd54c55d343212","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-12T12:08:31Z","title_canon_sha256":"af4ec7713639a7d017a79f71a26eaab8aa926a7f6ef36ee25b619d91ebae3887"},"schema_version":"1.0","source":{"id":"1401.2612","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2612","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2612v2","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2612","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"GILLLN7O3APQ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GILLLN7O3APQCZ7K","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GILLLN7O","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:e8ee04105eeb41894621f21649569aa311b99372cc3b6a9f6e58bca4d5e62815","target":"graph","created_at":"2026-05-18T02:29:01Z","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"},"paper":{"abstract_excerpt":"When transmitting information over a noisy channel, two approaches, dating back to Shannon's work, are common: assuming the channel errors are independent of the transmitted content and devising an error-correcting code, or assuming the errors are data dependent and devising a constrained-coding scheme that eliminates all offending data patterns. In this paper we analyze a middle road, which we call a semiconstrained system. In such a system, which is an extension of the channel with cost constraints model, we do not eliminate the error-causing sequences entirely, but rather restrict the frequ","authors_text":"Moshe Schwartz, Ohad Elishco, Tom Meyerovitch","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-12T12:08:31Z","title":"Semi-constrained Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2612","kind":"arxiv","version":2},"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:352c9c1bb46f8c842f5b033b9b3812773ba6f8a3318f91178e5cec40fda48723","target":"record","created_at":"2026-05-18T02:29:01Z","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":"2a8e40cd0abb6903bbb31b3e8981a4636f5aadf3abecef2a36cd54c55d343212","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-12T12:08:31Z","title_canon_sha256":"af4ec7713639a7d017a79f71a26eaab8aa926a7f6ef36ee25b619d91ebae3887"},"schema_version":"1.0","source":{"id":"1401.2612","kind":"arxiv","version":2}},"canonical_sha256":"3216b5b7eed81f0167ea256fa9ae5f7b065cf1de78fc2462aa31610f8a5f4ff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3216b5b7eed81f0167ea256fa9ae5f7b065cf1de78fc2462aa31610f8a5f4ff2","first_computed_at":"2026-05-18T02:29:01.676509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:01.676509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oF5sxiDt1RaiQPNmj3+rQoV3xiqnzS9tLarM2KsgqaxghcYOEqJ3WHQpdqE+7ynr3pXOdoFIdjzi7pWhlR4AAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:01.677096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2612","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:352c9c1bb46f8c842f5b033b9b3812773ba6f8a3318f91178e5cec40fda48723","sha256:e8ee04105eeb41894621f21649569aa311b99372cc3b6a9f6e58bca4d5e62815"],"state_sha256":"82786d42ccaa6a8d9b54d748b6b2ff03d4af6349468d6e7e82efdcfb3d5ccfba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dEhFcYTRPd3DKPXuJqJd758G1uMIV/kMZxouE0w2Qd6GXZ0goQ86s73q4K3MKr9KIFdhLNAKFkZws7zDSE3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:43:05.710083Z","bundle_sha256":"ecc3efb74b3101fbd187c283e04a69715775eaee1975c5019b4f05be1bfca422"}}