{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KW5YQ4PJAYWYYK3HMN4GQB2C4Y","short_pith_number":"pith:KW5YQ4PJ","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"},"canonical_sha256":"55bb8871e9062d8c2b676378680742e61bb7cb216329dffedd81c51a5e2a8cca","source":{"kind":"arxiv","id":"1705.02708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02708","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02708v1","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02708","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"pith_short_12","alias_value":"KW5YQ4PJAYWY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KW5YQ4PJAYWYYK3H","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KW5YQ4PJ","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KW5YQ4PJAYWYYK3HMN4GQB2C4Y","target":"record","payload":{"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"},"canonical_sha256":"55bb8871e9062d8c2b676378680742e61bb7cb216329dffedd81c51a5e2a8cca","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"},"source_kind":"arxiv","source_id":"1705.02708","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TOLYw8wDbqPxs2GgOc/ri9ljBQxktSM2jOBW5hxVPEO2BfIf2WdbDtacVQ7CEKEAWNIlrbQp5ih7N77iWQy4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:17:57.683632Z"},"content_sha256":"f36b5b4042e363e41b6e06a72f178fc60f221cb96509da6cd22d8a7109eefc98","schema_version":"1.0","event_id":"sha256:f36b5b4042e363e41b6e06a72f178fc60f221cb96509da6cd22d8a7109eefc98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KW5YQ4PJAYWYYK3HMN4GQB2C4Y","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zhmuEMDDVs4o8VWNvODpjcOdEI9iRZ2Ris8+PoGTTPCfvVbx+iJkVtN/QNQQ+xn8SNmKqg9oo1quNP/0BfAkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:17:57.683985Z"},"content_sha256":"c2168a77ea8a208a2a5b7249b5b613ce7ceec016861b96e4f7ec07b3edba28ad","schema_version":"1.0","event_id":"sha256:c2168a77ea8a208a2a5b7249b5b613ce7ceec016861b96e4f7ec07b3edba28ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/bundle.json","state_url":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T16:17:57Z","links":{"resolver":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y","bundle":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/bundle.json","state":"https://pith.science/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KW5YQ4PJAYWYYK3HMN4GQB2C4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KW5YQ4PJAYWYYK3HMN4GQB2C4Y","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":"af3420509dcc0f10d970cac7d875aadaeb32fb64e3274b7866553de4ada12125","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T22:08:28Z","title_canon_sha256":"6560fb1d26e5603a9a60c9eb9337244fc70c5f9567b21f57a7e82181d8da11e3"},"schema_version":"1.0","source":{"id":"1705.02708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02708","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02708v1","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02708","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"pith_short_12","alias_value":"KW5YQ4PJAYWY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KW5YQ4PJAYWYYK3H","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KW5YQ4PJ","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:c2168a77ea8a208a2a5b7249b5b613ce7ceec016861b96e4f7ec07b3edba28ad","target":"graph","created_at":"2026-05-18T00:29: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"},"paper":{"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$.","authors_text":"Matthew Aldridge","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T22:08:28Z","title":"On the optimality of some group testing algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02708","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:f36b5b4042e363e41b6e06a72f178fc60f221cb96509da6cd22d8a7109eefc98","target":"record","created_at":"2026-05-18T00:29: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":"af3420509dcc0f10d970cac7d875aadaeb32fb64e3274b7866553de4ada12125","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T22:08:28Z","title_canon_sha256":"6560fb1d26e5603a9a60c9eb9337244fc70c5f9567b21f57a7e82181d8da11e3"},"schema_version":"1.0","source":{"id":"1705.02708","kind":"arxiv","version":1}},"canonical_sha256":"55bb8871e9062d8c2b676378680742e61bb7cb216329dffedd81c51a5e2a8cca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55bb8871e9062d8c2b676378680742e61bb7cb216329dffedd81c51a5e2a8cca","first_computed_at":"2026-05-18T00:29:46.103874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:46.103874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aRVSkb6yhxsqAi09N3CN1q+J/EGMoRpYqxa0pxR/9hRRA0DRB1IiUDPxBjU23kXBXTNUSsjrlaIQdaqgsbr5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:46.104526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f36b5b4042e363e41b6e06a72f178fc60f221cb96509da6cd22d8a7109eefc98","sha256:c2168a77ea8a208a2a5b7249b5b613ce7ceec016861b96e4f7ec07b3edba28ad"],"state_sha256":"29171f632b3ca457cbf83ece86717efe082b390f2b72774905190646657ad677"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M16c+b02PWvYUDuQPue/ZJP5pEJPmz8M3BCbIZgbEjGrnPZWF/ASBTPFT8ANpZW11X0HLfq3YSZO+M41bEpxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:17:57.685976Z","bundle_sha256":"907f83fd0239cf1629c2d1583d1715a65911a48c39c44995a67440d3b5012b88"}}