{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:O6W5IUMAYUNXSV2I5ALMQNC6HY","short_pith_number":"pith:O6W5IUMA","canonical_record":{"source":{"id":"1005.0167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-02T21:32:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4aa73f13e0dcabca70f565299d7462c547a26cd3f2806953c5949b5e51dd2ae9","abstract_canon_sha256":"7df7e64aaf7ab4ab12805f2980dda92379a9bb8ee1d039f6094ff4fbf0ccfd14"},"schema_version":"1.0"},"canonical_sha256":"77add45180c51b795748e816c8345e3e1b727176cf03af2ca28ca58160f01dc0","source":{"kind":"arxiv","id":"1005.0167","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0167","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0167v2","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0167","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"O6W5IUMAYUNX","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O6W5IUMAYUNXSV2I","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O6W5IUMA","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:O6W5IUMAYUNXSV2I5ALMQNC6HY","target":"record","payload":{"canonical_record":{"source":{"id":"1005.0167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-02T21:32:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4aa73f13e0dcabca70f565299d7462c547a26cd3f2806953c5949b5e51dd2ae9","abstract_canon_sha256":"7df7e64aaf7ab4ab12805f2980dda92379a9bb8ee1d039f6094ff4fbf0ccfd14"},"schema_version":"1.0"},"canonical_sha256":"77add45180c51b795748e816c8345e3e1b727176cf03af2ca28ca58160f01dc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:09.350966Z","signature_b64":"YsPCB4TqmJPpx1GMKL9yXmRSIw6iohMJYjT67q0LiUaq5G1gUMRuRusTOFtrS20mkmG6WoEpzxQ4W5OqPxyMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77add45180c51b795748e816c8345e3e1b727176cf03af2ca28ca58160f01dc0","last_reissued_at":"2026-05-18T02:24:09.350385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:09.350385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.0167","source_version":2,"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-18T02:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAYH3gyC6WWTzZ2iMlc7Ao5Doygf8uyiRAvBNL0XcR3hoYGhAWwfq85n2DWRLWH9IWCmln4KTDbrGGxBQYuRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:33:44.347425Z"},"content_sha256":"92a732774626ffa362974c68219f3c9409c3f2cb3efa7158564842b0481cdbf7","schema_version":"1.0","event_id":"sha256:92a732774626ffa362974c68219f3c9409c3f2cb3efa7158564842b0481cdbf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:O6W5IUMAYUNXSV2I5ALMQNC6HY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A digital interface for Gaussian relay and interference networks: Lifting codes from the discrete superposition model","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-05-02T21:32:14Z","abstract_excerpt":"For every Gaussian network, there exists a corresponding deterministic network called the discrete superposition network. We show that this discrete superposition network provides a near-optimal digital interface for operating a class consisting of many Gaussian networks in the sense that any code for the discrete superposition network can be naturally lifted to a corresponding code for the Gaussian network, while achieving a rate that is no more than a constant number of bits lesser than the rate it achieves for the discrete superposition network. This constant depends only on the number of n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0167","kind":"arxiv","version":2},"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-18T02:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nEwJP4CkTEoqgFmlE9YDE+9BrHbC3tM5fbaEV7VE9hpz7K6bWeSxM5itrdc0vVJelL0cGW9hXrbB1Oqzbh7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:33:44.348058Z"},"content_sha256":"be6707fc6c4b32ebe77313357ed8a551ed010055519af820cb54570a3f932d9e","schema_version":"1.0","event_id":"sha256:be6707fc6c4b32ebe77313357ed8a551ed010055519af820cb54570a3f932d9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6W5IUMAYUNXSV2I5ALMQNC6HY/bundle.json","state_url":"https://pith.science/pith/O6W5IUMAYUNXSV2I5ALMQNC6HY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6W5IUMAYUNXSV2I5ALMQNC6HY/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-05T06:33:44Z","links":{"resolver":"https://pith.science/pith/O6W5IUMAYUNXSV2I5ALMQNC6HY","bundle":"https://pith.science/pith/O6W5IUMAYUNXSV2I5ALMQNC6HY/bundle.json","state":"https://pith.science/pith/O6W5IUMAYUNXSV2I5ALMQNC6HY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6W5IUMAYUNXSV2I5ALMQNC6HY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O6W5IUMAYUNXSV2I5ALMQNC6HY","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":"7df7e64aaf7ab4ab12805f2980dda92379a9bb8ee1d039f6094ff4fbf0ccfd14","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-02T21:32:14Z","title_canon_sha256":"4aa73f13e0dcabca70f565299d7462c547a26cd3f2806953c5949b5e51dd2ae9"},"schema_version":"1.0","source":{"id":"1005.0167","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0167","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0167v2","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0167","created_at":"2026-05-18T02:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"O6W5IUMAYUNX","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O6W5IUMAYUNXSV2I","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O6W5IUMA","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:be6707fc6c4b32ebe77313357ed8a551ed010055519af820cb54570a3f932d9e","target":"graph","created_at":"2026-05-18T02:24:09Z","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":"For every Gaussian network, there exists a corresponding deterministic network called the discrete superposition network. We show that this discrete superposition network provides a near-optimal digital interface for operating a class consisting of many Gaussian networks in the sense that any code for the discrete superposition network can be naturally lifted to a corresponding code for the Gaussian network, while achieving a rate that is no more than a constant number of bits lesser than the rate it achieves for the discrete superposition network. This constant depends only on the number of n","authors_text":"M. Anand, P. R. Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-02T21:32:14Z","title":"A digital interface for Gaussian relay and interference networks: Lifting codes from the discrete superposition model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0167","kind":"arxiv","version":2},"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:92a732774626ffa362974c68219f3c9409c3f2cb3efa7158564842b0481cdbf7","target":"record","created_at":"2026-05-18T02:24:09Z","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":"7df7e64aaf7ab4ab12805f2980dda92379a9bb8ee1d039f6094ff4fbf0ccfd14","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-02T21:32:14Z","title_canon_sha256":"4aa73f13e0dcabca70f565299d7462c547a26cd3f2806953c5949b5e51dd2ae9"},"schema_version":"1.0","source":{"id":"1005.0167","kind":"arxiv","version":2}},"canonical_sha256":"77add45180c51b795748e816c8345e3e1b727176cf03af2ca28ca58160f01dc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77add45180c51b795748e816c8345e3e1b727176cf03af2ca28ca58160f01dc0","first_computed_at":"2026-05-18T02:24:09.350385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:09.350385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YsPCB4TqmJPpx1GMKL9yXmRSIw6iohMJYjT67q0LiUaq5G1gUMRuRusTOFtrS20mkmG6WoEpzxQ4W5OqPxyMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:09.350966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.0167","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92a732774626ffa362974c68219f3c9409c3f2cb3efa7158564842b0481cdbf7","sha256:be6707fc6c4b32ebe77313357ed8a551ed010055519af820cb54570a3f932d9e"],"state_sha256":"a2e9463771203954e366649819a069cc52485e7a79cbfe6c82a2bc031c736e5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92706Y2h5xduiIAyJnBMp7wiY2TvbMUEOIj+NtYSYTKIuFgsPVZSvO45Ey/odpqBe2p+ToDk0iI4p8kZhzKlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:33:44.353242Z","bundle_sha256":"509bae75eb3fe312e24435534138a479cae8f485424a3fd9449e9e6f8e40a15c"}}