{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VVXKBCQAVWWC3VINS6PZ4UJ4VE","short_pith_number":"pith:VVXKBCQA","canonical_record":{"source":{"id":"1401.2228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-10T04:22:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8d744b6f52358030dfe9e5d7fdde779636457167d1d5b4ea443e3f0d534a2a94","abstract_canon_sha256":"1727d5a88125e9d17f1e0535a550cdc9e5db401a1f2c3f6bf2437a451ada8ee4"},"schema_version":"1.0"},"canonical_sha256":"ad6ea08a00adac2dd50d979f9e513ca91d62a5395f6b70041ef6cbd4ed2c6936","source":{"kind":"arxiv","id":"1401.2228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2228","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2228v1","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2228","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"VVXKBCQAVWWC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VVXKBCQAVWWC3VIN","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VVXKBCQA","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VVXKBCQAVWWC3VINS6PZ4UJ4VE","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-10T04:22:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8d744b6f52358030dfe9e5d7fdde779636457167d1d5b4ea443e3f0d534a2a94","abstract_canon_sha256":"1727d5a88125e9d17f1e0535a550cdc9e5db401a1f2c3f6bf2437a451ada8ee4"},"schema_version":"1.0"},"canonical_sha256":"ad6ea08a00adac2dd50d979f9e513ca91d62a5395f6b70041ef6cbd4ed2c6936","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:45.997955Z","signature_b64":"NJ2PyukwAezCbvntKxqUlEvuXM++XbpM6Jonj3gc9CoPTMAB3JHVVgpiu0fI1JZjfWoNEXBXVntmW1GjD8e7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad6ea08a00adac2dd50d979f9e513ca91d62a5395f6b70041ef6cbd4ed2c6936","last_reissued_at":"2026-05-18T03:02:45.997182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:45.997182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2228","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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cfAU2i+iLt4AAJjrpVSWCASRnBQGLuBMkbw50cjF5LuVM4yXpIAO0iGImwqoH2FzPBwiWWyX8TYxgd9rVjJ0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:22:22.834410Z"},"content_sha256":"914e4454c53f74917d6c5e149b832395a79682bc444df1ac65fc09cfbc810ec9","schema_version":"1.0","event_id":"sha256:914e4454c53f74917d6c5e149b832395a79682bc444df1ac65fc09cfbc810ec9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VVXKBCQAVWWC3VINS6PZ4UJ4VE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multistage Compute-and-Forward with Multilevel Lattice Codes Based on Product Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna R. Narayanan, Nihat Engin Tunali, Yu-Chih Huang","submitted_at":"2014-01-10T04:22:05Z","abstract_excerpt":"A novel construction of lattices is proposed. This construction can be thought of as Construction A with codes that can be represented as the Cartesian product of $L$ linear codes over $\\mathbb{F}_{p_1},\\ldots,\\mathbb{F}_{p_L}$, respectively; hence, is referred to as the product construction. The existence of a sequence of such lattices that are good for quantization and Poltyrev-good under multistage decoding is shown. This family of lattices is then used to generate a sequence of nested lattice codes which allows one to achieve the same computation rate of Nazer and Gastpar for compute-and-f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2228","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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1BOBJMQML7Qz6t+ilBaIvQnr/AwQcWxWu2bEsW1YY9CsztLtFiQszKfzB9SFEBsL4UveufH1NbznKkKctg3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:22:22.834770Z"},"content_sha256":"0e80c693ad78b87cd4d85f0635c231de427c3399cd9c5446392f62235a04ecec","schema_version":"1.0","event_id":"sha256:0e80c693ad78b87cd4d85f0635c231de427c3399cd9c5446392f62235a04ecec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VVXKBCQAVWWC3VINS6PZ4UJ4VE/bundle.json","state_url":"https://pith.science/pith/VVXKBCQAVWWC3VINS6PZ4UJ4VE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VVXKBCQAVWWC3VINS6PZ4UJ4VE/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-04T01:22:22Z","links":{"resolver":"https://pith.science/pith/VVXKBCQAVWWC3VINS6PZ4UJ4VE","bundle":"https://pith.science/pith/VVXKBCQAVWWC3VINS6PZ4UJ4VE/bundle.json","state":"https://pith.science/pith/VVXKBCQAVWWC3VINS6PZ4UJ4VE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VVXKBCQAVWWC3VINS6PZ4UJ4VE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VVXKBCQAVWWC3VINS6PZ4UJ4VE","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":"1727d5a88125e9d17f1e0535a550cdc9e5db401a1f2c3f6bf2437a451ada8ee4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-10T04:22:05Z","title_canon_sha256":"8d744b6f52358030dfe9e5d7fdde779636457167d1d5b4ea443e3f0d534a2a94"},"schema_version":"1.0","source":{"id":"1401.2228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2228","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2228v1","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2228","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"VVXKBCQAVWWC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VVXKBCQAVWWC3VIN","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VVXKBCQA","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:0e80c693ad78b87cd4d85f0635c231de427c3399cd9c5446392f62235a04ecec","target":"graph","created_at":"2026-05-18T03:02:45Z","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":"A novel construction of lattices is proposed. This construction can be thought of as Construction A with codes that can be represented as the Cartesian product of $L$ linear codes over $\\mathbb{F}_{p_1},\\ldots,\\mathbb{F}_{p_L}$, respectively; hence, is referred to as the product construction. The existence of a sequence of such lattices that are good for quantization and Poltyrev-good under multistage decoding is shown. This family of lattices is then used to generate a sequence of nested lattice codes which allows one to achieve the same computation rate of Nazer and Gastpar for compute-and-f","authors_text":"Krishna R. Narayanan, Nihat Engin Tunali, Yu-Chih Huang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-10T04:22:05Z","title":"Multistage Compute-and-Forward with Multilevel Lattice Codes Based on Product Constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2228","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:914e4454c53f74917d6c5e149b832395a79682bc444df1ac65fc09cfbc810ec9","target":"record","created_at":"2026-05-18T03:02:45Z","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":"1727d5a88125e9d17f1e0535a550cdc9e5db401a1f2c3f6bf2437a451ada8ee4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-10T04:22:05Z","title_canon_sha256":"8d744b6f52358030dfe9e5d7fdde779636457167d1d5b4ea443e3f0d534a2a94"},"schema_version":"1.0","source":{"id":"1401.2228","kind":"arxiv","version":1}},"canonical_sha256":"ad6ea08a00adac2dd50d979f9e513ca91d62a5395f6b70041ef6cbd4ed2c6936","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad6ea08a00adac2dd50d979f9e513ca91d62a5395f6b70041ef6cbd4ed2c6936","first_computed_at":"2026-05-18T03:02:45.997182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:45.997182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NJ2PyukwAezCbvntKxqUlEvuXM++XbpM6Jonj3gc9CoPTMAB3JHVVgpiu0fI1JZjfWoNEXBXVntmW1GjD8e7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:45.997955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:914e4454c53f74917d6c5e149b832395a79682bc444df1ac65fc09cfbc810ec9","sha256:0e80c693ad78b87cd4d85f0635c231de427c3399cd9c5446392f62235a04ecec"],"state_sha256":"b85c74cc35a82a948afda9d1578c1eaff0939995025956d205477b80a4bd4608"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDAjSBQYiYR/qAn0XEmrH1w+bENzK0Wre4xUoUeWFIxbmQV1bMQoG5ssV3qy6NVnac0A/Xk81T9gEfMic8mADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:22:22.836722Z","bundle_sha256":"82b710615bc9c872c6bac37b0c9cbbf84baee2ada54cbf0d9eae18074240ec3a"}}