{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NUEJ26XVJ6QBDFN4WUAHP7HZE4","short_pith_number":"pith:NUEJ26XV","schema_version":"1.0","canonical_sha256":"6d089d7af54fa01195bcb50077fcf92709be9446789e95053e37be1d6eb15ceb","source":{"kind":"arxiv","id":"2205.08149","version":1},"attestation_state":"computed","paper":{"title":"A Novel K-Repetition Design for SCMA","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Gaojie Chen, Jing Lei, Ke Lai, Lei Wen, Pei Xiao, Zilong Liu","submitted_at":"2022-05-17T07:33:58Z","abstract_excerpt":"This work presents a novel K-Repetition based HARQ scheme for LDPC coded uplink SCMA by employing a network coding (NC) principle to encode different packets, where K-Repetition is an emerging technique (recommended in 3GPP Release 15) for enhanced reliability and reduced latency in future massive machine-type communication. Such a scheme is referred to as the NC aided K-repetition SCMA (NCK-SCMA). We introduce a joint iterative detection algorithm for improved detection of the data from the proposed LDPC coded NCKSCMA systems. Simulation results demonstrate the benefits of NCK-SCMA with highe"},"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":"2205.08149","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2022-05-17T07:33:58Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"9a39271e825b0c6c79b43b6cebfe47c463151622c402ffbe862fd4c5089d70a5","abstract_canon_sha256":"809883f260c295865db77690aff6e3bb46f5bf4e2d4ba54d6f2e939d300feb59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:23:59.908453Z","signature_b64":"W+vw6VVPXydggCRlvYwzkKsVUJf8IlbuoaNr4abdKLvFw7mKzeMXkn6pl4xIkdgUDyPoFTxCaB0QFf/6+WcTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d089d7af54fa01195bcb50077fcf92709be9446789e95053e37be1d6eb15ceb","last_reissued_at":"2026-07-05T04:23:59.908031Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:23:59.908031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel K-Repetition Design for SCMA","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Gaojie Chen, Jing Lei, Ke Lai, Lei Wen, Pei Xiao, Zilong Liu","submitted_at":"2022-05-17T07:33:58Z","abstract_excerpt":"This work presents a novel K-Repetition based HARQ scheme for LDPC coded uplink SCMA by employing a network coding (NC) principle to encode different packets, where K-Repetition is an emerging technique (recommended in 3GPP Release 15) for enhanced reliability and reduced latency in future massive machine-type communication. Such a scheme is referred to as the NC aided K-repetition SCMA (NCK-SCMA). We introduce a joint iterative detection algorithm for improved detection of the data from the proposed LDPC coded NCKSCMA systems. Simulation results demonstrate the benefits of NCK-SCMA with highe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08149","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.08149/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2205.08149","created_at":"2026-07-05T04:23:59.908090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.08149v1","created_at":"2026-07-05T04:23:59.908090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08149","created_at":"2026-07-05T04:23:59.908090+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUEJ26XVJ6QB","created_at":"2026-07-05T04:23:59.908090+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUEJ26XVJ6QBDFN4","created_at":"2026-07-05T04:23:59.908090+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUEJ26XV","created_at":"2026-07-05T04:23:59.908090+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/NUEJ26XVJ6QBDFN4WUAHP7HZE4","json":"https://pith.science/pith/NUEJ26XVJ6QBDFN4WUAHP7HZE4.json","graph_json":"https://pith.science/api/pith-number/NUEJ26XVJ6QBDFN4WUAHP7HZE4/graph.json","events_json":"https://pith.science/api/pith-number/NUEJ26XVJ6QBDFN4WUAHP7HZE4/events.json","paper":"https://pith.science/paper/NUEJ26XV"},"agent_actions":{"view_html":"https://pith.science/pith/NUEJ26XVJ6QBDFN4WUAHP7HZE4","download_json":"https://pith.science/pith/NUEJ26XVJ6QBDFN4WUAHP7HZE4.json","view_paper":"https://pith.science/paper/NUEJ26XV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.08149&json=true","fetch_graph":"https://pith.science/api/pith-number/NUEJ26XVJ6QBDFN4WUAHP7HZE4/graph.json","fetch_events":"https://pith.science/api/pith-number/NUEJ26XVJ6QBDFN4WUAHP7HZE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUEJ26XVJ6QBDFN4WUAHP7HZE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUEJ26XVJ6QBDFN4WUAHP7HZE4/action/storage_attestation","attest_author":"https://pith.science/pith/NUEJ26XVJ6QBDFN4WUAHP7HZE4/action/author_attestation","sign_citation":"https://pith.science/pith/NUEJ26XVJ6QBDFN4WUAHP7HZE4/action/citation_signature","submit_replication":"https://pith.science/pith/NUEJ26XVJ6QBDFN4WUAHP7HZE4/action/replication_record"}},"created_at":"2026-07-05T04:23:59.908090+00:00","updated_at":"2026-07-05T04:23:59.908090+00:00"}