{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EWPWHHZDDEFMJM7ANTZH7RIPFM","short_pith_number":"pith:EWPWHHZD","canonical_record":{"source":{"id":"1702.00608","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-02T10:37:05Z","cross_cats_sorted":["math.IT","math.MG"],"title_canon_sha256":"fc8ca92953a63822cf6c4325a97e13b5356b028735cad2971b2415f7ce5e9b81","abstract_canon_sha256":"e7870029f0ffc580945dfc0aad770abcceabad386a209e93e750ba62edf247ef"},"schema_version":"1.0"},"canonical_sha256":"259f639f23190ac4b3e06cf27fc50f2b341b82bb1b60b88fa5b5f7f60259eac8","source":{"kind":"arxiv","id":"1702.00608","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00608","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00608v3","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00608","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"EWPWHHZDDEFM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EWPWHHZDDEFMJM7A","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EWPWHHZD","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EWPWHHZDDEFMJM7ANTZH7RIPFM","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00608","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-02T10:37:05Z","cross_cats_sorted":["math.IT","math.MG"],"title_canon_sha256":"fc8ca92953a63822cf6c4325a97e13b5356b028735cad2971b2415f7ce5e9b81","abstract_canon_sha256":"e7870029f0ffc580945dfc0aad770abcceabad386a209e93e750ba62edf247ef"},"schema_version":"1.0"},"canonical_sha256":"259f639f23190ac4b3e06cf27fc50f2b341b82bb1b60b88fa5b5f7f60259eac8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:31.533651Z","signature_b64":"oVVDzuCqcYr/aYrq2ExUz3nYy9WvSTmPr+zQPR/ar6WOOzelsLudv9lG1ADLZSpQmeXgt7sSzKvL9eiFMyAmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"259f639f23190ac4b3e06cf27fc50f2b341b82bb1b60b88fa5b5f7f60259eac8","last_reissued_at":"2026-05-18T00:24:31.533161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:31.533161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00608","source_version":3,"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-18T00:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBI+iFMu8eQSQXBjsTsLNVvIklnZTg37WyDbJr8aeDUu2ufahXW1CFpghQ9Tp4d5ECdDYeD9++FH08Pu7vMQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T01:59:52.354165Z"},"content_sha256":"de550f902435ee19c0ea143336e3d57cb414ca5bbbbc5321f549d0d599fe1a5d","schema_version":"1.0","event_id":"sha256:de550f902435ee19c0ea143336e3d57cb414ca5bbbbc5321f549d0d599fe1a5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EWPWHHZDDEFMJM7ANTZH7RIPFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Ensembles of Lattices from Generalized Reductions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.MG"],"primary_cat":"cs.IT","authors_text":"Antonio Campello","submitted_at":"2017-02-02T10:37:05Z","abstract_excerpt":"We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e., with packing density comparable to the Minkowski-Hlawka lower bound). Specializing to number field lattices, we obtain a number of interesting corollaries - for instance, the best known packing density of ideal lattices, and an elementary coding-theoretic construction of asymptotically dense Hurwitz lattices. All results are algorithmically effective, in the se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00608","kind":"arxiv","version":3},"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-18T00:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNLQWdsBpGkfwU6RasWBl9ywpMOFy9PYgf7DKmIFjFJ2fSxEJwcXExtpfCFcsUJLkcOaQQrEIutGgx4ifFXSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T01:59:52.354533Z"},"content_sha256":"b1463911c73983845ccf84236042eb96c8d8a38488a0cc4f9bbeb61f9d9dd2e1","schema_version":"1.0","event_id":"sha256:b1463911c73983845ccf84236042eb96c8d8a38488a0cc4f9bbeb61f9d9dd2e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWPWHHZDDEFMJM7ANTZH7RIPFM/bundle.json","state_url":"https://pith.science/pith/EWPWHHZDDEFMJM7ANTZH7RIPFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWPWHHZDDEFMJM7ANTZH7RIPFM/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-27T01:59:52Z","links":{"resolver":"https://pith.science/pith/EWPWHHZDDEFMJM7ANTZH7RIPFM","bundle":"https://pith.science/pith/EWPWHHZDDEFMJM7ANTZH7RIPFM/bundle.json","state":"https://pith.science/pith/EWPWHHZDDEFMJM7ANTZH7RIPFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWPWHHZDDEFMJM7ANTZH7RIPFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EWPWHHZDDEFMJM7ANTZH7RIPFM","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":"e7870029f0ffc580945dfc0aad770abcceabad386a209e93e750ba62edf247ef","cross_cats_sorted":["math.IT","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-02T10:37:05Z","title_canon_sha256":"fc8ca92953a63822cf6c4325a97e13b5356b028735cad2971b2415f7ce5e9b81"},"schema_version":"1.0","source":{"id":"1702.00608","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00608","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00608v3","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00608","created_at":"2026-05-18T00:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"EWPWHHZDDEFM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EWPWHHZDDEFMJM7A","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EWPWHHZD","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:b1463911c73983845ccf84236042eb96c8d8a38488a0cc4f9bbeb61f9d9dd2e1","target":"graph","created_at":"2026-05-18T00:24:31Z","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 propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e., with packing density comparable to the Minkowski-Hlawka lower bound). Specializing to number field lattices, we obtain a number of interesting corollaries - for instance, the best known packing density of ideal lattices, and an elementary coding-theoretic construction of asymptotically dense Hurwitz lattices. All results are algorithmically effective, in the se","authors_text":"Antonio Campello","cross_cats":["math.IT","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-02T10:37:05Z","title":"Random Ensembles of Lattices from Generalized Reductions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00608","kind":"arxiv","version":3},"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:de550f902435ee19c0ea143336e3d57cb414ca5bbbbc5321f549d0d599fe1a5d","target":"record","created_at":"2026-05-18T00:24:31Z","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":"e7870029f0ffc580945dfc0aad770abcceabad386a209e93e750ba62edf247ef","cross_cats_sorted":["math.IT","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-02T10:37:05Z","title_canon_sha256":"fc8ca92953a63822cf6c4325a97e13b5356b028735cad2971b2415f7ce5e9b81"},"schema_version":"1.0","source":{"id":"1702.00608","kind":"arxiv","version":3}},"canonical_sha256":"259f639f23190ac4b3e06cf27fc50f2b341b82bb1b60b88fa5b5f7f60259eac8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"259f639f23190ac4b3e06cf27fc50f2b341b82bb1b60b88fa5b5f7f60259eac8","first_computed_at":"2026-05-18T00:24:31.533161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:31.533161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oVVDzuCqcYr/aYrq2ExUz3nYy9WvSTmPr+zQPR/ar6WOOzelsLudv9lG1ADLZSpQmeXgt7sSzKvL9eiFMyAmCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:31.533651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00608","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de550f902435ee19c0ea143336e3d57cb414ca5bbbbc5321f549d0d599fe1a5d","sha256:b1463911c73983845ccf84236042eb96c8d8a38488a0cc4f9bbeb61f9d9dd2e1"],"state_sha256":"2153bd6f62e809dc5325c9805c1f3554641c486b9093e8f454093ab24ec7882a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Es/4rl0zFCyZi8c1WiwLzy4trM2Qy/FhufucSQYuKabttty/3lk4RJmFPMdlv/VdwJ5SLYTyvwIgTogfsfFdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T01:59:52.356463Z","bundle_sha256":"d03abbb227fd74c95bdd1eabf940400acffad7f37a0ad64ad692d3bed30f81b3"}}