{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:S6LSK5C5PBPETUJGOB2HIM25AI","short_pith_number":"pith:S6LSK5C5","schema_version":"1.0","canonical_sha256":"979725745d785e49d126707474335d02213a4f66124fe7a0c2bc831ce32383cb","source":{"kind":"arxiv","id":"1505.07725","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.07725","created_at":"2026-05-18T01:59:34.465643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07725v2","created_at":"2026-05-18T01:59:34.465643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07725","created_at":"2026-05-18T01:59:34.465643+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6LSK5C5PBPE","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6LSK5C5PBPETUJG","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6LSK5C5","created_at":"2026-05-18T12:29:39.896362+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/S6LSK5C5PBPETUJGOB2HIM25AI","json":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI.json","graph_json":"https://pith.science/api/pith-number/S6LSK5C5PBPETUJGOB2HIM25AI/graph.json","events_json":"https://pith.science/api/pith-number/S6LSK5C5PBPETUJGOB2HIM25AI/events.json","paper":"https://pith.science/paper/S6LSK5C5"},"agent_actions":{"view_html":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI","download_json":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI.json","view_paper":"https://pith.science/paper/S6LSK5C5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07725&json=true","fetch_graph":"https://pith.science/api/pith-number/S6LSK5C5PBPETUJGOB2HIM25AI/graph.json","fetch_events":"https://pith.science/api/pith-number/S6LSK5C5PBPETUJGOB2HIM25AI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI/action/storage_attestation","attest_author":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI/action/author_attestation","sign_citation":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI/action/citation_signature","submit_replication":"https://pith.science/pith/S6LSK5C5PBPETUJGOB2HIM25AI/action/replication_record"}},"created_at":"2026-05-18T01:59:34.465643+00:00","updated_at":"2026-05-18T01:59:34.465643+00:00"}