{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S6LSK5C5PBPETUJGOB2HIM25AI","short_pith_number":"pith:S6LSK5C5","canonical_record":{"source":{"id":"1505.07725","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T15:23:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c2b26fcc9b2b11734ae83a5598820aed397086247b283803e1d2ebac6eb275b","abstract_canon_sha256":"b35d514d5658d9eccd0607d2f3d876716cb81b2f9ff4a26688a597d55b85a9f9"},"schema_version":"1.0"},"canonical_sha256":"979725745d785e49d126707474335d02213a4f66124fe7a0c2bc831ce32383cb","source":{"kind":"arxiv","id":"1505.07725","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07725","created_at":"2026-05-18T01:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07725v2","created_at":"2026-05-18T01:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07725","created_at":"2026-05-18T01:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"S6LSK5C5PBPE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S6LSK5C5PBPETUJG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S6LSK5C5","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S6LSK5C5PBPETUJGOB2HIM25AI","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07725","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T15:23:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c2b26fcc9b2b11734ae83a5598820aed397086247b283803e1d2ebac6eb275b","abstract_canon_sha256":"b35d514d5658d9eccd0607d2f3d876716cb81b2f9ff4a26688a597d55b85a9f9"},"schema_version":"1.0"},"canonical_sha256":"979725745d785e49d126707474335d02213a4f66124fe7a0c2bc831ce32383cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:34.466090Z","signature_b64":"MN/nW5J2UfJhncV3pBK8t1RUI9LVVf2k6r0zSzuS19/q1ogunfMvtNCk8suYjtjxdGLi3hTnCWpiYkoO+QmlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"979725745d785e49d126707474335d02213a4f66124fe7a0c2bc831ce32383cb","last_reissued_at":"2026-05-18T01:59:34.465563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:34.465563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07725","source_version":2,"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-18T01:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Nbj2SECc28ckE9scr59Wfm+SN5Sllckja81w7YpZKP8R6XVzNx93BgJJ082GdAWe/jqteAwzofWFB5TY510Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:40:35.250766Z"},"content_sha256":"3925858e373e89612d6a51c908becd03dbd08596ad3d1d6e6c7a7a8744bc5641","schema_version":"1.0","event_id":"sha256:3925858e373e89612d6a51c908becd03dbd08596ad3d1d6e6c7a7a8744bc5641"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S6LSK5C5PBPETUJGOB2HIM25AI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance-Complexity Analysis for MAC ML-based Decoding with User Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arun Singh, Hsiao-feng (Francis) Lu, Petros Elia","submitted_at":"2015-05-28T15:23:35Z","abstract_excerpt":"This work explores the rate-reliability-complexity limits of the quasi-static K-user multiple access channel (MAC), with or without feedback. Using high-SNR asymptotics, the work first derives bounds on the computational resources required to achieve near-optimal (ML-based) decoding performance. It then bounds the (reduced) complexity needed to achieve any (including suboptimal) diversity-multiplexing performance tradeoff (DMT) performance, and finally bounds the same complexity, in the presence of feedback-aided user selection. This latter effort reveals the ability of a few bits of feedback "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07725","kind":"arxiv","version":2},"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-18T01:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzX2IlW9rJ2F6kJGCu3FXU/qV4otUvyQefdYAgx/ACGart7peQfjyHcEJzomlQPmlW/vpDlNDk3GjfK70J0wCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:40:35.251375Z"},"content_sha256":"f6c285e3ee7c3445b6a7e0efbaf793bc12cb02b04449882bef88066130d8fcb6","schema_version":"1.0","event_id":"sha256:f6c285e3ee7c3445b6a7e0efbaf793bc12cb02b04449882bef88066130d8fcb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI/bundle.json","state_url":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6LSK5C5PBPETUJGOB2HIM25AI/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-26T23:40:35Z","links":{"resolver":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI","bundle":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI/bundle.json","state":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6LSK5C5PBPETUJGOB2HIM25AI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S6LSK5C5PBPETUJGOB2HIM25AI","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":"b35d514d5658d9eccd0607d2f3d876716cb81b2f9ff4a26688a597d55b85a9f9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T15:23:35Z","title_canon_sha256":"3c2b26fcc9b2b11734ae83a5598820aed397086247b283803e1d2ebac6eb275b"},"schema_version":"1.0","source":{"id":"1505.07725","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07725","created_at":"2026-05-18T01:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07725v2","created_at":"2026-05-18T01:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07725","created_at":"2026-05-18T01:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"S6LSK5C5PBPE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S6LSK5C5PBPETUJG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S6LSK5C5","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:f6c285e3ee7c3445b6a7e0efbaf793bc12cb02b04449882bef88066130d8fcb6","target":"graph","created_at":"2026-05-18T01:59: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":"This work explores the rate-reliability-complexity limits of the quasi-static K-user multiple access channel (MAC), with or without feedback. Using high-SNR asymptotics, the work first derives bounds on the computational resources required to achieve near-optimal (ML-based) decoding performance. It then bounds the (reduced) complexity needed to achieve any (including suboptimal) diversity-multiplexing performance tradeoff (DMT) performance, and finally bounds the same complexity, in the presence of feedback-aided user selection. This latter effort reveals the ability of a few bits of feedback ","authors_text":"Arun Singh, Hsiao-feng (Francis) Lu, Petros Elia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T15:23:35Z","title":"Performance-Complexity Analysis for MAC ML-based Decoding with User Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07725","kind":"arxiv","version":2},"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:3925858e373e89612d6a51c908becd03dbd08596ad3d1d6e6c7a7a8744bc5641","target":"record","created_at":"2026-05-18T01:59: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":"b35d514d5658d9eccd0607d2f3d876716cb81b2f9ff4a26688a597d55b85a9f9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T15:23:35Z","title_canon_sha256":"3c2b26fcc9b2b11734ae83a5598820aed397086247b283803e1d2ebac6eb275b"},"schema_version":"1.0","source":{"id":"1505.07725","kind":"arxiv","version":2}},"canonical_sha256":"979725745d785e49d126707474335d02213a4f66124fe7a0c2bc831ce32383cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"979725745d785e49d126707474335d02213a4f66124fe7a0c2bc831ce32383cb","first_computed_at":"2026-05-18T01:59:34.465563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:34.465563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MN/nW5J2UfJhncV3pBK8t1RUI9LVVf2k6r0zSzuS19/q1ogunfMvtNCk8suYjtjxdGLi3hTnCWpiYkoO+QmlDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:34.466090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07725","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3925858e373e89612d6a51c908becd03dbd08596ad3d1d6e6c7a7a8744bc5641","sha256:f6c285e3ee7c3445b6a7e0efbaf793bc12cb02b04449882bef88066130d8fcb6"],"state_sha256":"e6bcb6986d4cb1f385bb9571d9e004bb650df05f57096cd714fe2dab8738bc87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J5S/meFnpEOxSvosvWwHGeHwrvFM1q/AYQq14wR91nX46vfsITnm++Ok6LEbtaAQcraml1o8Yqo47MKBgMyrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:40:35.254653Z","bundle_sha256":"a8c968be740d089e8bda8bc31a573ca524ca7aae6376397e264d2eb188cb9e44"}}