{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2WTZEDSTGISEHCU6EAAGLACGRZ","short_pith_number":"pith:2WTZEDST","canonical_record":{"source":{"id":"1901.03274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T17:04:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"58c79589f167fa24fcf41a15632765dc874996d73bea3452b18b34c5238d1559","abstract_canon_sha256":"53f8f43a3cd90068d6a428334515e8e0d974fcc415f3de99df2f37428f5e85bb"},"schema_version":"1.0"},"canonical_sha256":"d5a7920e533224438a9e20006580468e5b471d973ab733472d24690de3c72de4","source":{"kind":"arxiv","id":"1901.03274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03274","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03274v1","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03274","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"2WTZEDSTGISE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2WTZEDSTGISEHCU6","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2WTZEDST","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2WTZEDSTGISEHCU6EAAGLACGRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T17:04:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"58c79589f167fa24fcf41a15632765dc874996d73bea3452b18b34c5238d1559","abstract_canon_sha256":"53f8f43a3cd90068d6a428334515e8e0d974fcc415f3de99df2f37428f5e85bb"},"schema_version":"1.0"},"canonical_sha256":"d5a7920e533224438a9e20006580468e5b471d973ab733472d24690de3c72de4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:34.887759Z","signature_b64":"BD/H0/MwXsJsfEsKfWQa/9goxCv96Rjt4YnY2cEY0cmoPan1Ujk3SjiHkFilzpMLTerfR8TsWzRuAycvr0RZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5a7920e533224438a9e20006580468e5b471d973ab733472d24690de3c72de4","last_reissued_at":"2026-05-17T23:56:34.887233Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:34.887233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03274","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-17T23:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owVRezUB+wDWGxruHLg2tHk0Qyq79aKDWS+yl49DiLutm869k8QRgo4AeeUeSqoUTsjqtc0BvGPwDrzhMcwDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:25:58.638174Z"},"content_sha256":"c254898d3279af4af90547e8d2a9c913cf199cd30f3d0df6208f74007d118d50","schema_version":"1.0","event_id":"sha256:c254898d3279af4af90547e8d2a9c913cf199cd30f3d0df6208f74007d118d50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2WTZEDSTGISEHCU6EAAGLACGRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards an Algebraic Network Information Theory: Simultaneous Joint Typicality Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adriano Pastore, Bobak Nazer, Chen Feng, Michael Gastpar, Sung Hoon Lim","submitted_at":"2019-01-10T17:04:01Z","abstract_excerpt":"Consider a receiver in a multi-user network that wishes to decode several messages. Simultaneous joint typicality decoding is one of the most powerful techniques for determining the fundamental limits at which reliable decoding is possible. This technique has historically been used in conjunction with random i.i.d. codebooks to establish achievable rate regions for networks. Recently, it has been shown that, in certain scenarios, nested linear codebooks in conjunction with \"single-user\" or sequential decoding can yield better achievable rates. For instance, the compute-forward problem examines"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03274","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-17T23:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5u5tnk0AiFzjtnXEJ+NwNqMRiv14c4nZ4HMODcADMgBDWstyjbaPC5Q/IgO+hwW/iDR3kRhyTRLAE895mArCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:25:58.638961Z"},"content_sha256":"510de9498d8c4f5d3cd3b7aa95f84880b12361e8b659b8ad3ec92e69422de7de","schema_version":"1.0","event_id":"sha256:510de9498d8c4f5d3cd3b7aa95f84880b12361e8b659b8ad3ec92e69422de7de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WTZEDSTGISEHCU6EAAGLACGRZ/bundle.json","state_url":"https://pith.science/pith/2WTZEDSTGISEHCU6EAAGLACGRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WTZEDSTGISEHCU6EAAGLACGRZ/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-05-31T13:25:58Z","links":{"resolver":"https://pith.science/pith/2WTZEDSTGISEHCU6EAAGLACGRZ","bundle":"https://pith.science/pith/2WTZEDSTGISEHCU6EAAGLACGRZ/bundle.json","state":"https://pith.science/pith/2WTZEDSTGISEHCU6EAAGLACGRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WTZEDSTGISEHCU6EAAGLACGRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2WTZEDSTGISEHCU6EAAGLACGRZ","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":"53f8f43a3cd90068d6a428334515e8e0d974fcc415f3de99df2f37428f5e85bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T17:04:01Z","title_canon_sha256":"58c79589f167fa24fcf41a15632765dc874996d73bea3452b18b34c5238d1559"},"schema_version":"1.0","source":{"id":"1901.03274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03274","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03274v1","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03274","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"2WTZEDSTGISE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2WTZEDSTGISEHCU6","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2WTZEDST","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:510de9498d8c4f5d3cd3b7aa95f84880b12361e8b659b8ad3ec92e69422de7de","target":"graph","created_at":"2026-05-17T23:56:34Z","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":"Consider a receiver in a multi-user network that wishes to decode several messages. Simultaneous joint typicality decoding is one of the most powerful techniques for determining the fundamental limits at which reliable decoding is possible. This technique has historically been used in conjunction with random i.i.d. codebooks to establish achievable rate regions for networks. Recently, it has been shown that, in certain scenarios, nested linear codebooks in conjunction with \"single-user\" or sequential decoding can yield better achievable rates. For instance, the compute-forward problem examines","authors_text":"Adriano Pastore, Bobak Nazer, Chen Feng, Michael Gastpar, Sung Hoon Lim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T17:04:01Z","title":"Towards an Algebraic Network Information Theory: Simultaneous Joint Typicality Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03274","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:c254898d3279af4af90547e8d2a9c913cf199cd30f3d0df6208f74007d118d50","target":"record","created_at":"2026-05-17T23:56:34Z","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":"53f8f43a3cd90068d6a428334515e8e0d974fcc415f3de99df2f37428f5e85bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T17:04:01Z","title_canon_sha256":"58c79589f167fa24fcf41a15632765dc874996d73bea3452b18b34c5238d1559"},"schema_version":"1.0","source":{"id":"1901.03274","kind":"arxiv","version":1}},"canonical_sha256":"d5a7920e533224438a9e20006580468e5b471d973ab733472d24690de3c72de4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5a7920e533224438a9e20006580468e5b471d973ab733472d24690de3c72de4","first_computed_at":"2026-05-17T23:56:34.887233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:34.887233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BD/H0/MwXsJsfEsKfWQa/9goxCv96Rjt4YnY2cEY0cmoPan1Ujk3SjiHkFilzpMLTerfR8TsWzRuAycvr0RZCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:34.887759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c254898d3279af4af90547e8d2a9c913cf199cd30f3d0df6208f74007d118d50","sha256:510de9498d8c4f5d3cd3b7aa95f84880b12361e8b659b8ad3ec92e69422de7de"],"state_sha256":"6253a3829cc2ad14166d962dbd65dc6a5619600fe594be78ab6a2f1a5b93d91f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYoBpOhBDfr0UQ61Kj365uKQe2V63Ee3Q55iGGSVKjnKQFkTuYReUETe8rApsAjRRbxA96b8+aXXwuuceW97Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:25:58.643752Z","bundle_sha256":"b1879ae9d0ada166d425723e98729d2dde901aaa690cd03f6117a06fb819a273"}}