{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:J7MCSXRH2V3BWKL62HEGJJPM7K","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":"75fd8d8841a91e5e05f9013f479b32af7151137b170258a29788605b08da3dcf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-05-26T21:07:31Z","title_canon_sha256":"2feddc4457b4c90731d9285b476a53e003e02bec269a96a578baf2e9e53818ce"},"schema_version":"1.0","source":{"id":"2105.12840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12840","created_at":"2026-07-05T02:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12840v1","created_at":"2026-07-05T02:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12840","created_at":"2026-07-05T02:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"J7MCSXRH2V3B","created_at":"2026-07-05T02:43:44Z"},{"alias_kind":"pith_short_16","alias_value":"J7MCSXRH2V3BWKL6","created_at":"2026-07-05T02:43:44Z"},{"alias_kind":"pith_short_8","alias_value":"J7MCSXRH","created_at":"2026-07-05T02:43:44Z"}],"graph_snapshots":[{"event_id":"sha256:98aa55554d506a1d673ae3675c8d56646c01c15c750e1c9c8686c65c5248ead1","target":"graph","created_at":"2026-07-05T02:43:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.12840/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Asit Kumar Pradhan, Costas N. Georghiades, Jean-Francois Chamberland, Krishna Narayanan, Michail Gkagkos, Vamsi Amalladinne","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-05-26T21:07:31Z","title":"Approximate Support Recovery using Codes for Unsourced Multiple Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12840","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:fd2252f593ebbe698ff4951364e8e40cdb8b7e38cbac1c9d60b17400d8bdbd13","target":"record","created_at":"2026-07-05T02:43:44Z","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":"75fd8d8841a91e5e05f9013f479b32af7151137b170258a29788605b08da3dcf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-05-26T21:07:31Z","title_canon_sha256":"2feddc4457b4c90731d9285b476a53e003e02bec269a96a578baf2e9e53818ce"},"schema_version":"1.0","source":{"id":"2105.12840","kind":"arxiv","version":1}},"canonical_sha256":"4fd8295e27d5761b297ed1c864a5ecfaa509d07079abb23040ebd601033ca85d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fd8295e27d5761b297ed1c864a5ecfaa509d07079abb23040ebd601033ca85d","first_computed_at":"2026-07-05T02:43:44.821290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:43:44.821290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vUDaZsPnAQdkJuKaPJmJYWMToH5tocn2AXD9H/GC3NztzWayAFfC/DeUdEUPVkWV1+zGBtT0D9wGiR8CJ3P5Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:43:44.821696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.12840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd2252f593ebbe698ff4951364e8e40cdb8b7e38cbac1c9d60b17400d8bdbd13","sha256:98aa55554d506a1d673ae3675c8d56646c01c15c750e1c9c8686c65c5248ead1"],"state_sha256":"a4957f4cf6ed55d0d8c68c5b17f81b501bea80923c729f491f6f99753abcec94"}