{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GUD6CYRXFR6XFNTM76LC2XCCXH","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":"a8b2db32fd6409473b916708562c25df3a2caa4dea272da346eb6c2740575fee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-16T11:08:22Z","title_canon_sha256":"abc63669b29635c78aa4cb3dee962acf68a283ecfb41823456c6ae6f684a00a8"},"schema_version":"1.0","source":{"id":"2006.09074","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.09074","created_at":"2026-07-05T01:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"2006.09074v1","created_at":"2026-07-05T01:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09074","created_at":"2026-07-05T01:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"GUD6CYRXFR6X","created_at":"2026-07-05T01:10:46Z"},{"alias_kind":"pith_short_16","alias_value":"GUD6CYRXFR6XFNTM","created_at":"2026-07-05T01:10:46Z"},{"alias_kind":"pith_short_8","alias_value":"GUD6CYRX","created_at":"2026-07-05T01:10:46Z"}],"graph_snapshots":[{"event_id":"sha256:da886c68e217c685de2fece90ea048023be51f6bfd1c2cb98e7a414652fd7981","target":"graph","created_at":"2026-07-05T01:10:46Z","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/2006.09074/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a random Bernoulli matrix $ A\\in \\{0,1\\}^{m\\times n} $, an integer $ 0< k < n $ and the vector $ y:=Ax $, where $ x \\in \\{0,1\\}^n $ is of Hamming weight $ k $, the objective in the {\\em Quantitative Group Testing} (QGT) problem is to recover $ x $. This problem is more difficult the smaller $m$ is. For parameter ranges of interest to us, known polynomial time algorithms require values of $m$ that are much larger than $k$.\n  In this work, we define a seemingly easier problem that we refer to as {\\em Subset Select}. Given the same input as in QGT, the objective in Subset Select is to retur","authors_text":"Amir Lellouche, Uriel Feige","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-16T11:08:22Z","title":"Quantitative Group Testing and the rank of random matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.09074","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:203db5526e8bd0768ebc86326bf2d049ae1f9664780b193b2023de1184fc3450","target":"record","created_at":"2026-07-05T01:10:46Z","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":"a8b2db32fd6409473b916708562c25df3a2caa4dea272da346eb6c2740575fee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-16T11:08:22Z","title_canon_sha256":"abc63669b29635c78aa4cb3dee962acf68a283ecfb41823456c6ae6f684a00a8"},"schema_version":"1.0","source":{"id":"2006.09074","kind":"arxiv","version":1}},"canonical_sha256":"3507e162372c7d72b66cff962d5c42b9fdfadfa2bef120846109109f227eabe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3507e162372c7d72b66cff962d5c42b9fdfadfa2bef120846109109f227eabe2","first_computed_at":"2026-07-05T01:10:46.115393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:10:46.115393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vOiO/2W3GvZiOZPwsq7Vs2I3TdH5xsnN6dRq6ihZbrZlJUKnnt0o2ge4tQTWL6w1wNxKJHkY6kZcaToVcKhhBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:10:46.115741Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.09074","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:203db5526e8bd0768ebc86326bf2d049ae1f9664780b193b2023de1184fc3450","sha256:da886c68e217c685de2fece90ea048023be51f6bfd1c2cb98e7a414652fd7981"],"state_sha256":"e153bf188b5d8366c1420442159cbbc0149190831c644692acaa83856a7ee4d6"}