{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4I3ZFU3BML5FSIILV5APYBLVNQ","short_pith_number":"pith:4I3ZFU3B","schema_version":"1.0","canonical_sha256":"e23792d36162fa59210baf40fc05756c0d3fc340f528771d2f1f5499d7fafaf8","source":{"kind":"arxiv","id":"1603.06848","version":1},"attestation_state":"computed","paper":{"title":"Report on Dirty Paper Coding Estimation with multidimensional lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fernando P\\'erez-Gonz\\'alez, Pedro Comesa\\~na-Alfaro","submitted_at":"2016-03-22T16:06:43Z","abstract_excerpt":"In this report we include some derivations on a channel estimation method based on the use of Dirty Paper Coding. Specifically, we analyze the proposed method, named Dirty Paper-based Channel Estimation (DPCE), when the considered codebooks are high-dimensional lattices."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1603.06848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-22T16:06:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98caa46fc2c99b33f5497a538dbe4a684f9b1378fd4eaac0bf33de3d99a8f83e","abstract_canon_sha256":"d01b73d5bee7fedf81ea9de4cab9a82ad4931747ba284f7f2cacbe2d4f03e080"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:34.579992Z","signature_b64":"DSSaSwihSlEdGHD+3FqHjuGO8Faqtzg/b1RcTkgucIsZaFiyBhqd0Svh1+RGdk+nnmHDp96vGbxAFd68YmvFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e23792d36162fa59210baf40fc05756c0d3fc340f528771d2f1f5499d7fafaf8","last_reissued_at":"2026-05-18T01:18:34.579572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:34.579572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Report on Dirty Paper Coding Estimation with multidimensional lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fernando P\\'erez-Gonz\\'alez, Pedro Comesa\\~na-Alfaro","submitted_at":"2016-03-22T16:06:43Z","abstract_excerpt":"In this report we include some derivations on a channel estimation method based on the use of Dirty Paper Coding. Specifically, we analyze the proposed method, named Dirty Paper-based Channel Estimation (DPCE), when the considered codebooks are high-dimensional lattices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06848","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.06848","created_at":"2026-05-18T01:18:34.579648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06848v1","created_at":"2026-05-18T01:18:34.579648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06848","created_at":"2026-05-18T01:18:34.579648+00:00"},{"alias_kind":"pith_short_12","alias_value":"4I3ZFU3BML5F","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4I3ZFU3BML5FSIIL","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4I3ZFU3B","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4I3ZFU3BML5FSIILV5APYBLVNQ","json":"https://pith.science/pith/4I3ZFU3BML5FSIILV5APYBLVNQ.json","graph_json":"https://pith.science/api/pith-number/4I3ZFU3BML5FSIILV5APYBLVNQ/graph.json","events_json":"https://pith.science/api/pith-number/4I3ZFU3BML5FSIILV5APYBLVNQ/events.json","paper":"https://pith.science/paper/4I3ZFU3B"},"agent_actions":{"view_html":"https://pith.science/pith/4I3ZFU3BML5FSIILV5APYBLVNQ","download_json":"https://pith.science/pith/4I3ZFU3BML5FSIILV5APYBLVNQ.json","view_paper":"https://pith.science/paper/4I3ZFU3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06848&json=true","fetch_graph":"https://pith.science/api/pith-number/4I3ZFU3BML5FSIILV5APYBLVNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4I3ZFU3BML5FSIILV5APYBLVNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4I3ZFU3BML5FSIILV5APYBLVNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4I3ZFU3BML5FSIILV5APYBLVNQ/action/storage_attestation","attest_author":"https://pith.science/pith/4I3ZFU3BML5FSIILV5APYBLVNQ/action/author_attestation","sign_citation":"https://pith.science/pith/4I3ZFU3BML5FSIILV5APYBLVNQ/action/citation_signature","submit_replication":"https://pith.science/pith/4I3ZFU3BML5FSIILV5APYBLVNQ/action/replication_record"}},"created_at":"2026-05-18T01:18:34.579648+00:00","updated_at":"2026-05-18T01:18:34.579648+00:00"}