{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BZIV2MGJZKRKBTPIX5JRMOPSZQ","short_pith_number":"pith:BZIV2MGJ","canonical_record":{"source":{"id":"1004.0366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-02T17:37:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1e8926331b577057773233b7c7556ec5cfdf38c5c29abd57e315dc06b19976f6","abstract_canon_sha256":"61093880a590bb82a5ff85fb34eab0e385bde4f504e144ba8d01803e03ca09eb"},"schema_version":"1.0"},"canonical_sha256":"0e515d30c9caa2a0cde8bf531639f2cc2ca729541994db54ca9c89ec97a733ea","source":{"kind":"arxiv","id":"1004.0366","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0366","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0366v1","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0366","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"pith_short_12","alias_value":"BZIV2MGJZKRK","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BZIV2MGJZKRKBTPI","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BZIV2MGJ","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BZIV2MGJZKRKBTPIX5JRMOPSZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1004.0366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-02T17:37:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1e8926331b577057773233b7c7556ec5cfdf38c5c29abd57e315dc06b19976f6","abstract_canon_sha256":"61093880a590bb82a5ff85fb34eab0e385bde4f504e144ba8d01803e03ca09eb"},"schema_version":"1.0"},"canonical_sha256":"0e515d30c9caa2a0cde8bf531639f2cc2ca729541994db54ca9c89ec97a733ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:17.893778Z","signature_b64":"O5gf+B9TTeJxR5EvRziqhPra75A5g1dTOZhg6wyYoSPJsW5OfBdvqwrCAb2D71+ZNE/GzUD3bQXIkna4BlSDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e515d30c9caa2a0cde8bf531639f2cc2ca729541994db54ca9c89ec97a733ea","last_reissued_at":"2026-05-18T02:24:17.893121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:17.893121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.0366","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:24:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZ3P/EQKcRX4yBWm1Xf9Q4WMaoGOAZ3SAXLtgtVPHHSc9alTLN0P/hnd89J9VdcOKge1kbFLUCHuGMbTL6DMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:16:12.151084Z"},"content_sha256":"4adabf04f56b7c6bf7e8c6a612bb198a5eb6737098a5222cbd1623ca98e80faa","schema_version":"1.0","event_id":"sha256:4adabf04f56b7c6bf7e8c6a612bb198a5eb6737098a5222cbd1623ca98e80faa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BZIV2MGJZKRKBTPIX5JRMOPSZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dense Error-Correcting Codes in the Lee Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Eitan Yaakobi, Tuvi Etzion","submitted_at":"2010-04-02T17:37:36Z","abstract_excerpt":"Several new applications and a number of new mathematical techniques have increased the research on error-correcting codes in the Lee metric in the last decade. In this work we consider several coding problems and constructions of error-correcting codes in the Lee metric. First, we consider constructions of dense error-correcting codes in relatively small dimensions over small alphabets. The second problem we solve is construction of diametric perfect codes with minimum distance four. We will construct such codes over various lengths and alphabet sizes. The third problem is to transfer an n-di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0366","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:24:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+/UxEdtnTvxZ1tc+iEoAGkR7jn4ck7YUjnJGTctsukKTlRYiUrR60Rr3FB+xNuekVtgpXWq0r6U84R6LRbhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:16:12.151847Z"},"content_sha256":"cc336e91c5d535f51cb367d1b368ac3a51a281d19ed0a5a4f4db7eb0ffdecba2","schema_version":"1.0","event_id":"sha256:cc336e91c5d535f51cb367d1b368ac3a51a281d19ed0a5a4f4db7eb0ffdecba2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZIV2MGJZKRKBTPIX5JRMOPSZQ/bundle.json","state_url":"https://pith.science/pith/BZIV2MGJZKRKBTPIX5JRMOPSZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZIV2MGJZKRKBTPIX5JRMOPSZQ/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-05-31T08:16:12Z","links":{"resolver":"https://pith.science/pith/BZIV2MGJZKRKBTPIX5JRMOPSZQ","bundle":"https://pith.science/pith/BZIV2MGJZKRKBTPIX5JRMOPSZQ/bundle.json","state":"https://pith.science/pith/BZIV2MGJZKRKBTPIX5JRMOPSZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZIV2MGJZKRKBTPIX5JRMOPSZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BZIV2MGJZKRKBTPIX5JRMOPSZQ","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":"61093880a590bb82a5ff85fb34eab0e385bde4f504e144ba8d01803e03ca09eb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-02T17:37:36Z","title_canon_sha256":"1e8926331b577057773233b7c7556ec5cfdf38c5c29abd57e315dc06b19976f6"},"schema_version":"1.0","source":{"id":"1004.0366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0366","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0366v1","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0366","created_at":"2026-05-18T02:24:17Z"},{"alias_kind":"pith_short_12","alias_value":"BZIV2MGJZKRK","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BZIV2MGJZKRKBTPI","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BZIV2MGJ","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:cc336e91c5d535f51cb367d1b368ac3a51a281d19ed0a5a4f4db7eb0ffdecba2","target":"graph","created_at":"2026-05-18T02:24: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":"Several new applications and a number of new mathematical techniques have increased the research on error-correcting codes in the Lee metric in the last decade. In this work we consider several coding problems and constructions of error-correcting codes in the Lee metric. First, we consider constructions of dense error-correcting codes in relatively small dimensions over small alphabets. The second problem we solve is construction of diametric perfect codes with minimum distance four. We will construct such codes over various lengths and alphabet sizes. The third problem is to transfer an n-di","authors_text":"Alexander Vardy, Eitan Yaakobi, Tuvi Etzion","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-02T17:37:36Z","title":"Dense Error-Correcting Codes in the Lee Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0366","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:4adabf04f56b7c6bf7e8c6a612bb198a5eb6737098a5222cbd1623ca98e80faa","target":"record","created_at":"2026-05-18T02:24: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":"61093880a590bb82a5ff85fb34eab0e385bde4f504e144ba8d01803e03ca09eb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-02T17:37:36Z","title_canon_sha256":"1e8926331b577057773233b7c7556ec5cfdf38c5c29abd57e315dc06b19976f6"},"schema_version":"1.0","source":{"id":"1004.0366","kind":"arxiv","version":1}},"canonical_sha256":"0e515d30c9caa2a0cde8bf531639f2cc2ca729541994db54ca9c89ec97a733ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e515d30c9caa2a0cde8bf531639f2cc2ca729541994db54ca9c89ec97a733ea","first_computed_at":"2026-05-18T02:24:17.893121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:17.893121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O5gf+B9TTeJxR5EvRziqhPra75A5g1dTOZhg6wyYoSPJsW5OfBdvqwrCAb2D71+ZNE/GzUD3bQXIkna4BlSDDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:17.893778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.0366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4adabf04f56b7c6bf7e8c6a612bb198a5eb6737098a5222cbd1623ca98e80faa","sha256:cc336e91c5d535f51cb367d1b368ac3a51a281d19ed0a5a4f4db7eb0ffdecba2"],"state_sha256":"f5cbce4d52d9f4d2aa50693817246a1a7c7018d4dc32eb67e4f7711740b51f8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iKZAz4ceYf8+586sibyfphLMbXAbquAtljgBe8E7N+gmNrsi5bj03XCWBW7Z1VpoYGatLvW9BhU62Js6dnFpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:16:12.156036Z","bundle_sha256":"cc63a526d240ae1dd77b30b529b292727653293f3fa10f002b82d2689a21e43d"}}