{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YLELTECL3GNDAW7TMLP2NOOWB2","short_pith_number":"pith:YLELTECL","schema_version":"1.0","canonical_sha256":"c2c8b9904bd99a305bf362dfa6b9d60eab0ef10d3a739e5aae254c49863e0a28","source":{"kind":"arxiv","id":"1612.07122","version":3},"attestation_state":"computed","paper":{"title":"Performance of group testing algorithms with near-constant tests-per-item","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Jonathan Scarlett, Matthew Aldridge, Oliver Johnson","submitted_at":"2016-11-21T10:48:27Z","abstract_excerpt":"We consider the nonadaptive group testing with N items, of which $K = \\Theta(N^\\theta)$ are defective. We study a test design in which each item appears in nearly the same number of tests. For each item, we independently pick L tests uniformly at random with replacement, and place the item in those tests. We analyse the performance of these designs with simple and practical decoding algorithms in a range of sparsity regimes, and show that the performance is consistently improved in comparison with standard Bernoulli designs. We show that our new design requires 23% fewer tests than a Bernoulli"},"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":"1612.07122","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-21T10:48:27Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"5e2b70544aabcf5f105ea34a8851d5db0c64f35116873c0b1838d834ac7efc4d","abstract_canon_sha256":"d47c8d50c458163792ed58b667349e8fd82704c58d0feb7237dd57049833755d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:00.741820Z","signature_b64":"aq6QLSNuwSpNfJq6A6Wd+0hflfS1r1w8IRcIyTdL/rpxxrFqJKIEUQacLtLvNr4AZysDSdSJOMQlp2clLBlPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2c8b9904bd99a305bf362dfa6b9d60eab0ef10d3a739e5aae254c49863e0a28","last_reissued_at":"2026-05-18T00:05:00.741406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:00.741406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance of group testing algorithms with near-constant tests-per-item","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Jonathan Scarlett, Matthew Aldridge, Oliver Johnson","submitted_at":"2016-11-21T10:48:27Z","abstract_excerpt":"We consider the nonadaptive group testing with N items, of which $K = \\Theta(N^\\theta)$ are defective. We study a test design in which each item appears in nearly the same number of tests. For each item, we independently pick L tests uniformly at random with replacement, and place the item in those tests. We analyse the performance of these designs with simple and practical decoding algorithms in a range of sparsity regimes, and show that the performance is consistently improved in comparison with standard Bernoulli designs. We show that our new design requires 23% fewer tests than a Bernoulli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07122","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":""},"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":"1612.07122","created_at":"2026-05-18T00:05:00.741461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07122v3","created_at":"2026-05-18T00:05:00.741461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07122","created_at":"2026-05-18T00:05:00.741461+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLELTECL3GND","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLELTECL3GNDAW7T","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLELTECL","created_at":"2026-05-18T12:30:53.716459+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/YLELTECL3GNDAW7TMLP2NOOWB2","json":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2.json","graph_json":"https://pith.science/api/pith-number/YLELTECL3GNDAW7TMLP2NOOWB2/graph.json","events_json":"https://pith.science/api/pith-number/YLELTECL3GNDAW7TMLP2NOOWB2/events.json","paper":"https://pith.science/paper/YLELTECL"},"agent_actions":{"view_html":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2","download_json":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2.json","view_paper":"https://pith.science/paper/YLELTECL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07122&json=true","fetch_graph":"https://pith.science/api/pith-number/YLELTECL3GNDAW7TMLP2NOOWB2/graph.json","fetch_events":"https://pith.science/api/pith-number/YLELTECL3GNDAW7TMLP2NOOWB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2/action/storage_attestation","attest_author":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2/action/author_attestation","sign_citation":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2/action/citation_signature","submit_replication":"https://pith.science/pith/YLELTECL3GNDAW7TMLP2NOOWB2/action/replication_record"}},"created_at":"2026-05-18T00:05:00.741461+00:00","updated_at":"2026-05-18T00:05:00.741461+00:00"}