{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZPAU6YL46SZRCEHNYCIAEYXCJK","short_pith_number":"pith:ZPAU6YL4","schema_version":"1.0","canonical_sha256":"cbc14f617cf4b31110edc0900262e24a85d4d3f15cfd3ee522e9f84e2b6688bb","source":{"kind":"arxiv","id":"1707.06664","version":1},"attestation_state":"computed","paper":{"title":"Estimation of Sparsity via Simple Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Agarwal, Arya Mazumdar, Larkin Flodin","submitted_at":"2017-07-20T18:15:23Z","abstract_excerpt":"We consider several related problems of estimating the 'sparsity' or number of nonzero elements $d$ in a length $n$ vector $\\mathbf{x}$ by observing only $\\mathbf{b} = M \\odot \\mathbf{x}$, where $M$ is a predesigned test matrix independent of $\\mathbf{x}$, and the operation $\\odot$ varies between problems. We aim to provide a $\\Delta$-approximation of sparsity for some constant $\\Delta$ with a minimal number of measurements (rows of $M$). This framework generalizes multiple problems, such as estimation of sparsity in group testing and compressed sensing. We use techniques from coding theory as"},"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":"1707.06664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T18:15:23Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"10db289a8756849e6830392e77921d2f96f2afb1cb4a550707431365668a5150","abstract_canon_sha256":"a98d3a8e4559043bd92a6e87f23576dcb3e2fd8b24c625cbdd84082dfdf5dabe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:52.047180Z","signature_b64":"FKzi0n6dqks1ot1Z8AdGg2PdkN/KCVEVsFjfaQMh4ROUiq6b5or650rvyWn89XMIfqOYFCHbyIO+qEwZV9s8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbc14f617cf4b31110edc0900262e24a85d4d3f15cfd3ee522e9f84e2b6688bb","last_reissued_at":"2026-05-18T00:39:52.046451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:52.046451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimation of Sparsity via Simple Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Agarwal, Arya Mazumdar, Larkin Flodin","submitted_at":"2017-07-20T18:15:23Z","abstract_excerpt":"We consider several related problems of estimating the 'sparsity' or number of nonzero elements $d$ in a length $n$ vector $\\mathbf{x}$ by observing only $\\mathbf{b} = M \\odot \\mathbf{x}$, where $M$ is a predesigned test matrix independent of $\\mathbf{x}$, and the operation $\\odot$ varies between problems. We aim to provide a $\\Delta$-approximation of sparsity for some constant $\\Delta$ with a minimal number of measurements (rows of $M$). This framework generalizes multiple problems, such as estimation of sparsity in group testing and compressed sensing. We use techniques from coding theory as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06664","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":"1707.06664","created_at":"2026-05-18T00:39:52.046554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06664v1","created_at":"2026-05-18T00:39:52.046554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06664","created_at":"2026-05-18T00:39:52.046554+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPAU6YL46SZR","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPAU6YL46SZRCEHN","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPAU6YL4","created_at":"2026-05-18T12:31:59.375834+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/ZPAU6YL46SZRCEHNYCIAEYXCJK","json":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK.json","graph_json":"https://pith.science/api/pith-number/ZPAU6YL46SZRCEHNYCIAEYXCJK/graph.json","events_json":"https://pith.science/api/pith-number/ZPAU6YL46SZRCEHNYCIAEYXCJK/events.json","paper":"https://pith.science/paper/ZPAU6YL4"},"agent_actions":{"view_html":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK","download_json":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK.json","view_paper":"https://pith.science/paper/ZPAU6YL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06664&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPAU6YL46SZRCEHNYCIAEYXCJK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPAU6YL46SZRCEHNYCIAEYXCJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/action/storage_attestation","attest_author":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/action/author_attestation","sign_citation":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/action/citation_signature","submit_replication":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/action/replication_record"}},"created_at":"2026-05-18T00:39:52.046554+00:00","updated_at":"2026-05-18T00:39:52.046554+00:00"}