{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QASBKAWIQJLZJU6TQJH7ARI4WJ","short_pith_number":"pith:QASBKAWI","schema_version":"1.0","canonical_sha256":"80241502c8825794d3d3824ff0451cb24df28f5b6175f89af9e98b8b2626ba0b","source":{"kind":"arxiv","id":"1112.0896","version":2},"attestation_state":"computed","paper":{"title":"On the Existence of Perfect Codes for Asymmetric Limited-Magnitude Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sarit Buzaglo, Tuvi Etzion","submitted_at":"2011-12-05T11:55:08Z","abstract_excerpt":"Block codes, which correct asymmetric errors with limited-magnitude, are studied. These codes have been applied recently for error correction in flash memories. The codes will be represented by lattices and the constructions will be based on a generalization of Sidon sequences. In particular we will consider perfect codes for these type of errors."},"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":"1112.0896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-05T11:55:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"44c5be07ec3281e35167a6561609795811c7bab2956eae277afe1fee1daa7db2","abstract_canon_sha256":"cb6f694ddc42f973f7f30342f4beb20d207fe896072fab423493292787e2a040"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:35.203053Z","signature_b64":"+gYilfuMomsakMRCNBodkaGIPrHopaAeb0T58K0Yg/6RM0SqIbjdbywoXOj9j/xMcAanHoZzdB21Epn7ecYxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80241502c8825794d3d3824ff0451cb24df28f5b6175f89af9e98b8b2626ba0b","last_reissued_at":"2026-05-18T04:06:35.202249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:35.202249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Existence of Perfect Codes for Asymmetric Limited-Magnitude Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sarit Buzaglo, Tuvi Etzion","submitted_at":"2011-12-05T11:55:08Z","abstract_excerpt":"Block codes, which correct asymmetric errors with limited-magnitude, are studied. These codes have been applied recently for error correction in flash memories. The codes will be represented by lattices and the constructions will be based on a generalization of Sidon sequences. In particular we will consider perfect codes for these type of errors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0896","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.0896","created_at":"2026-05-18T04:06:35.202395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0896v2","created_at":"2026-05-18T04:06:35.202395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0896","created_at":"2026-05-18T04:06:35.202395+00:00"},{"alias_kind":"pith_short_12","alias_value":"QASBKAWIQJLZ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QASBKAWIQJLZJU6T","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QASBKAWI","created_at":"2026-05-18T12:26:39.201973+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/QASBKAWIQJLZJU6TQJH7ARI4WJ","json":"https://pith.science/pith/QASBKAWIQJLZJU6TQJH7ARI4WJ.json","graph_json":"https://pith.science/api/pith-number/QASBKAWIQJLZJU6TQJH7ARI4WJ/graph.json","events_json":"https://pith.science/api/pith-number/QASBKAWIQJLZJU6TQJH7ARI4WJ/events.json","paper":"https://pith.science/paper/QASBKAWI"},"agent_actions":{"view_html":"https://pith.science/pith/QASBKAWIQJLZJU6TQJH7ARI4WJ","download_json":"https://pith.science/pith/QASBKAWIQJLZJU6TQJH7ARI4WJ.json","view_paper":"https://pith.science/paper/QASBKAWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0896&json=true","fetch_graph":"https://pith.science/api/pith-number/QASBKAWIQJLZJU6TQJH7ARI4WJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QASBKAWIQJLZJU6TQJH7ARI4WJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QASBKAWIQJLZJU6TQJH7ARI4WJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QASBKAWIQJLZJU6TQJH7ARI4WJ/action/storage_attestation","attest_author":"https://pith.science/pith/QASBKAWIQJLZJU6TQJH7ARI4WJ/action/author_attestation","sign_citation":"https://pith.science/pith/QASBKAWIQJLZJU6TQJH7ARI4WJ/action/citation_signature","submit_replication":"https://pith.science/pith/QASBKAWIQJLZJU6TQJH7ARI4WJ/action/replication_record"}},"created_at":"2026-05-18T04:06:35.202395+00:00","updated_at":"2026-05-18T04:06:35.202395+00:00"}