{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D6UQAL6IFHI247SJKESMPWMM66","short_pith_number":"pith:D6UQAL6I","canonical_record":{"source":{"id":"1801.04466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-13T17:24:59Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"e16a1d2ec669cecec037492f88612dcf04e9d2383c1b4cd509d899442c81022f","abstract_canon_sha256":"f7b55c0ebdfe167e72d1ce6eb3e9d9edfc2ced9f131c799c425bfb8c5d265301"},"schema_version":"1.0"},"canonical_sha256":"1fa9002fc829d1ae7e495124c7d98cf78b111195528b624c6145d92733bd7d3b","source":{"kind":"arxiv","id":"1801.04466","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04466","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04466v1","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04466","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"D6UQAL6IFHI2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6UQAL6IFHI247SJ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6UQAL6I","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D6UQAL6IFHI247SJKESMPWMM66","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-13T17:24:59Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"e16a1d2ec669cecec037492f88612dcf04e9d2383c1b4cd509d899442c81022f","abstract_canon_sha256":"f7b55c0ebdfe167e72d1ce6eb3e9d9edfc2ced9f131c799c425bfb8c5d265301"},"schema_version":"1.0"},"canonical_sha256":"1fa9002fc829d1ae7e495124c7d98cf78b111195528b624c6145d92733bd7d3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:06.401421Z","signature_b64":"ywSnRwdIhSnigYWKILMAVVVn5xBWvu5fNHMYBTPd0kPv44pmGsq1hy4iQR5Hahn44XhxQHOrzcCHYZ17b5ezCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fa9002fc829d1ae7e495124c7d98cf78b111195528b624c6145d92733bd7d3b","last_reissued_at":"2026-05-18T00:26:06.400907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:06.400907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04466","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-18T00:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UwrRQOGBXLFE54YQM0svQ3wgx76dChT4C4fx8atKOlnnydSXN4A9XaEHBk1gQ5Bcp2kYxi4zDyDHU51JPMvzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:55:24.838071Z"},"content_sha256":"76c00325ed8ddcc25a6a84e75571d7fa98b670d78a7173da0ed0b591aa2eca39","schema_version":"1.0","event_id":"sha256:76c00325ed8ddcc25a6a84e75571d7fa98b670d78a7173da0ed0b591aa2eca39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D6UQAL6IFHI247SJKESMPWMM66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lattice Erasure Codes of Low Rank with Noise Margins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Vinay A. Vaishampayan","submitted_at":"2018-01-13T17:24:59Z","abstract_excerpt":"We consider the following generalization of an $(n,k)$ MDS code for application to an erasure channel with additive noise. Like an MDS code, our code is required to be decodable from any $k$ received symbols, in the absence of noise. In addition, we require that the noise margin for every allowable erasure pattern be as large as possible and that the code satisfy a power constraint. In this paper we derive performance bounds and present a few designs for low rank lattice codes for an additive noise channel with erasures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04466","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-18T00:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vxrmOXQ1nbxYoqvuY/drL4bLVF2/GgZirHZdMzgmJOH84/0nBbByDJYZniTR98fsz7aE+PH6vJRVGirhaNotCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:55:24.838417Z"},"content_sha256":"bdb9694f8ddb8b0d7ca4b0eb719c59f7c8757202844bc441a2b0622702f840ee","schema_version":"1.0","event_id":"sha256:bdb9694f8ddb8b0d7ca4b0eb719c59f7c8757202844bc441a2b0622702f840ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6UQAL6IFHI247SJKESMPWMM66/bundle.json","state_url":"https://pith.science/pith/D6UQAL6IFHI247SJKESMPWMM66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6UQAL6IFHI247SJKESMPWMM66/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-20T22:55:24Z","links":{"resolver":"https://pith.science/pith/D6UQAL6IFHI247SJKESMPWMM66","bundle":"https://pith.science/pith/D6UQAL6IFHI247SJKESMPWMM66/bundle.json","state":"https://pith.science/pith/D6UQAL6IFHI247SJKESMPWMM66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6UQAL6IFHI247SJKESMPWMM66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D6UQAL6IFHI247SJKESMPWMM66","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":"f7b55c0ebdfe167e72d1ce6eb3e9d9edfc2ced9f131c799c425bfb8c5d265301","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-13T17:24:59Z","title_canon_sha256":"e16a1d2ec669cecec037492f88612dcf04e9d2383c1b4cd509d899442c81022f"},"schema_version":"1.0","source":{"id":"1801.04466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04466","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04466v1","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04466","created_at":"2026-05-18T00:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"D6UQAL6IFHI2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D6UQAL6IFHI247SJ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D6UQAL6I","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:bdb9694f8ddb8b0d7ca4b0eb719c59f7c8757202844bc441a2b0622702f840ee","target":"graph","created_at":"2026-05-18T00:26:06Z","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 the following generalization of an $(n,k)$ MDS code for application to an erasure channel with additive noise. Like an MDS code, our code is required to be decodable from any $k$ received symbols, in the absence of noise. In addition, we require that the noise margin for every allowable erasure pattern be as large as possible and that the code satisfy a power constraint. In this paper we derive performance bounds and present a few designs for low rank lattice codes for an additive noise channel with erasures.","authors_text":"Vinay A. Vaishampayan","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-13T17:24:59Z","title":"Lattice Erasure Codes of Low Rank with Noise Margins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04466","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:76c00325ed8ddcc25a6a84e75571d7fa98b670d78a7173da0ed0b591aa2eca39","target":"record","created_at":"2026-05-18T00:26:06Z","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":"f7b55c0ebdfe167e72d1ce6eb3e9d9edfc2ced9f131c799c425bfb8c5d265301","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-13T17:24:59Z","title_canon_sha256":"e16a1d2ec669cecec037492f88612dcf04e9d2383c1b4cd509d899442c81022f"},"schema_version":"1.0","source":{"id":"1801.04466","kind":"arxiv","version":1}},"canonical_sha256":"1fa9002fc829d1ae7e495124c7d98cf78b111195528b624c6145d92733bd7d3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fa9002fc829d1ae7e495124c7d98cf78b111195528b624c6145d92733bd7d3b","first_computed_at":"2026-05-18T00:26:06.400907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:06.400907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ywSnRwdIhSnigYWKILMAVVVn5xBWvu5fNHMYBTPd0kPv44pmGsq1hy4iQR5Hahn44XhxQHOrzcCHYZ17b5ezCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:06.401421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76c00325ed8ddcc25a6a84e75571d7fa98b670d78a7173da0ed0b591aa2eca39","sha256:bdb9694f8ddb8b0d7ca4b0eb719c59f7c8757202844bc441a2b0622702f840ee"],"state_sha256":"5c319510060d655608a4b5fa5c05a738d780be5519ee95d8cb0d4461da3c0553"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSGdhfmsijU77bfAGt03DnoIoUBAFIIJHrmWpgCVZB2hqPwtKhbR0Zmi9p2c8Ptroflaq95tqRsVWbPwfbPXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T22:55:24.840173Z","bundle_sha256":"9d81bb104049e6580277b4c9fbbf7cde978a138bc9c6a5c63f6ee6d6293c326a"}}