{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SUN26Q5BUU2ZHNWIEFQWQNF3XQ","short_pith_number":"pith:SUN26Q5B","canonical_record":{"source":{"id":"1804.05242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-14T15:55:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b362b1c62f9fd52dac0d951474ff7be45ea750dd9d07a8180bfd537b537111a2","abstract_canon_sha256":"df9565a60b00f66cfa44bff0703da7ca3ae8c68b728bca4573cc13384c82734d"},"schema_version":"1.0"},"canonical_sha256":"951baf43a1a53593b6c821616834bbbc38accab01c68bf0db076a0f5b95ffbf2","source":{"kind":"arxiv","id":"1804.05242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05242","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05242v1","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05242","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"SUN26Q5BUU2Z","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SUN26Q5BUU2ZHNWI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SUN26Q5B","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SUN26Q5BUU2ZHNWIEFQWQNF3XQ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-14T15:55:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b362b1c62f9fd52dac0d951474ff7be45ea750dd9d07a8180bfd537b537111a2","abstract_canon_sha256":"df9565a60b00f66cfa44bff0703da7ca3ae8c68b728bca4573cc13384c82734d"},"schema_version":"1.0"},"canonical_sha256":"951baf43a1a53593b6c821616834bbbc38accab01c68bf0db076a0f5b95ffbf2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:28.536268Z","signature_b64":"uKYy7QIgXx1t0J+2gFiTBg6KchXLzMSexvennn0OB0bx++pRPNiu1tuf/Lmrj58f+OFo+IR3LPEyLGECGPT1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"951baf43a1a53593b6c821616834bbbc38accab01c68bf0db076a0f5b95ffbf2","last_reissued_at":"2026-05-18T00:18:28.534832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:28.534832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05242","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-18T00:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dX04+rGchLZfPBEiG2Wcp0D5T+JseA7BIz47WDWolwg+bLRUPPDXSLzwDWqUJ4mKpRUlngiSrFtMdN2bEriEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:44:30.803055Z"},"content_sha256":"e364000f45170ec98dfea0805c7050fe70fbb4ba44b8a6a2ba4c387c1106c0c8","schema_version":"1.0","event_id":"sha256:e364000f45170ec98dfea0805c7050fe70fbb4ba44b8a6a2ba4c387c1106c0c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SUN26Q5BUU2ZHNWIEFQWQNF3XQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Low-Complexity Recursive Approach Toward Code-Domain NOMA for Massive Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Mohammad Vahid Jamali","submitted_at":"2018-04-14T15:55:10Z","abstract_excerpt":"Nonorthogonal multiple access (NOMA) is a promising technology to meet the demands of the next generation wireless networks on massive connectivity, high throughput and reliability, improved fairness, and low latency. In this context, code-domain NOMA which attempts to serve $K$ users in $M\\leq K$ orthogonal resource blocks, using a pattern matrix, is of utmost interest. However, extending the pattern matrix dimensions severely increases the detection complexity and hampers on the significant advantages that can be achieved using large pattern matrices. In this paper, we propose a novel approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05242","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-18T00:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jq3O0CKVpEXk8WWexdOhiY/Zcq+xdhuH0aACfRfThzbXBDGJkb8wZTiIXpbg+QmpsRoH9rm7br6JFBVGiGf4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:44:30.803422Z"},"content_sha256":"7567f708a9533fd44047cd19e0df3c9b76fa10b6581364028b499adf729772bd","schema_version":"1.0","event_id":"sha256:7567f708a9533fd44047cd19e0df3c9b76fa10b6581364028b499adf729772bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SUN26Q5BUU2ZHNWIEFQWQNF3XQ/bundle.json","state_url":"https://pith.science/pith/SUN26Q5BUU2ZHNWIEFQWQNF3XQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SUN26Q5BUU2ZHNWIEFQWQNF3XQ/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-02T01:44:30Z","links":{"resolver":"https://pith.science/pith/SUN26Q5BUU2ZHNWIEFQWQNF3XQ","bundle":"https://pith.science/pith/SUN26Q5BUU2ZHNWIEFQWQNF3XQ/bundle.json","state":"https://pith.science/pith/SUN26Q5BUU2ZHNWIEFQWQNF3XQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SUN26Q5BUU2ZHNWIEFQWQNF3XQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SUN26Q5BUU2ZHNWIEFQWQNF3XQ","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":"df9565a60b00f66cfa44bff0703da7ca3ae8c68b728bca4573cc13384c82734d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-14T15:55:10Z","title_canon_sha256":"b362b1c62f9fd52dac0d951474ff7be45ea750dd9d07a8180bfd537b537111a2"},"schema_version":"1.0","source":{"id":"1804.05242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05242","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05242v1","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05242","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"SUN26Q5BUU2Z","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SUN26Q5BUU2ZHNWI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SUN26Q5B","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:7567f708a9533fd44047cd19e0df3c9b76fa10b6581364028b499adf729772bd","target":"graph","created_at":"2026-05-18T00:18:28Z","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":"Nonorthogonal multiple access (NOMA) is a promising technology to meet the demands of the next generation wireless networks on massive connectivity, high throughput and reliability, improved fairness, and low latency. In this context, code-domain NOMA which attempts to serve $K$ users in $M\\leq K$ orthogonal resource blocks, using a pattern matrix, is of utmost interest. However, extending the pattern matrix dimensions severely increases the detection complexity and hampers on the significant advantages that can be achieved using large pattern matrices. In this paper, we propose a novel approa","authors_text":"Hessam Mahdavifar, Mohammad Vahid Jamali","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-14T15:55:10Z","title":"A Low-Complexity Recursive Approach Toward Code-Domain NOMA for Massive Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05242","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:e364000f45170ec98dfea0805c7050fe70fbb4ba44b8a6a2ba4c387c1106c0c8","target":"record","created_at":"2026-05-18T00:18:28Z","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":"df9565a60b00f66cfa44bff0703da7ca3ae8c68b728bca4573cc13384c82734d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-14T15:55:10Z","title_canon_sha256":"b362b1c62f9fd52dac0d951474ff7be45ea750dd9d07a8180bfd537b537111a2"},"schema_version":"1.0","source":{"id":"1804.05242","kind":"arxiv","version":1}},"canonical_sha256":"951baf43a1a53593b6c821616834bbbc38accab01c68bf0db076a0f5b95ffbf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"951baf43a1a53593b6c821616834bbbc38accab01c68bf0db076a0f5b95ffbf2","first_computed_at":"2026-05-18T00:18:28.534832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:28.534832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uKYy7QIgXx1t0J+2gFiTBg6KchXLzMSexvennn0OB0bx++pRPNiu1tuf/Lmrj58f+OFo+IR3LPEyLGECGPT1Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:28.536268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e364000f45170ec98dfea0805c7050fe70fbb4ba44b8a6a2ba4c387c1106c0c8","sha256:7567f708a9533fd44047cd19e0df3c9b76fa10b6581364028b499adf729772bd"],"state_sha256":"8812b22bd2f75dfda766a42ae0a90dbf742170e3f9b64863688b576250c36ac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVIwLYn/Pf/dFqNyD0fTDc/XmkKruEgLYuPhnbnlqjs+WJs1VL7BrMeCAuXV2+FJBcfUxiavSCfE3ygS1VJEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:44:30.805451Z","bundle_sha256":"69efd64e7510df7b4746acfd7038717a0cf9bdd856bea11f4ac2939086620fac"}}