{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LMIUAYTVPC536LBPB6GYBXEJTB","short_pith_number":"pith:LMIUAYTV","canonical_record":{"source":{"id":"1302.2246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-09T17:13:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e35f3dae7e4e04fac7bf9046f1b6dd96d3ef96dc9e261c7397ea471a88137c45","abstract_canon_sha256":"5b6449eac43591a44296e652994c8c02572ce473342f8b09de773b7f3d27f663"},"schema_version":"1.0"},"canonical_sha256":"5b1140627578bbbf2c2f0f8d80dc89984cdbccd813ea4b58af1756fe461712ee","source":{"kind":"arxiv","id":"1302.2246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2246","created_at":"2026-05-18T03:34:01Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2246v1","created_at":"2026-05-18T03:34:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2246","created_at":"2026-05-18T03:34:01Z"},{"alias_kind":"pith_short_12","alias_value":"LMIUAYTVPC53","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LMIUAYTVPC536LBP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LMIUAYTV","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LMIUAYTVPC536LBPB6GYBXEJTB","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-09T17:13:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e35f3dae7e4e04fac7bf9046f1b6dd96d3ef96dc9e261c7397ea471a88137c45","abstract_canon_sha256":"5b6449eac43591a44296e652994c8c02572ce473342f8b09de773b7f3d27f663"},"schema_version":"1.0"},"canonical_sha256":"5b1140627578bbbf2c2f0f8d80dc89984cdbccd813ea4b58af1756fe461712ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:01.893156Z","signature_b64":"zzh1yMKmwluOG6EvpHBbaf7w/dAuvTgfnT4HiVk3MH8liWnhOQC2wKO51lMq1Su9qxtxpHeDoVJ+Tu3b0KcVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b1140627578bbbf2c2f0f8d80dc89984cdbccd813ea4b58af1756fe461712ee","last_reissued_at":"2026-05-18T03:34:01.892573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:01.892573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2246","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:34:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8LP/AdRMdIs8gSg8dXr3bkVZvmTFSvbET9qfatKlOl7MK8uh+IuvwstZ6MVRCBCJ/LcO5PF8dG7aHxHevcVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:11:38.081004Z"},"content_sha256":"c1dd5ed16470e3f7cd663766f1def4d2976eda5dd40e9dcc4311496fdcbbfb65","schema_version":"1.0","event_id":"sha256:c1dd5ed16470e3f7cd663766f1def4d2976eda5dd40e9dcc4311496fdcbbfb65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LMIUAYTVPC536LBPB6GYBXEJTB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds on the minimum distance of long 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":"Hugues Randriam, Lin Sok, Patrick Sol\\'e","submitted_at":"2013-02-09T17:13:10Z","abstract_excerpt":"The Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geometric codes, either over Fp or Fp2 ; or over even degree extensions of Fp: In the latter case the approach is concatena- tion with a good code for the Hamming metric as outer code and a short code for the Lee metric as an inner code. In the former case lower bounds on the minimum Lee distance are derived by algebraic geometric arguments inspired by results of Wu, Kuijper, Udaya (2007)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2246","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:34:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/BQ4DVyf78AW8hEAIw0ceXYUrodeIpcgxWfBBswuQFnU0bObtoMO6/upr+QCkBYYoyjyhctIYGyZyfJ6yR6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:11:38.081366Z"},"content_sha256":"f4d566ef12f1ad7d1c3b204796faf7fc39504b4ceff32e470a088c63b32f30ae","schema_version":"1.0","event_id":"sha256:f4d566ef12f1ad7d1c3b204796faf7fc39504b4ceff32e470a088c63b32f30ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMIUAYTVPC536LBPB6GYBXEJTB/bundle.json","state_url":"https://pith.science/pith/LMIUAYTVPC536LBPB6GYBXEJTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMIUAYTVPC536LBPB6GYBXEJTB/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-03T22:11:38Z","links":{"resolver":"https://pith.science/pith/LMIUAYTVPC536LBPB6GYBXEJTB","bundle":"https://pith.science/pith/LMIUAYTVPC536LBPB6GYBXEJTB/bundle.json","state":"https://pith.science/pith/LMIUAYTVPC536LBPB6GYBXEJTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMIUAYTVPC536LBPB6GYBXEJTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LMIUAYTVPC536LBPB6GYBXEJTB","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":"5b6449eac43591a44296e652994c8c02572ce473342f8b09de773b7f3d27f663","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-09T17:13:10Z","title_canon_sha256":"e35f3dae7e4e04fac7bf9046f1b6dd96d3ef96dc9e261c7397ea471a88137c45"},"schema_version":"1.0","source":{"id":"1302.2246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2246","created_at":"2026-05-18T03:34:01Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2246v1","created_at":"2026-05-18T03:34:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2246","created_at":"2026-05-18T03:34:01Z"},{"alias_kind":"pith_short_12","alias_value":"LMIUAYTVPC53","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LMIUAYTVPC536LBP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LMIUAYTV","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:f4d566ef12f1ad7d1c3b204796faf7fc39504b4ceff32e470a088c63b32f30ae","target":"graph","created_at":"2026-05-18T03:34:01Z","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 Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geometric codes, either over Fp or Fp2 ; or over even degree extensions of Fp: In the latter case the approach is concatena- tion with a good code for the Hamming metric as outer code and a short code for the Lee metric as an inner code. In the former case lower bounds on the minimum Lee distance are derived by algebraic geometric arguments inspired by results of Wu, Kuijper, Udaya (2007).","authors_text":"Hugues Randriam, Lin Sok, Patrick Sol\\'e","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-09T17:13:10Z","title":"Lower bounds on the minimum distance of long codes in the Lee metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2246","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:c1dd5ed16470e3f7cd663766f1def4d2976eda5dd40e9dcc4311496fdcbbfb65","target":"record","created_at":"2026-05-18T03:34:01Z","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":"5b6449eac43591a44296e652994c8c02572ce473342f8b09de773b7f3d27f663","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-09T17:13:10Z","title_canon_sha256":"e35f3dae7e4e04fac7bf9046f1b6dd96d3ef96dc9e261c7397ea471a88137c45"},"schema_version":"1.0","source":{"id":"1302.2246","kind":"arxiv","version":1}},"canonical_sha256":"5b1140627578bbbf2c2f0f8d80dc89984cdbccd813ea4b58af1756fe461712ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b1140627578bbbf2c2f0f8d80dc89984cdbccd813ea4b58af1756fe461712ee","first_computed_at":"2026-05-18T03:34:01.892573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:01.892573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zzh1yMKmwluOG6EvpHBbaf7w/dAuvTgfnT4HiVk3MH8liWnhOQC2wKO51lMq1Su9qxtxpHeDoVJ+Tu3b0KcVAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:01.893156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1dd5ed16470e3f7cd663766f1def4d2976eda5dd40e9dcc4311496fdcbbfb65","sha256:f4d566ef12f1ad7d1c3b204796faf7fc39504b4ceff32e470a088c63b32f30ae"],"state_sha256":"0066bb4653b19bd805e73155da372036f51656b1fbd7c5480a69e8f7c6b6657d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UcanxOHeX233qd4qQ2P/qDvrypIYREiHBNah7hqbUhQjgXnWNjL6xLrRe8to+YNO2U4KjOMyBQrByNXle1yCBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:11:38.083341Z","bundle_sha256":"f92629a093d44f5aba93fc088bb51c7b32e9433fc41ce5a41433423d1a53af6b"}}