{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:CR6VK6AXU7QBDR2QXIXHGTPNAF","short_pith_number":"pith:CR6VK6AX","canonical_record":{"source":{"id":"2007.06739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-13T23:53:42Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"0e2d88a127a5ca4e319cb65cc0d8e88f0d690ea83d36a473fd758c05c77467fd","abstract_canon_sha256":"6838cb2f303cba5d1d0851654d7e9ed095202d633aea723f82aa89ecf8ebf569"},"schema_version":"1.0"},"canonical_sha256":"147d557817a7e011c750ba2e734ded017fc5c07db176a5a466c7e6a35d4586ee","source":{"kind":"arxiv","id":"2007.06739","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.06739","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"2007.06739v3","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.06739","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"CR6VK6AXU7QB","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_16","alias_value":"CR6VK6AXU7QBDR2Q","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_8","alias_value":"CR6VK6AX","created_at":"2026-07-05T01:53:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:CR6VK6AXU7QBDR2QXIXHGTPNAF","target":"record","payload":{"canonical_record":{"source":{"id":"2007.06739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-13T23:53:42Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"0e2d88a127a5ca4e319cb65cc0d8e88f0d690ea83d36a473fd758c05c77467fd","abstract_canon_sha256":"6838cb2f303cba5d1d0851654d7e9ed095202d633aea723f82aa89ecf8ebf569"},"schema_version":"1.0"},"canonical_sha256":"147d557817a7e011c750ba2e734ded017fc5c07db176a5a466c7e6a35d4586ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:21.123109Z","signature_b64":"Aln0aDflMvojLtyPUDL0OM4Qbkf8vIg2BahgwiUK2xmF5tAXjBql4iBfF5NPyhcUVwMRkEgDXNKInkHaQAzdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"147d557817a7e011c750ba2e734ded017fc5c07db176a5a466c7e6a35d4586ee","last_reissued_at":"2026-07-05T01:53:21.122643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:21.122643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.06739","source_version":3,"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-07-05T01:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QD/jwxX1ez5F6AbK3IM5F3bU+raBfq4j/JRR/UglMHAaeLaR1lZGv3iXVLeJIVVrky50FvZIxCKxFsysJnR1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T14:45:54.727187Z"},"content_sha256":"15b5472702f08a8dc9970620c8a4a0cecb5352f675c29a23bcbdb7464f51437a","schema_version":"1.0","event_id":"sha256:15b5472702f08a8dc9970620c8a4a0cecb5352f675c29a23bcbdb7464f51437a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:CR6VK6AXU7QBDR2QXIXHGTPNAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Orthogonal Sparse Superposition Codes for Ultra-Reliable Low-Latency Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jeonghun Park, Namyoon Lee, Songnam Hong, Yunseo Nam","submitted_at":"2020-07-13T23:53:42Z","abstract_excerpt":"This paper presents a new class of sparse superposition codes for low-rates and short-packet communications over the additive white Gaussian noise channel. The new code is orthogonal sparse superposition (OSS) code. A codeword of OSS codes is represented as a superposition of sparse sub-codewords whose support sets are mutually non-overlapping. To construct such codewords in a computationally efficient manner, a successive encoding method is presented. Harnessing the orthogonal property among sub-codewords, a simple yet near-optimal decoding method is proposed, which performs element-wise maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.06739","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.06739/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFZg+Tj4au6QMo1+BcQCCtyIIa7N0mn11sa9KF6mMvusovHIggMxhszEADy3kcXrm6oViXMaDyQI58j95e0XDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T14:45:54.727574Z"},"content_sha256":"c8c030191d00259a7aee531b8c0e9908b1d23e3f3e473ecabf45e9320ec5ad0f","schema_version":"1.0","event_id":"sha256:c8c030191d00259a7aee531b8c0e9908b1d23e3f3e473ecabf45e9320ec5ad0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CR6VK6AXU7QBDR2QXIXHGTPNAF/bundle.json","state_url":"https://pith.science/pith/CR6VK6AXU7QBDR2QXIXHGTPNAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CR6VK6AXU7QBDR2QXIXHGTPNAF/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-07-18T14:45:54Z","links":{"resolver":"https://pith.science/pith/CR6VK6AXU7QBDR2QXIXHGTPNAF","bundle":"https://pith.science/pith/CR6VK6AXU7QBDR2QXIXHGTPNAF/bundle.json","state":"https://pith.science/pith/CR6VK6AXU7QBDR2QXIXHGTPNAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CR6VK6AXU7QBDR2QXIXHGTPNAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:CR6VK6AXU7QBDR2QXIXHGTPNAF","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":"6838cb2f303cba5d1d0851654d7e9ed095202d633aea723f82aa89ecf8ebf569","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-13T23:53:42Z","title_canon_sha256":"0e2d88a127a5ca4e319cb65cc0d8e88f0d690ea83d36a473fd758c05c77467fd"},"schema_version":"1.0","source":{"id":"2007.06739","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.06739","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"2007.06739v3","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.06739","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"CR6VK6AXU7QB","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_16","alias_value":"CR6VK6AXU7QBDR2Q","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_8","alias_value":"CR6VK6AX","created_at":"2026-07-05T01:53:21Z"}],"graph_snapshots":[{"event_id":"sha256:c8c030191d00259a7aee531b8c0e9908b1d23e3f3e473ecabf45e9320ec5ad0f","target":"graph","created_at":"2026-07-05T01:53:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.06739/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a new class of sparse superposition codes for low-rates and short-packet communications over the additive white Gaussian noise channel. The new code is orthogonal sparse superposition (OSS) code. A codeword of OSS codes is represented as a superposition of sparse sub-codewords whose support sets are mutually non-overlapping. To construct such codewords in a computationally efficient manner, a successive encoding method is presented. Harnessing the orthogonal property among sub-codewords, a simple yet near-optimal decoding method is proposed, which performs element-wise maxi","authors_text":"Jeonghun Park, Namyoon Lee, Songnam Hong, Yunseo Nam","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-13T23:53:42Z","title":"Orthogonal Sparse Superposition Codes for Ultra-Reliable Low-Latency Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.06739","kind":"arxiv","version":3},"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:15b5472702f08a8dc9970620c8a4a0cecb5352f675c29a23bcbdb7464f51437a","target":"record","created_at":"2026-07-05T01:53:21Z","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":"6838cb2f303cba5d1d0851654d7e9ed095202d633aea723f82aa89ecf8ebf569","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-13T23:53:42Z","title_canon_sha256":"0e2d88a127a5ca4e319cb65cc0d8e88f0d690ea83d36a473fd758c05c77467fd"},"schema_version":"1.0","source":{"id":"2007.06739","kind":"arxiv","version":3}},"canonical_sha256":"147d557817a7e011c750ba2e734ded017fc5c07db176a5a466c7e6a35d4586ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"147d557817a7e011c750ba2e734ded017fc5c07db176a5a466c7e6a35d4586ee","first_computed_at":"2026-07-05T01:53:21.122643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:53:21.122643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Aln0aDflMvojLtyPUDL0OM4Qbkf8vIg2BahgwiUK2xmF5tAXjBql4iBfF5NPyhcUVwMRkEgDXNKInkHaQAzdCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:53:21.123109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.06739","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15b5472702f08a8dc9970620c8a4a0cecb5352f675c29a23bcbdb7464f51437a","sha256:c8c030191d00259a7aee531b8c0e9908b1d23e3f3e473ecabf45e9320ec5ad0f"],"state_sha256":"0b780a962593db22471cbab0764f0074946bd55c32e9dcf5cdb3c494017e74d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sgSa1KH6JVPJ91zG/8IpPghir3MxuhPIbifknmQOjs1RfrRBR0bh6NodYBU2mK8rC2oRof5rmtAZMp38kXqqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T14:45:54.729738Z","bundle_sha256":"02d6f67dd7347c74813e0c148d7e9914622d978b4a11111db834e15931e79018"}}