{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y3PKM6QOFH34D4Q2HNHSLYCYYV","short_pith_number":"pith:Y3PKM6QO","schema_version":"1.0","canonical_sha256":"c6dea67a0e29f7c1f21a3b4f25e058c57e4dae135547b13d905627114b2afd20","source":{"kind":"arxiv","id":"1701.06354","version":1},"attestation_state":"computed","paper":{"title":"User Activity Detection via Group Testing and Coded Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Igor Bjelakovi\\'c, Matthias Frey, S{\\l}awomir Sta\\'nczak","submitted_at":"2017-01-23T12:14:52Z","abstract_excerpt":"Inspired by group testing algorithms and the coded computation paradigm, we propose and analyze a novel multiple access scheme for detecting active users in large-scale networks. The scheme consists of a simple randomized detection algorithm that uses computation coding as intermediate steps for computing logical disjunction functions over the multiple access channel (MAC). First we show that given an efficient MAC code for disjunction computation the algorithm requires $O(k \\log (\\frac{N}{k }))$ decision steps for detecting $k$ active users out of $N+k$ users. Subsequently we present a simple"},"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":"1701.06354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T12:14:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c3531f05d1f72761a1366f9e4e64b14867287f9e92b5101d09c7689237751605","abstract_canon_sha256":"b7d32caefe5e86929ed125b551021426df398d73e5f49f60d8eaabe3dc370878"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:18.644653Z","signature_b64":"KNySWNjqqB/ymRDDhd7Qbc8FPLMD5SJO2WUQwXa5H84hKE2ShQymnZShrS/NlqjHM7aE+QwcDCWDC3hsPV1FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6dea67a0e29f7c1f21a3b4f25e058c57e4dae135547b13d905627114b2afd20","last_reissued_at":"2026-05-18T00:52:18.643983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:18.643983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"User Activity Detection via Group Testing and Coded Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Igor Bjelakovi\\'c, Matthias Frey, S{\\l}awomir Sta\\'nczak","submitted_at":"2017-01-23T12:14:52Z","abstract_excerpt":"Inspired by group testing algorithms and the coded computation paradigm, we propose and analyze a novel multiple access scheme for detecting active users in large-scale networks. The scheme consists of a simple randomized detection algorithm that uses computation coding as intermediate steps for computing logical disjunction functions over the multiple access channel (MAC). First we show that given an efficient MAC code for disjunction computation the algorithm requires $O(k \\log (\\frac{N}{k }))$ decision steps for detecting $k$ active users out of $N+k$ users. Subsequently we present a simple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06354","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.06354","created_at":"2026-05-18T00:52:18.644073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06354v1","created_at":"2026-05-18T00:52:18.644073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06354","created_at":"2026-05-18T00:52:18.644073+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3PKM6QOFH34","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3PKM6QOFH34D4Q2","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3PKM6QO","created_at":"2026-05-18T12:31:56.362134+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/Y3PKM6QOFH34D4Q2HNHSLYCYYV","json":"https://pith.science/pith/Y3PKM6QOFH34D4Q2HNHSLYCYYV.json","graph_json":"https://pith.science/api/pith-number/Y3PKM6QOFH34D4Q2HNHSLYCYYV/graph.json","events_json":"https://pith.science/api/pith-number/Y3PKM6QOFH34D4Q2HNHSLYCYYV/events.json","paper":"https://pith.science/paper/Y3PKM6QO"},"agent_actions":{"view_html":"https://pith.science/pith/Y3PKM6QOFH34D4Q2HNHSLYCYYV","download_json":"https://pith.science/pith/Y3PKM6QOFH34D4Q2HNHSLYCYYV.json","view_paper":"https://pith.science/paper/Y3PKM6QO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06354&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3PKM6QOFH34D4Q2HNHSLYCYYV/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3PKM6QOFH34D4Q2HNHSLYCYYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3PKM6QOFH34D4Q2HNHSLYCYYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3PKM6QOFH34D4Q2HNHSLYCYYV/action/storage_attestation","attest_author":"https://pith.science/pith/Y3PKM6QOFH34D4Q2HNHSLYCYYV/action/author_attestation","sign_citation":"https://pith.science/pith/Y3PKM6QOFH34D4Q2HNHSLYCYYV/action/citation_signature","submit_replication":"https://pith.science/pith/Y3PKM6QOFH34D4Q2HNHSLYCYYV/action/replication_record"}},"created_at":"2026-05-18T00:52:18.644073+00:00","updated_at":"2026-05-18T00:52:18.644073+00:00"}