{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WWI5IARQSDCZIWUQ43KXCHPPSV","short_pith_number":"pith:WWI5IARQ","schema_version":"1.0","canonical_sha256":"b591d4023090c5945a90e6d5711def9542b1aacf008ec7d1d1c971aef6d128c6","source":{"kind":"arxiv","id":"1708.03429","version":2},"attestation_state":"computed","paper":{"title":"Nearly Optimal Sparse Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Elena Grigorescu, Samson Zhou, Sidharth Jaggi, Venkata Gandikota","submitted_at":"2017-08-11T04:47:09Z","abstract_excerpt":"Group testing is the process of pooling arbitrary subsets from a set of $n$ items so as to identify, with a minimal number of tests, a \"small\" subset of $d$ defective items. In \"classical\" non-adaptive group testing, it is known that when $d$ is substantially smaller than $n$, $\\Theta(d\\log(n))$ tests are both information-theoretically necessary and sufficient to guarantee recovery with high probability. Group testing schemes in the literature meeting this bound require most items to be tested $\\Omega(\\log(n))$ times, and most tests to incorporate $\\Omega(n/d)$ items.\n  Motivated by physical c"},"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":"1708.03429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-11T04:47:09Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"b18c8451051e5f66546baf590ce2e311744056ec5919ec02c5dae4966590836b","abstract_canon_sha256":"c42e09eff495dd8af1ecd17f32c48c929e5e982b2deb7a46f9e6c90f022cccb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:19.711802Z","signature_b64":"LyOl3r8b3xV/lWQTQMf3+sfY3+dDgvvNaM9QQsX4yqOYOEc3rGNDvJGk10f8dodp4QOkWJ3sibH70ZLMFVKxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b591d4023090c5945a90e6d5711def9542b1aacf008ec7d1d1c971aef6d128c6","last_reissued_at":"2026-05-18T00:05:19.711271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:19.711271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Optimal Sparse Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Elena Grigorescu, Samson Zhou, Sidharth Jaggi, Venkata Gandikota","submitted_at":"2017-08-11T04:47:09Z","abstract_excerpt":"Group testing is the process of pooling arbitrary subsets from a set of $n$ items so as to identify, with a minimal number of tests, a \"small\" subset of $d$ defective items. In \"classical\" non-adaptive group testing, it is known that when $d$ is substantially smaller than $n$, $\\Theta(d\\log(n))$ tests are both information-theoretically necessary and sufficient to guarantee recovery with high probability. Group testing schemes in the literature meeting this bound require most items to be tested $\\Omega(\\log(n))$ times, and most tests to incorporate $\\Omega(n/d)$ items.\n  Motivated by physical c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03429","kind":"arxiv","version":2},"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":"1708.03429","created_at":"2026-05-18T00:05:19.711359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03429v2","created_at":"2026-05-18T00:05:19.711359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03429","created_at":"2026-05-18T00:05:19.711359+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWI5IARQSDCZ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWI5IARQSDCZIWUQ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWI5IARQ","created_at":"2026-05-18T12:31:53.515858+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/WWI5IARQSDCZIWUQ43KXCHPPSV","json":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV.json","graph_json":"https://pith.science/api/pith-number/WWI5IARQSDCZIWUQ43KXCHPPSV/graph.json","events_json":"https://pith.science/api/pith-number/WWI5IARQSDCZIWUQ43KXCHPPSV/events.json","paper":"https://pith.science/paper/WWI5IARQ"},"agent_actions":{"view_html":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV","download_json":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV.json","view_paper":"https://pith.science/paper/WWI5IARQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03429&json=true","fetch_graph":"https://pith.science/api/pith-number/WWI5IARQSDCZIWUQ43KXCHPPSV/graph.json","fetch_events":"https://pith.science/api/pith-number/WWI5IARQSDCZIWUQ43KXCHPPSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/action/storage_attestation","attest_author":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/action/author_attestation","sign_citation":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/action/citation_signature","submit_replication":"https://pith.science/pith/WWI5IARQSDCZIWUQ43KXCHPPSV/action/replication_record"}},"created_at":"2026-05-18T00:05:19.711359+00:00","updated_at":"2026-05-18T00:05:19.711359+00:00"}