{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SAOOAODKJ6EVZ4QQUXDLMVK6IR","short_pith_number":"pith:SAOOAODK","canonical_record":{"source":{"id":"1901.06757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T01:09:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5966640ba970d503312d67f2b737e4e14db2206ff2e958b5ac6a27915f5a4dad","abstract_canon_sha256":"316b30de0922b25644818ef58799a9d986a13031ef9bdf3b4909a10d89ec8ff6"},"schema_version":"1.0"},"canonical_sha256":"901ce0386a4f895cf210a5c6b6555e4467c81d94149e9f45042b7f8a06821f31","source":{"kind":"arxiv","id":"1901.06757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06757","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06757v1","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06757","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"SAOOAODKJ6EV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SAOOAODKJ6EVZ4QQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SAOOAODK","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SAOOAODKJ6EVZ4QQUXDLMVK6IR","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T01:09:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5966640ba970d503312d67f2b737e4e14db2206ff2e958b5ac6a27915f5a4dad","abstract_canon_sha256":"316b30de0922b25644818ef58799a9d986a13031ef9bdf3b4909a10d89ec8ff6"},"schema_version":"1.0"},"canonical_sha256":"901ce0386a4f895cf210a5c6b6555e4467c81d94149e9f45042b7f8a06821f31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:49.223556Z","signature_b64":"vhgrxOXL5WKlXSZUj4DEYwE1XkNnXHBPphPR534GHpB/AtUlv0+Gd7ZqrXYbqrCAx4NQ+cvAsctV8fjED50HAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"901ce0386a4f895cf210a5c6b6555e4467c81d94149e9f45042b7f8a06821f31","last_reissued_at":"2026-05-17T23:55:49.222754Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:49.222754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06757","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:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HUmC54WJFjl82yp1VOMQFp2QDBJfgeDqrSW9Pd3GveMrCdl2ikhvYDvZ/AiE/zZfyZOyDRPs1R3BKt2ZiQU0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:38:49.659610Z"},"content_sha256":"f53e8882456f46a0a186c16456c0958df68e6aed7ca2e46565cd30ba454c8edf","schema_version":"1.0","event_id":"sha256:f53e8882456f46a0a186c16456c0958df68e6aed7ca2e46565cd30ba454c8edf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SAOOAODKJ6EVZ4QQUXDLMVK6IR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A construction of UD $k$-ary multi-user codes from $(2^m(k-1)+1)$-ary codes for MAAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hiroshi Kamabe, Jun Cheng, Shan Lu, Wei Hou","submitted_at":"2019-01-21T01:09:49Z","abstract_excerpt":"In this paper, we proposed a construction of a UD $k$-ary $T$-user coding scheme for MAAC. We first give a construction of $k$-ary $T^{f+g}$-user UD code from a $k$-ary $T^{f}$-user UD code and a $k^{\\pm}$-ary $T^{g}$-user difference set with its two component sets $\\mathcal{D}^{+}$ and $\\mathcal{D}^{-}$ {\\em a priori}. Based on the $k^{\\pm}$-ary $T^{g}$-user difference set constructed from a $(2k-1)$-ary UD code, we recursively construct a UD $k$-ary $T$-user codes with code length of $2^m$ from initial multi-user codes of $k$-ary, $2(k-1)+1$-ary, \\dots, $(2^m(k-1)+1)$-ary. Introducing multi-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06757","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:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9gnTF6+a6QK6EDTYxFagVH69ZW+K4Xtc2rSdXOMxvwh0qP4T3x/GBGwlitT6dqf0WUJmOXX6ecF3kvKGIodhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:38:49.659955Z"},"content_sha256":"22395265edb08ddd2cdba4f0af551e9cdcd36b9d7e5d2f4918bb21849a2fa7fd","schema_version":"1.0","event_id":"sha256:22395265edb08ddd2cdba4f0af551e9cdcd36b9d7e5d2f4918bb21849a2fa7fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAOOAODKJ6EVZ4QQUXDLMVK6IR/bundle.json","state_url":"https://pith.science/pith/SAOOAODKJ6EVZ4QQUXDLMVK6IR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAOOAODKJ6EVZ4QQUXDLMVK6IR/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-01T10:38:49Z","links":{"resolver":"https://pith.science/pith/SAOOAODKJ6EVZ4QQUXDLMVK6IR","bundle":"https://pith.science/pith/SAOOAODKJ6EVZ4QQUXDLMVK6IR/bundle.json","state":"https://pith.science/pith/SAOOAODKJ6EVZ4QQUXDLMVK6IR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAOOAODKJ6EVZ4QQUXDLMVK6IR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SAOOAODKJ6EVZ4QQUXDLMVK6IR","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":"316b30de0922b25644818ef58799a9d986a13031ef9bdf3b4909a10d89ec8ff6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T01:09:49Z","title_canon_sha256":"5966640ba970d503312d67f2b737e4e14db2206ff2e958b5ac6a27915f5a4dad"},"schema_version":"1.0","source":{"id":"1901.06757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06757","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06757v1","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06757","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"SAOOAODKJ6EV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SAOOAODKJ6EVZ4QQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SAOOAODK","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:22395265edb08ddd2cdba4f0af551e9cdcd36b9d7e5d2f4918bb21849a2fa7fd","target":"graph","created_at":"2026-05-17T23:55:49Z","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":"In this paper, we proposed a construction of a UD $k$-ary $T$-user coding scheme for MAAC. We first give a construction of $k$-ary $T^{f+g}$-user UD code from a $k$-ary $T^{f}$-user UD code and a $k^{\\pm}$-ary $T^{g}$-user difference set with its two component sets $\\mathcal{D}^{+}$ and $\\mathcal{D}^{-}$ {\\em a priori}. Based on the $k^{\\pm}$-ary $T^{g}$-user difference set constructed from a $(2k-1)$-ary UD code, we recursively construct a UD $k$-ary $T$-user codes with code length of $2^m$ from initial multi-user codes of $k$-ary, $2(k-1)+1$-ary, \\dots, $(2^m(k-1)+1)$-ary. Introducing multi-","authors_text":"Hiroshi Kamabe, Jun Cheng, Shan Lu, Wei Hou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T01:09:49Z","title":"A construction of UD $k$-ary multi-user codes from $(2^m(k-1)+1)$-ary codes for MAAC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06757","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:f53e8882456f46a0a186c16456c0958df68e6aed7ca2e46565cd30ba454c8edf","target":"record","created_at":"2026-05-17T23:55:49Z","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":"316b30de0922b25644818ef58799a9d986a13031ef9bdf3b4909a10d89ec8ff6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T01:09:49Z","title_canon_sha256":"5966640ba970d503312d67f2b737e4e14db2206ff2e958b5ac6a27915f5a4dad"},"schema_version":"1.0","source":{"id":"1901.06757","kind":"arxiv","version":1}},"canonical_sha256":"901ce0386a4f895cf210a5c6b6555e4467c81d94149e9f45042b7f8a06821f31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"901ce0386a4f895cf210a5c6b6555e4467c81d94149e9f45042b7f8a06821f31","first_computed_at":"2026-05-17T23:55:49.222754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:49.222754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vhgrxOXL5WKlXSZUj4DEYwE1XkNnXHBPphPR534GHpB/AtUlv0+Gd7ZqrXYbqrCAx4NQ+cvAsctV8fjED50HAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:49.223556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f53e8882456f46a0a186c16456c0958df68e6aed7ca2e46565cd30ba454c8edf","sha256:22395265edb08ddd2cdba4f0af551e9cdcd36b9d7e5d2f4918bb21849a2fa7fd"],"state_sha256":"f8e8b84929bc7c344c9cdab8bfeba38fa3f0261a67e8762998cfff6e4112968d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/wM0ICUX1ykAqd1XBrAJ34RI7ync203GXMgzIrC8x+A5IlGM0ci+6T5eKl7S5w/DUq74VW8CBu2tdgOoJW5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:38:49.661906Z","bundle_sha256":"500334cd438c2ef79c6720aa463d3d19958ab50cea1b324d70e85729c9da25d5"}}