{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:BXEJPON7D5SPJLF2D5MKDUC76S","short_pith_number":"pith:BXEJPON7","schema_version":"1.0","canonical_sha256":"0dc897b9bf1f64f4acba1f58a1d05ff4b18c88f274f5514f93fc8db4f4d9fce4","source":{"kind":"arxiv","id":"1001.2900","version":1},"attestation_state":"computed","paper":{"title":"A digital interface for Gaussian relay networks: lifting codes from the discrete superposition model to Gaussian relay networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"M. Anand, P. R. Kumar","submitted_at":"2010-01-17T15:41:48Z","abstract_excerpt":"For every Gaussian relay network with a single source-destination pair, it is known that there exists a corresponding deterministic network called the discrete superposition network that approximates its capacity uniformly over all SNR's to within a bounded number of bits. The next step in this program of rigorous approximation is to determine whether coding schemes for discrete superposition models can be lifted to Gaussian relay networks with a bounded rate loss independent of SNR. We establish precisely this property and show that the superposition model can thus serve as a strong surrogate"},"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":"1001.2900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-17T15:41:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e8c2f23f159d45a9fcf3ee180308e50a28803bb44523898db8652cf0a5c1e38","abstract_canon_sha256":"8ee174d77cd564c4ad1e316468546612aa119a978976a45524ffd888880b71ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:47.778240Z","signature_b64":"TZ/2ZOIHVEPC+UZ6VmLMBN8ZzFbuzuJyyx0puK+hnYDMeJelT+pGUIefqnvQ8hMC1o2Uv/ar5gMaVluN2MFxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dc897b9bf1f64f4acba1f58a1d05ff4b18c88f274f5514f93fc8db4f4d9fce4","last_reissued_at":"2026-05-18T00:58:47.777765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:47.777765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A digital interface for Gaussian relay networks: lifting codes from the discrete superposition model to Gaussian relay networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"M. Anand, P. R. Kumar","submitted_at":"2010-01-17T15:41:48Z","abstract_excerpt":"For every Gaussian relay network with a single source-destination pair, it is known that there exists a corresponding deterministic network called the discrete superposition network that approximates its capacity uniformly over all SNR's to within a bounded number of bits. The next step in this program of rigorous approximation is to determine whether coding schemes for discrete superposition models can be lifted to Gaussian relay networks with a bounded rate loss independent of SNR. We establish precisely this property and show that the superposition model can thus serve as a strong surrogate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2900","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":"1001.2900","created_at":"2026-05-18T00:58:47.777836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.2900v1","created_at":"2026-05-18T00:58:47.777836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2900","created_at":"2026-05-18T00:58:47.777836+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXEJPON7D5SP","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXEJPON7D5SPJLF2","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXEJPON7","created_at":"2026-05-18T12:26:05.355336+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/BXEJPON7D5SPJLF2D5MKDUC76S","json":"https://pith.science/pith/BXEJPON7D5SPJLF2D5MKDUC76S.json","graph_json":"https://pith.science/api/pith-number/BXEJPON7D5SPJLF2D5MKDUC76S/graph.json","events_json":"https://pith.science/api/pith-number/BXEJPON7D5SPJLF2D5MKDUC76S/events.json","paper":"https://pith.science/paper/BXEJPON7"},"agent_actions":{"view_html":"https://pith.science/pith/BXEJPON7D5SPJLF2D5MKDUC76S","download_json":"https://pith.science/pith/BXEJPON7D5SPJLF2D5MKDUC76S.json","view_paper":"https://pith.science/paper/BXEJPON7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.2900&json=true","fetch_graph":"https://pith.science/api/pith-number/BXEJPON7D5SPJLF2D5MKDUC76S/graph.json","fetch_events":"https://pith.science/api/pith-number/BXEJPON7D5SPJLF2D5MKDUC76S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXEJPON7D5SPJLF2D5MKDUC76S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXEJPON7D5SPJLF2D5MKDUC76S/action/storage_attestation","attest_author":"https://pith.science/pith/BXEJPON7D5SPJLF2D5MKDUC76S/action/author_attestation","sign_citation":"https://pith.science/pith/BXEJPON7D5SPJLF2D5MKDUC76S/action/citation_signature","submit_replication":"https://pith.science/pith/BXEJPON7D5SPJLF2D5MKDUC76S/action/replication_record"}},"created_at":"2026-05-18T00:58:47.777836+00:00","updated_at":"2026-05-18T00:58:47.777836+00:00"}