{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UUCB3JIS4BLBK3COIWR4FGK7HM","short_pith_number":"pith:UUCB3JIS","canonical_record":{"source":{"id":"1607.00762","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T08:18:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b728ee9394167984394e2b4a1b87ce1ee5f2de01fab8f0c7efdc51c74baedb0","abstract_canon_sha256":"d69d14fb8664bbbc3fc0fdbed22ebabd38d256f5a43242e9e3e736e4ee8099b2"},"schema_version":"1.0"},"canonical_sha256":"a5041da512e056156c4e45a3c2995f3b2ac101a600aab6b43172d80c8097ba74","source":{"kind":"arxiv","id":"1607.00762","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00762","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00762v2","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00762","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"pith_short_12","alias_value":"UUCB3JIS4BLB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UUCB3JIS4BLBK3CO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UUCB3JIS","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UUCB3JIS4BLBK3COIWR4FGK7HM","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00762","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T08:18:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b728ee9394167984394e2b4a1b87ce1ee5f2de01fab8f0c7efdc51c74baedb0","abstract_canon_sha256":"d69d14fb8664bbbc3fc0fdbed22ebabd38d256f5a43242e9e3e736e4ee8099b2"},"schema_version":"1.0"},"canonical_sha256":"a5041da512e056156c4e45a3c2995f3b2ac101a600aab6b43172d80c8097ba74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:44.227636Z","signature_b64":"nTcJVnlJlWpXFO2QfS/XcCRe9lbSaN9B0rzdBlim4bj45BXhWhtozZLwPaMTJT0q10pR/yKT0p3iU38h//JgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5041da512e056156c4e45a3c2995f3b2ac101a600aab6b43172d80c8097ba74","last_reissued_at":"2026-05-18T00:35:44.227008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:44.227008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00762","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-18T00:35:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yeF4v4/6ArKWtqafStjH3jce8nqEx2XLyK6A3zJuL/QT8iDsLO3oWb6oDOfa+SHcV+Bu85qrdLgCl/ORp1zDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:37:50.802634Z"},"content_sha256":"b21ec9affdfb8000a5f15f3b107b94e0f665c8e7d30b459f211c033b7c3d47ce","schema_version":"1.0","event_id":"sha256:b21ec9affdfb8000a5f15f3b107b94e0f665c8e7d30b459f211c033b7c3d47ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UUCB3JIS4BLBK3COIWR4FGK7HM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constrained Coding Scheme for Correcting Asymmetric Magnitude-$1$ Errors in $q$-ary Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Evyatar Hemo, Yuval Cassuto","submitted_at":"2016-07-04T08:18:55Z","abstract_excerpt":"We present a constraint-coding scheme to correct asymmetric magnitude-$1$ errors in multi-level non-volatile memories. For large numbers of such errors, the scheme is shown to deliver better correction capability compared to known alternatives, while admitting low-complexity of decoding. Our results include an algebraic formulation of the constraint, necessary and sufficient conditions for correctability, a maximum-likelihood decoder running in complexity linear in the alphabet size, and upper bounds on the probability of failing to correct $t$ errors. Besides the superior rate-correction trad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00762","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-18T00:35:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhbxObs1vSxk+jugTuVEt2vi9P/gxgFtR2CuMH4g7vSVVN7SqVMa0X7KyJhAc0p6ckfU+J3re+prE70FSsirAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:37:50.803013Z"},"content_sha256":"855b64d81d379955f0b411a7cca35ce15272b689ebe8a718d6005e8220c5db19","schema_version":"1.0","event_id":"sha256:855b64d81d379955f0b411a7cca35ce15272b689ebe8a718d6005e8220c5db19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUCB3JIS4BLBK3COIWR4FGK7HM/bundle.json","state_url":"https://pith.science/pith/UUCB3JIS4BLBK3COIWR4FGK7HM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUCB3JIS4BLBK3COIWR4FGK7HM/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-09T14:37:50Z","links":{"resolver":"https://pith.science/pith/UUCB3JIS4BLBK3COIWR4FGK7HM","bundle":"https://pith.science/pith/UUCB3JIS4BLBK3COIWR4FGK7HM/bundle.json","state":"https://pith.science/pith/UUCB3JIS4BLBK3COIWR4FGK7HM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUCB3JIS4BLBK3COIWR4FGK7HM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UUCB3JIS4BLBK3COIWR4FGK7HM","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":"d69d14fb8664bbbc3fc0fdbed22ebabd38d256f5a43242e9e3e736e4ee8099b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T08:18:55Z","title_canon_sha256":"1b728ee9394167984394e2b4a1b87ce1ee5f2de01fab8f0c7efdc51c74baedb0"},"schema_version":"1.0","source":{"id":"1607.00762","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00762","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00762v2","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00762","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"pith_short_12","alias_value":"UUCB3JIS4BLB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UUCB3JIS4BLBK3CO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UUCB3JIS","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:855b64d81d379955f0b411a7cca35ce15272b689ebe8a718d6005e8220c5db19","target":"graph","created_at":"2026-05-18T00:35:44Z","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":"We present a constraint-coding scheme to correct asymmetric magnitude-$1$ errors in multi-level non-volatile memories. For large numbers of such errors, the scheme is shown to deliver better correction capability compared to known alternatives, while admitting low-complexity of decoding. Our results include an algebraic formulation of the constraint, necessary and sufficient conditions for correctability, a maximum-likelihood decoder running in complexity linear in the alphabet size, and upper bounds on the probability of failing to correct $t$ errors. Besides the superior rate-correction trad","authors_text":"Evyatar Hemo, Yuval Cassuto","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T08:18:55Z","title":"A Constrained Coding Scheme for Correcting Asymmetric Magnitude-$1$ Errors in $q$-ary Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00762","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:b21ec9affdfb8000a5f15f3b107b94e0f665c8e7d30b459f211c033b7c3d47ce","target":"record","created_at":"2026-05-18T00:35:44Z","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":"d69d14fb8664bbbc3fc0fdbed22ebabd38d256f5a43242e9e3e736e4ee8099b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-04T08:18:55Z","title_canon_sha256":"1b728ee9394167984394e2b4a1b87ce1ee5f2de01fab8f0c7efdc51c74baedb0"},"schema_version":"1.0","source":{"id":"1607.00762","kind":"arxiv","version":2}},"canonical_sha256":"a5041da512e056156c4e45a3c2995f3b2ac101a600aab6b43172d80c8097ba74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5041da512e056156c4e45a3c2995f3b2ac101a600aab6b43172d80c8097ba74","first_computed_at":"2026-05-18T00:35:44.227008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:44.227008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nTcJVnlJlWpXFO2QfS/XcCRe9lbSaN9B0rzdBlim4bj45BXhWhtozZLwPaMTJT0q10pR/yKT0p3iU38h//JgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:44.227636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00762","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b21ec9affdfb8000a5f15f3b107b94e0f665c8e7d30b459f211c033b7c3d47ce","sha256:855b64d81d379955f0b411a7cca35ce15272b689ebe8a718d6005e8220c5db19"],"state_sha256":"cc92aadde72e9940142b24e97b1a28719c523cdc4753e23c3057f0aa97fd9fa7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J++9ijoIL3uyXvucqDhSWP++dlTVJjZJBzMLoOrogHfwstXO4wP94g3NSw0aVP486uHYg1kPd/fT3LLiqmrxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:37:50.805043Z","bundle_sha256":"25ef53fb14aa638b3aff18bb122b2d267def97eb2b079e0798eadbf78157c9b0"}}