{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7UVFZZIHVRYEZ7PEAQTQPB5INS","short_pith_number":"pith:7UVFZZIH","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"},"canonical_sha256":"fd2a5ce507ac704cfde404270787a86cb2ca517ecce851e819febcc1e5b0813d","source":{"kind":"arxiv","id":"1209.0740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0740","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0740v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0740","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"7UVFZZIHVRYE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7UVFZZIHVRYEZ7PE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7UVFZZIH","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7UVFZZIHVRYEZ7PEAQTQPB5INS","target":"record","payload":{"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"},"canonical_sha256":"fd2a5ce507ac704cfde404270787a86cb2ca517ecce851e819febcc1e5b0813d","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"},"source_kind":"arxiv","source_id":"1209.0740","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-05-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuUDXHLtdjaQ4gPTqvgbkQoy6ZVTdhnCBeMMCi3RKzx4K46jneMbdcAjbn2A00jEUzyQ4mtim8kIM+/xN8kNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:53:27.482229Z"},"content_sha256":"83069c7c117a05cd44dae780885ae086cdadcb4bf20c919b255875ea2109bf4e","schema_version":"1.0","event_id":"sha256:83069c7c117a05cd44dae780885ae086cdadcb4bf20c919b255875ea2109bf4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7UVFZZIHVRYEZ7PEAQTQPB5INS","target":"graph","payload":{"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"},"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-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/tmbCo/J+Ks7sFpY0nI6PSHGuDg/Sg3+aUdoz141SoCI3z5VZYyfR/HiUn/uQ+oX+rqZY9+n/OnG32o9PawkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:53:27.482610Z"},"content_sha256":"fa858cc58124e43abc77773311744549e14cea024a6cd8e12fe65f9907d41510","schema_version":"1.0","event_id":"sha256:fa858cc58124e43abc77773311744549e14cea024a6cd8e12fe65f9907d41510"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/bundle.json","state_url":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/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-22T11:53:27Z","links":{"resolver":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS","bundle":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/bundle.json","state":"https://pith.science/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UVFZZIHVRYEZ7PEAQTQPB5INS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7UVFZZIHVRYEZ7PEAQTQPB5INS","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":"7d0ec7fc1547e17bbfcad631f3a53fbb67a3af089ec887d7e370d1046713847d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-04T19:10:34Z","title_canon_sha256":"69beadb9640f55432db07d30b97fdd0e843cb75fab912e13ef990f3b46bb592b"},"schema_version":"1.0","source":{"id":"1209.0740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0740","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0740v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0740","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"7UVFZZIHVRYE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7UVFZZIHVRYEZ7PE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7UVFZZIH","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:fa858cc58124e43abc77773311744549e14cea024a6cd8e12fe65f9907d41510","target":"graph","created_at":"2026-05-18T03:46:17Z","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":"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'","authors_text":"Anxiao (Andrew) Jiang, Hongchao Zhou, Jehoshua Bruck","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-04T19:10:34Z","title":"Nonuniform Codes for Correcting Asymmetric Errors in Data Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0740","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:83069c7c117a05cd44dae780885ae086cdadcb4bf20c919b255875ea2109bf4e","target":"record","created_at":"2026-05-18T03:46:17Z","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":"7d0ec7fc1547e17bbfcad631f3a53fbb67a3af089ec887d7e370d1046713847d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-04T19:10:34Z","title_canon_sha256":"69beadb9640f55432db07d30b97fdd0e843cb75fab912e13ef990f3b46bb592b"},"schema_version":"1.0","source":{"id":"1209.0740","kind":"arxiv","version":1}},"canonical_sha256":"fd2a5ce507ac704cfde404270787a86cb2ca517ecce851e819febcc1e5b0813d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd2a5ce507ac704cfde404270787a86cb2ca517ecce851e819febcc1e5b0813d","first_computed_at":"2026-05-18T03:46:17.333923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:17.333923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WYBuFS7gEJP7XhXETGWHyMIB846Rd9Ag1HvbfFAE4m4YkbGuJloWJMBi5bujLW2cSteB6uw+hVdpMH9L4L8rAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:17.334499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83069c7c117a05cd44dae780885ae086cdadcb4bf20c919b255875ea2109bf4e","sha256:fa858cc58124e43abc77773311744549e14cea024a6cd8e12fe65f9907d41510"],"state_sha256":"0bbf2bb318297cb586030e3369cfedf5f0614b1290302a7f65ff8d735a5b1c0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+kXWfmCoofmx5/Uvy4ORHZngpft/FcED4VCUBfIFrVihbnijhT74jdHJYcHlVCpADXsU4BYafMOBrFzdteYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:53:27.484600Z","bundle_sha256":"15add7ae01d7dea3e51dd58095c30bbdc24bf2dee506df046b4905638690556e"}}