{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:K5OB6EP2MXQUCDWR4N2LADUZY2","short_pith_number":"pith:K5OB6EP2","schema_version":"1.0","canonical_sha256":"575c1f11fa65e1410ed1e374b00e99c680c8e681a3084794f1d7b24aa6cf8897","source":{"kind":"arxiv","id":"2001.01008","version":3},"attestation_state":"computed","paper":{"title":"Improved non-adaptive algorithms for threshold group testing with a gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Isao Echizen, Mahdi Cheraghchi, Thach V. Bui","submitted_at":"2020-01-03T23:28:57Z","abstract_excerpt":"The basic goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. The outcome of a test on a subset of items is positive if the subset has at least $u$ defective items, negative if it has up to $\\ell$ defective items, where $0\\leq\\ell<u$, and arbitrary otherwise. This is called threshold group testing. The parameter $g=u-\\ell-1$ is called \\textit{the gap}. In this paper, we focus on the case $g>0$, i.e., threshold group testing with a gap. Note that the results presented here are also applicable to th"},"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":"2001.01008","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-03T23:28:57Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"9f547e65af08c4520ae35ef7f90352ccf278cf47c0c3c96c017ebf23f0ee7ec2","abstract_canon_sha256":"fefea2cbac7307afe6cb1375f900b413e8bcb9a757b910e047a339da1a1bad29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:07:42.445012Z","signature_b64":"ObXAliSje1O29CnLnC9oSUGLcsmVbOr05lp6x35KPDj3oSpnCp3lofkBXXD1/qU/Y23IgQKZihmz+WL6xHhQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"575c1f11fa65e1410ed1e374b00e99c680c8e681a3084794f1d7b24aa6cf8897","last_reissued_at":"2026-07-05T03:07:42.444677Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:07:42.444677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved non-adaptive algorithms for threshold group testing with a gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Isao Echizen, Mahdi Cheraghchi, Thach V. Bui","submitted_at":"2020-01-03T23:28:57Z","abstract_excerpt":"The basic goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. The outcome of a test on a subset of items is positive if the subset has at least $u$ defective items, negative if it has up to $\\ell$ defective items, where $0\\leq\\ell<u$, and arbitrary otherwise. This is called threshold group testing. The parameter $g=u-\\ell-1$ is called \\textit{the gap}. In this paper, we focus on the case $g>0$, i.e., threshold group testing with a gap. Note that the results presented here are also applicable to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.01008","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.01008/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2001.01008","created_at":"2026-07-05T03:07:42.444728+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.01008v3","created_at":"2026-07-05T03:07:42.444728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.01008","created_at":"2026-07-05T03:07:42.444728+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5OB6EP2MXQU","created_at":"2026-07-05T03:07:42.444728+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5OB6EP2MXQUCDWR","created_at":"2026-07-05T03:07:42.444728+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5OB6EP2","created_at":"2026-07-05T03:07:42.444728+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/K5OB6EP2MXQUCDWR4N2LADUZY2","json":"https://pith.science/pith/K5OB6EP2MXQUCDWR4N2LADUZY2.json","graph_json":"https://pith.science/api/pith-number/K5OB6EP2MXQUCDWR4N2LADUZY2/graph.json","events_json":"https://pith.science/api/pith-number/K5OB6EP2MXQUCDWR4N2LADUZY2/events.json","paper":"https://pith.science/paper/K5OB6EP2"},"agent_actions":{"view_html":"https://pith.science/pith/K5OB6EP2MXQUCDWR4N2LADUZY2","download_json":"https://pith.science/pith/K5OB6EP2MXQUCDWR4N2LADUZY2.json","view_paper":"https://pith.science/paper/K5OB6EP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.01008&json=true","fetch_graph":"https://pith.science/api/pith-number/K5OB6EP2MXQUCDWR4N2LADUZY2/graph.json","fetch_events":"https://pith.science/api/pith-number/K5OB6EP2MXQUCDWR4N2LADUZY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5OB6EP2MXQUCDWR4N2LADUZY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5OB6EP2MXQUCDWR4N2LADUZY2/action/storage_attestation","attest_author":"https://pith.science/pith/K5OB6EP2MXQUCDWR4N2LADUZY2/action/author_attestation","sign_citation":"https://pith.science/pith/K5OB6EP2MXQUCDWR4N2LADUZY2/action/citation_signature","submit_replication":"https://pith.science/pith/K5OB6EP2MXQUCDWR4N2LADUZY2/action/replication_record"}},"created_at":"2026-07-05T03:07:42.444728+00:00","updated_at":"2026-07-05T03:07:42.444728+00:00"}