{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KW5YQ4PJAYWYYK3HMN4GQB2C4Y","short_pith_number":"pith:KW5YQ4PJ","schema_version":"1.0","canonical_sha256":"55bb8871e9062d8c2b676378680742e61bb7cb216329dffedd81c51a5e2a8cca","source":{"kind":"arxiv","id":"1705.02708","version":1},"attestation_state":"computed","paper":{"title":"On the optimality of some group testing algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Matthew Aldridge","submitted_at":"2017-05-07T22:08:28Z","abstract_excerpt":"We consider Bernoulli nonadaptive group testing with $k = \\Theta(n^\\theta)$ defectives, for $\\theta \\in (0,1)$. The practical definite defectives (DD) detection algorithm is known to be optimal for $\\theta \\geq 1/2$. We give a new upper bound on the rate of DD, showing that DD is strictly suboptimal for $\\theta < 0.41$. We also show that the SCOMP algorithm and algorithms based on linear programming achieve a rate at least as high as DD, so in particular are also optimal for $\\theta \\geq 1/2$."},"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":"1705.02708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T22:08:28Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"6560fb1d26e5603a9a60c9eb9337244fc70c5f9567b21f57a7e82181d8da11e3","abstract_canon_sha256":"af3420509dcc0f10d970cac7d875aadaeb32fb64e3274b7866553de4ada12125"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:46.104526Z","signature_b64":"aRVSkb6yhxsqAi09N3CN1q+J/EGMoRpYqxa0pxR/9hRRA0DRB1IiUDPxBjU23kXBXTNUSsjrlaIQdaqgsbr5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55bb8871e9062d8c2b676378680742e61bb7cb216329dffedd81c51a5e2a8cca","last_reissued_at":"2026-05-18T00:29:46.103874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:46.103874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the optimality of some group testing algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Matthew Aldridge","submitted_at":"2017-05-07T22:08:28Z","abstract_excerpt":"We consider Bernoulli nonadaptive group testing with $k = \\Theta(n^\\theta)$ defectives, for $\\theta \\in (0,1)$. The practical definite defectives (DD) detection algorithm is known to be optimal for $\\theta \\geq 1/2$. We give a new upper bound on the rate of DD, showing that DD is strictly suboptimal for $\\theta < 0.41$. We also show that the SCOMP algorithm and algorithms based on linear programming achieve a rate at least as high as DD, so in particular are also optimal for $\\theta \\geq 1/2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02708","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.02708","created_at":"2026-05-18T00:29:46.104003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02708v1","created_at":"2026-05-18T00:29:46.104003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02708","created_at":"2026-05-18T00:29:46.104003+00:00"},{"alias_kind":"pith_short_12","alias_value":"KW5YQ4PJAYWY","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KW5YQ4PJAYWYYK3H","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KW5YQ4PJ","created_at":"2026-05-18T12:31:28.150371+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/KW5YQ4PJAYWYYK3HMN4GQB2C4Y","json":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y.json","graph_json":"https://pith.science/api/pith-number/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/graph.json","events_json":"https://pith.science/api/pith-number/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/events.json","paper":"https://pith.science/paper/KW5YQ4PJ"},"agent_actions":{"view_html":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y","download_json":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y.json","view_paper":"https://pith.science/paper/KW5YQ4PJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02708&json=true","fetch_graph":"https://pith.science/api/pith-number/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/action/storage_attestation","attest_author":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/action/author_attestation","sign_citation":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/action/citation_signature","submit_replication":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/action/replication_record"}},"created_at":"2026-05-18T00:29:46.104003+00:00","updated_at":"2026-05-18T00:29:46.104003+00:00"}