{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7OK7E2G3KIO5RMTL6WBPJB7VEO","short_pith_number":"pith:7OK7E2G3","canonical_record":{"source":{"id":"1102.2035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-10T05:19:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"180e6151a77561865b9913f820afde8f6e04c48a61f816413eb41fcdf4a47c4f","abstract_canon_sha256":"11ac67c677cfc0b3f75766ef74f900927180b33deafd82fed94eaf3f9b124af0"},"schema_version":"1.0"},"canonical_sha256":"fb95f268db521dd8b26bf582f487f5239a68e8af449ab889ab97b9a19710e5f8","source":{"kind":"arxiv","id":"1102.2035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2035","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2035v1","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2035","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"7OK7E2G3KIO5","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7OK7E2G3KIO5RMTL","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7OK7E2G3","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7OK7E2G3KIO5RMTL6WBPJB7VEO","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-10T05:19:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"180e6151a77561865b9913f820afde8f6e04c48a61f816413eb41fcdf4a47c4f","abstract_canon_sha256":"11ac67c677cfc0b3f75766ef74f900927180b33deafd82fed94eaf3f9b124af0"},"schema_version":"1.0"},"canonical_sha256":"fb95f268db521dd8b26bf582f487f5239a68e8af449ab889ab97b9a19710e5f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:39.088941Z","signature_b64":"WqCozjuol7xJRXI5cy39kRKtFfcZnBZCVPtvYZOg/sPLmCOKKJrhs133bhS26UQCKjq3hpPiH/Dxq+4Q2+ieCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb95f268db521dd8b26bf582f487f5239a68e8af449ab889ab97b9a19710e5f8","last_reissued_at":"2026-05-18T02:22:39.088399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:39.088399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2035","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-18T02:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+oSQOxP9BdV/Kbyql/sMxfJzum8og7z+CDlMiqtePZ6M2guYwu7IrTZdY2lIn+yfGA44CbmhJw73J1fUAQFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:09:38.094688Z"},"content_sha256":"4afab2cc3aaff7555349886459b2d728acc90b692d512dd07e6f9ad6f3cb56cf","schema_version":"1.0","event_id":"sha256:4afab2cc3aaff7555349886459b2d728acc90b692d512dd07e6f9ad6f3cb56cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7OK7E2G3KIO5RMTL6WBPJB7VEO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quasi-Cross Lattice Tilings with Applications to Flash Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Moshe Schwartz","submitted_at":"2011-02-10T05:19:57Z","abstract_excerpt":"We consider lattice tilings of $\\R^n$ by a shape we call a $(\\kp,\\km,n)$-quasi-cross. Such lattices form perfect error-correcting codes which correct a single limited-magnitude error with prescribed maximal-magnitudes of positive error and negative error (the ratio of which is called the balance ratio). These codes can be used to correct both disturb and retention errors in flash memories, which are characterized by having limited magnitudes and different signs.\n  We construct infinite families of perfect codes for any rational balance ratio, and provide a specific construction for $(2,1,n)$-q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2035","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-18T02:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lj5+UUiZ5S0d1ZTrAQbDTNkebFIF3aV/iSgZo/58CAPLbb/eYjZv9jbneD6ajLuHAeYzjZ2dU7YJZ061XcYeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:09:38.095376Z"},"content_sha256":"6e6f5c7343073d9be6546219c47dccdda3a58c441631fe59c3cda7c416a2c037","schema_version":"1.0","event_id":"sha256:6e6f5c7343073d9be6546219c47dccdda3a58c441631fe59c3cda7c416a2c037"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OK7E2G3KIO5RMTL6WBPJB7VEO/bundle.json","state_url":"https://pith.science/pith/7OK7E2G3KIO5RMTL6WBPJB7VEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OK7E2G3KIO5RMTL6WBPJB7VEO/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-12T00:09:38Z","links":{"resolver":"https://pith.science/pith/7OK7E2G3KIO5RMTL6WBPJB7VEO","bundle":"https://pith.science/pith/7OK7E2G3KIO5RMTL6WBPJB7VEO/bundle.json","state":"https://pith.science/pith/7OK7E2G3KIO5RMTL6WBPJB7VEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OK7E2G3KIO5RMTL6WBPJB7VEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7OK7E2G3KIO5RMTL6WBPJB7VEO","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":"11ac67c677cfc0b3f75766ef74f900927180b33deafd82fed94eaf3f9b124af0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-10T05:19:57Z","title_canon_sha256":"180e6151a77561865b9913f820afde8f6e04c48a61f816413eb41fcdf4a47c4f"},"schema_version":"1.0","source":{"id":"1102.2035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2035","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2035v1","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2035","created_at":"2026-05-18T02:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"7OK7E2G3KIO5","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7OK7E2G3KIO5RMTL","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7OK7E2G3","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:6e6f5c7343073d9be6546219c47dccdda3a58c441631fe59c3cda7c416a2c037","target":"graph","created_at":"2026-05-18T02:22:39Z","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 consider lattice tilings of $\\R^n$ by a shape we call a $(\\kp,\\km,n)$-quasi-cross. Such lattices form perfect error-correcting codes which correct a single limited-magnitude error with prescribed maximal-magnitudes of positive error and negative error (the ratio of which is called the balance ratio). These codes can be used to correct both disturb and retention errors in flash memories, which are characterized by having limited magnitudes and different signs.\n  We construct infinite families of perfect codes for any rational balance ratio, and provide a specific construction for $(2,1,n)$-q","authors_text":"Moshe Schwartz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-10T05:19:57Z","title":"Quasi-Cross Lattice Tilings with Applications to Flash Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2035","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:4afab2cc3aaff7555349886459b2d728acc90b692d512dd07e6f9ad6f3cb56cf","target":"record","created_at":"2026-05-18T02:22:39Z","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":"11ac67c677cfc0b3f75766ef74f900927180b33deafd82fed94eaf3f9b124af0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-10T05:19:57Z","title_canon_sha256":"180e6151a77561865b9913f820afde8f6e04c48a61f816413eb41fcdf4a47c4f"},"schema_version":"1.0","source":{"id":"1102.2035","kind":"arxiv","version":1}},"canonical_sha256":"fb95f268db521dd8b26bf582f487f5239a68e8af449ab889ab97b9a19710e5f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb95f268db521dd8b26bf582f487f5239a68e8af449ab889ab97b9a19710e5f8","first_computed_at":"2026-05-18T02:22:39.088399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:39.088399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WqCozjuol7xJRXI5cy39kRKtFfcZnBZCVPtvYZOg/sPLmCOKKJrhs133bhS26UQCKjq3hpPiH/Dxq+4Q2+ieCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:39.088941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4afab2cc3aaff7555349886459b2d728acc90b692d512dd07e6f9ad6f3cb56cf","sha256:6e6f5c7343073d9be6546219c47dccdda3a58c441631fe59c3cda7c416a2c037"],"state_sha256":"f46e3f530db05f19644b6f4cf12f241e14e85ec95d8c67881733c08d3f33c5c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pvz14MzbvY5wTL0v2+r1tdfLzbrIgetO1LozA64k29xLqZ3BgPNuxipdHGpTHGENmQHKgxM6wAMPlDkaVjf/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:09:38.099068Z","bundle_sha256":"bbe090f3ccf79a2d7836c3bcca46d609502ef6ce8ded5908d6bda9869ec022b6"}}