{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:J7MCSXRH2V3BWKL62HEGJJPM7K","short_pith_number":"pith:J7MCSXRH","schema_version":"1.0","canonical_sha256":"4fd8295e27d5761b297ed1c864a5ecfaa509d07079abb23040ebd601033ca85d","source":{"kind":"arxiv","id":"2105.12840","version":1},"attestation_state":"computed","paper":{"title":"Approximate Support Recovery using Codes for Unsourced Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asit Kumar Pradhan, Costas N. Georghiades, Jean-Francois Chamberland, Krishna Narayanan, Michail Gkagkos, Vamsi Amalladinne","submitted_at":"2021-05-26T21:07:31Z","abstract_excerpt":"We consider the approximate support recovery (ASR) task of inferring the support of a $K$-sparse vector ${\\bf x} \\in \\mathbb{R}^n$ from $m$ noisy measurements. We examine the case where $n$ is large, which precludes the application of standard compressed sensing solvers, thereby necessitating solutions with lower complexity. We design a scheme for ASR by leveraging techniques developed for unsourced multiple access. We present two decoding algorithms with computational complexities $\\mathcal{O}(K^2 \\log n+K \\log n \\log \\log n)$ and $\\mathcal{O}(K^3 +K^2 \\log n+ K \\log n \\log \\log n)$ per itera"},"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":"2105.12840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-05-26T21:07:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2feddc4457b4c90731d9285b476a53e003e02bec269a96a578baf2e9e53818ce","abstract_canon_sha256":"75fd8d8841a91e5e05f9013f479b32af7151137b170258a29788605b08da3dcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:44.821696Z","signature_b64":"vUDaZsPnAQdkJuKaPJmJYWMToH5tocn2AXD9H/GC3NztzWayAFfC/DeUdEUPVkWV1+zGBtT0D9wGiR8CJ3P5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fd8295e27d5761b297ed1c864a5ecfaa509d07079abb23040ebd601033ca85d","last_reissued_at":"2026-07-05T02:43:44.821290Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:44.821290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Support Recovery using Codes for Unsourced Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asit Kumar Pradhan, Costas N. Georghiades, Jean-Francois Chamberland, Krishna Narayanan, Michail Gkagkos, Vamsi Amalladinne","submitted_at":"2021-05-26T21:07:31Z","abstract_excerpt":"We consider the approximate support recovery (ASR) task of inferring the support of a $K$-sparse vector ${\\bf x} \\in \\mathbb{R}^n$ from $m$ noisy measurements. We examine the case where $n$ is large, which precludes the application of standard compressed sensing solvers, thereby necessitating solutions with lower complexity. We design a scheme for ASR by leveraging techniques developed for unsourced multiple access. We present two decoding algorithms with computational complexities $\\mathcal{O}(K^2 \\log n+K \\log n \\log \\log n)$ and $\\mathcal{O}(K^3 +K^2 \\log n+ K \\log n \\log \\log n)$ per itera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12840","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.12840/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.12840","created_at":"2026-07-05T02:43:44.821371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.12840v1","created_at":"2026-07-05T02:43:44.821371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12840","created_at":"2026-07-05T02:43:44.821371+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7MCSXRH2V3B","created_at":"2026-07-05T02:43:44.821371+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7MCSXRH2V3BWKL6","created_at":"2026-07-05T02:43:44.821371+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7MCSXRH","created_at":"2026-07-05T02:43:44.821371+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/J7MCSXRH2V3BWKL62HEGJJPM7K","json":"https://pith.science/pith/J7MCSXRH2V3BWKL62HEGJJPM7K.json","graph_json":"https://pith.science/api/pith-number/J7MCSXRH2V3BWKL62HEGJJPM7K/graph.json","events_json":"https://pith.science/api/pith-number/J7MCSXRH2V3BWKL62HEGJJPM7K/events.json","paper":"https://pith.science/paper/J7MCSXRH"},"agent_actions":{"view_html":"https://pith.science/pith/J7MCSXRH2V3BWKL62HEGJJPM7K","download_json":"https://pith.science/pith/J7MCSXRH2V3BWKL62HEGJJPM7K.json","view_paper":"https://pith.science/paper/J7MCSXRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.12840&json=true","fetch_graph":"https://pith.science/api/pith-number/J7MCSXRH2V3BWKL62HEGJJPM7K/graph.json","fetch_events":"https://pith.science/api/pith-number/J7MCSXRH2V3BWKL62HEGJJPM7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7MCSXRH2V3BWKL62HEGJJPM7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7MCSXRH2V3BWKL62HEGJJPM7K/action/storage_attestation","attest_author":"https://pith.science/pith/J7MCSXRH2V3BWKL62HEGJJPM7K/action/author_attestation","sign_citation":"https://pith.science/pith/J7MCSXRH2V3BWKL62HEGJJPM7K/action/citation_signature","submit_replication":"https://pith.science/pith/J7MCSXRH2V3BWKL62HEGJJPM7K/action/replication_record"}},"created_at":"2026-07-05T02:43:44.821371+00:00","updated_at":"2026-07-05T02:43:44.821371+00:00"}