{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QIF37T7Y7AE25ODOYICD3YTQXO","short_pith_number":"pith:QIF37T7Y","schema_version":"1.0","canonical_sha256":"820bbfcff8f809aeb86ec2043de270bb92632f31fef169f011c1a428d2952218","source":{"kind":"arxiv","id":"2607.14448","version":1},"attestation_state":"computed","paper":{"title":"Group Testing with Selectable Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Daniel McMorrow, Jonathan Scarlett, Trung-Khang Tran","submitted_at":"2026-07-16T00:46:31Z","abstract_excerpt":"We consider the problem of group testing, in which one seeks to identify a subset of defective items of size $k$ from a larger set of $n$ items based on pooled tests. We introduce a selectable threshold model, in which each test has an associated threshold that can be chosen, such that the test outcome is 1 if and only if the number of defectives in the test is no smaller than that threshold. In settings with a large or unbounded maximum threshold, we establish conditions under which high-probability recovery can be attained with a rate (i.e., the asymptotic ratio of $\\log_2{n \\choose k}$ to t"},"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":"2607.14448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T00:46:31Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"3751b02dd9e70bccd559332bf87a0d467263aee6e9a90eb8e0da98a4267779d5","abstract_canon_sha256":"c1c9d223fc418c02279de6b22d9017e30cf88b9b954df4eb2ab12f1ae79ac818"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T00:21:12.925700Z","signature_b64":"CUT6yiFqaaIzhkO2SfDgz9Ep6EB5X9Hx1pn7JFH0LY1mxd1ZHj2e7UbFMVnYMs4uLJtIBsUIfC5UDZrqJpthCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"820bbfcff8f809aeb86ec2043de270bb92632f31fef169f011c1a428d2952218","last_reissued_at":"2026-07-17T00:21:12.924825Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T00:21:12.924825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Testing with Selectable Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Daniel McMorrow, Jonathan Scarlett, Trung-Khang Tran","submitted_at":"2026-07-16T00:46:31Z","abstract_excerpt":"We consider the problem of group testing, in which one seeks to identify a subset of defective items of size $k$ from a larger set of $n$ items based on pooled tests. We introduce a selectable threshold model, in which each test has an associated threshold that can be chosen, such that the test outcome is 1 if and only if the number of defectives in the test is no smaller than that threshold. In settings with a large or unbounded maximum threshold, we establish conditions under which high-probability recovery can be attained with a rate (i.e., the asymptotic ratio of $\\log_2{n \\choose k}$ to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14448","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.14448/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":"2607.14448","created_at":"2026-07-17T00:21:12.925272+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.14448v1","created_at":"2026-07-17T00:21:12.925272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14448","created_at":"2026-07-17T00:21:12.925272+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIF37T7Y7AE2","created_at":"2026-07-17T00:21:12.925272+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIF37T7Y7AE25ODO","created_at":"2026-07-17T00:21:12.925272+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIF37T7Y","created_at":"2026-07-17T00:21:12.925272+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/QIF37T7Y7AE25ODOYICD3YTQXO","json":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO.json","graph_json":"https://pith.science/api/pith-number/QIF37T7Y7AE25ODOYICD3YTQXO/graph.json","events_json":"https://pith.science/api/pith-number/QIF37T7Y7AE25ODOYICD3YTQXO/events.json","paper":"https://pith.science/paper/QIF37T7Y"},"agent_actions":{"view_html":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO","download_json":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO.json","view_paper":"https://pith.science/paper/QIF37T7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.14448&json=true","fetch_graph":"https://pith.science/api/pith-number/QIF37T7Y7AE25ODOYICD3YTQXO/graph.json","fetch_events":"https://pith.science/api/pith-number/QIF37T7Y7AE25ODOYICD3YTQXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO/action/storage_attestation","attest_author":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO/action/author_attestation","sign_citation":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO/action/citation_signature","submit_replication":"https://pith.science/pith/QIF37T7Y7AE25ODOYICD3YTQXO/action/replication_record"}},"created_at":"2026-07-17T00:21:12.925272+00:00","updated_at":"2026-07-17T00:21:12.925272+00:00"}