{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZPAU6YL46SZRCEHNYCIAEYXCJK","short_pith_number":"pith:ZPAU6YL4","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"},"canonical_sha256":"cbc14f617cf4b31110edc0900262e24a85d4d3f15cfd3ee522e9f84e2b6688bb","source":{"kind":"arxiv","id":"1707.06664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06664","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06664v1","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06664","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZPAU6YL46SZR","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZPAU6YL46SZRCEHN","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZPAU6YL4","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZPAU6YL46SZRCEHNYCIAEYXCJK","target":"record","payload":{"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"},"canonical_sha256":"cbc14f617cf4b31110edc0900262e24a85d4d3f15cfd3ee522e9f84e2b6688bb","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"},"source_kind":"arxiv","source_id":"1707.06664","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKCxS12C6KyPNRzqqZsgEo2bTiIwZGXpP42GZFi9yJyt5IPsbX+YvBFG22UheDm7LT0y0tSbZZJApvMnAtEkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:41:23.754087Z"},"content_sha256":"1b1820a47f7c363fd8924869d55cd2089aa97bf106a391dc16bb78bf80cd65c0","schema_version":"1.0","event_id":"sha256:1b1820a47f7c363fd8924869d55cd2089aa97bf106a391dc16bb78bf80cd65c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZPAU6YL46SZRCEHNYCIAEYXCJK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+tftEKeveuqvwllM4O9XlzTyq242P62KmTVCHY+QgnbiL7xMoUUh+qRuv3O6yOHMDcSR2y9qnXsLlmBRv8hBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:41:23.754480Z"},"content_sha256":"3512c4f125f3b77b674dbd49debcffceb3afc71afdbff4592b056ffa7ca22828","schema_version":"1.0","event_id":"sha256:3512c4f125f3b77b674dbd49debcffceb3afc71afdbff4592b056ffa7ca22828"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/bundle.json","state_url":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T17:41:23Z","links":{"resolver":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK","bundle":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/bundle.json","state":"https://pith.science/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZPAU6YL46SZRCEHNYCIAEYXCJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZPAU6YL46SZRCEHNYCIAEYXCJK","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":"a98d3a8e4559043bd92a6e87f23576dcb3e2fd8b24c625cbdd84082dfdf5dabe","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T18:15:23Z","title_canon_sha256":"10db289a8756849e6830392e77921d2f96f2afb1cb4a550707431365668a5150"},"schema_version":"1.0","source":{"id":"1707.06664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06664","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06664v1","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06664","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZPAU6YL46SZR","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZPAU6YL46SZRCEHN","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZPAU6YL4","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:3512c4f125f3b77b674dbd49debcffceb3afc71afdbff4592b056ffa7ca22828","target":"graph","created_at":"2026-05-18T00:39:52Z","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"},"paper":{"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","authors_text":"Abhishek Agarwal, Arya Mazumdar, Larkin Flodin","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T18:15:23Z","title":"Estimation of Sparsity via Simple Measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06664","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:1b1820a47f7c363fd8924869d55cd2089aa97bf106a391dc16bb78bf80cd65c0","target":"record","created_at":"2026-05-18T00:39:52Z","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":"a98d3a8e4559043bd92a6e87f23576dcb3e2fd8b24c625cbdd84082dfdf5dabe","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-20T18:15:23Z","title_canon_sha256":"10db289a8756849e6830392e77921d2f96f2afb1cb4a550707431365668a5150"},"schema_version":"1.0","source":{"id":"1707.06664","kind":"arxiv","version":1}},"canonical_sha256":"cbc14f617cf4b31110edc0900262e24a85d4d3f15cfd3ee522e9f84e2b6688bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbc14f617cf4b31110edc0900262e24a85d4d3f15cfd3ee522e9f84e2b6688bb","first_computed_at":"2026-05-18T00:39:52.046451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:52.046451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FKzi0n6dqks1ot1Z8AdGg2PdkN/KCVEVsFjfaQMh4ROUiq6b5or650rvyWn89XMIfqOYFCHbyIO+qEwZV9s8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:52.047180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b1820a47f7c363fd8924869d55cd2089aa97bf106a391dc16bb78bf80cd65c0","sha256:3512c4f125f3b77b674dbd49debcffceb3afc71afdbff4592b056ffa7ca22828"],"state_sha256":"7348d28561378993ea9f15629bbecfa3e63f9b0320e4363ee6d4b8e5fea0c499"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0ajcVWlEGqlSQuaVIlhodpSTIXgwtc7X6OM3juh2ngPF5EZc+PiCqb/UKb9nuLHZJXGdn2w0HpEefw5SrwcBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:41:23.757742Z","bundle_sha256":"cc621f134f297960e9a846e5fff787c6e5d5e8d7b4c0a66e2f7a96980ff2ae63"}}