{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7UVFZZIHVRYEZ7PEAQTQPB5INS","short_pith_number":"pith:7UVFZZIH","schema_version":"1.0","canonical_sha256":"fd2a5ce507ac704cfde404270787a86cb2ca517ecce851e819febcc1e5b0813d","source":{"kind":"arxiv","id":"1209.0740","version":1},"attestation_state":"computed","paper":{"title":"Nonuniform Codes for Correcting Asymmetric Errors in Data Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anxiao (Andrew) Jiang, Hongchao Zhou, Jehoshua Bruck","submitted_at":"2012-09-04T19:10:34Z","abstract_excerpt":"The construction of asymmetric error correcting codes is a topic that was studied extensively, however, the existing approach for code construction assumes that every codeword should tolerate $t$ asymmetric errors. Our main observation is that in contrast to symmetric errors, asymmetric errors are content dependent. For example, in Z-channels, the all-1 codeword is prone to have more errors than the all-0 codeword. This motivates us to develop nonuniform codes whose codewords can tolerate different numbers of asymmetric errors depending on their Hamming weights. The idea in a nonuniform codes'"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1209.0740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-04T19:10:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"69beadb9640f55432db07d30b97fdd0e843cb75fab912e13ef990f3b46bb592b","abstract_canon_sha256":"7d0ec7fc1547e17bbfcad631f3a53fbb67a3af089ec887d7e370d1046713847d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.334499Z","signature_b64":"WYBuFS7gEJP7XhXETGWHyMIB846Rd9Ag1HvbfFAE4m4YkbGuJloWJMBi5bujLW2cSteB6uw+hVdpMH9L4L8rAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd2a5ce507ac704cfde404270787a86cb2ca517ecce851e819febcc1e5b0813d","last_reissued_at":"2026-05-18T03:46:17.333923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.333923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonuniform Codes for Correcting Asymmetric Errors in Data Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anxiao (Andrew) Jiang, Hongchao Zhou, Jehoshua Bruck","submitted_at":"2012-09-04T19:10:34Z","abstract_excerpt":"The construction of asymmetric error correcting codes is a topic that was studied extensively, however, the existing approach for code construction assumes that every codeword should tolerate $t$ asymmetric errors. Our main observation is that in contrast to symmetric errors, asymmetric errors are content dependent. For example, in Z-channels, the all-1 codeword is prone to have more errors than the all-0 codeword. This motivates us to develop nonuniform codes whose codewords can tolerate different numbers of asymmetric errors depending on their Hamming weights. The idea in a nonuniform codes'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0740","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.0740","created_at":"2026-05-18T03:46:17.334017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0740v1","created_at":"2026-05-18T03:46:17.334017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0740","created_at":"2026-05-18T03:46:17.334017+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UVFZZIHVRYE","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UVFZZIHVRYEZ7PE","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UVFZZIH","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS","json":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS.json","graph_json":"https://pith.science/api/pith-number/7UVFZZIHVRYEZ7PEAQTQPB5INS/graph.json","events_json":"https://pith.science/api/pith-number/7UVFZZIHVRYEZ7PEAQTQPB5INS/events.json","paper":"https://pith.science/paper/7UVFZZIH"},"agent_actions":{"view_html":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS","download_json":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS.json","view_paper":"https://pith.science/paper/7UVFZZIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0740&json=true","fetch_graph":"https://pith.science/api/pith-number/7UVFZZIHVRYEZ7PEAQTQPB5INS/graph.json","fetch_events":"https://pith.science/api/pith-number/7UVFZZIHVRYEZ7PEAQTQPB5INS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/action/storage_attestation","attest_author":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/action/author_attestation","sign_citation":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/action/citation_signature","submit_replication":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/action/replication_record"}},"created_at":"2026-05-18T03:46:17.334017+00:00","updated_at":"2026-05-18T03:46:17.334017+00:00"}