{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NUMCQLVLYFQIE7MF4WNUNGX2FA","short_pith_number":"pith:NUMCQLVL","schema_version":"1.0","canonical_sha256":"6d18282eabc160827d85e59b469afa281902ac5301824aa02c8f4001890d3bee","source":{"kind":"arxiv","id":"2305.06737","version":2},"attestation_state":"computed","paper":{"title":"A Diagonal Splitting Algorithm for Adaptive Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaorui Yao, Christina Fragouli, Pavlos Nikolopoulos","submitted_at":"2023-05-11T11:33:42Z","abstract_excerpt":"Group testing enables to identify infected individuals in a population using a smaller number of tests than individual testing. To achieve this, group testing algorithms commonly assume knowledge of the number of infected individuals; nonadaptive and several adaptive algorithms fall in this category. Some adaptive algorithms, like binary splitting, operate without this assumption, but require a number of stages that may scale linearly with the size of the population. In this paper we contribute a new algorithm that enables a balance between the number of tests and the number of stages used, an"},"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":"2305.06737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-05-11T11:33:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f22bf6c4b480f0682a33bdda51d2d9c31c60d2ce873f0f7e1a4f4ead89a70547","abstract_canon_sha256":"a236789f913904512633caee017711952633bc3c7603e73b97dffccb5d5b2622"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:52.063018Z","signature_b64":"24nsXwLtBjZuLi/TqGA6L5nzIOoLfBRNUUpvRiaCYP2t0NNJ/u0vTc2qfkBSFwKqdKF0gROTUWGLz2owm9XlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d18282eabc160827d85e59b469afa281902ac5301824aa02c8f4001890d3bee","last_reissued_at":"2026-07-05T06:09:52.062639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:52.062639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Diagonal Splitting Algorithm for Adaptive Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaorui Yao, Christina Fragouli, Pavlos Nikolopoulos","submitted_at":"2023-05-11T11:33:42Z","abstract_excerpt":"Group testing enables to identify infected individuals in a population using a smaller number of tests than individual testing. To achieve this, group testing algorithms commonly assume knowledge of the number of infected individuals; nonadaptive and several adaptive algorithms fall in this category. Some adaptive algorithms, like binary splitting, operate without this assumption, but require a number of stages that may scale linearly with the size of the population. In this paper we contribute a new algorithm that enables a balance between the number of tests and the number of stages used, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.06737","kind":"arxiv","version":2},"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/2305.06737/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":"2305.06737","created_at":"2026-07-05T06:09:52.062690+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.06737v2","created_at":"2026-07-05T06:09:52.062690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.06737","created_at":"2026-07-05T06:09:52.062690+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUMCQLVLYFQI","created_at":"2026-07-05T06:09:52.062690+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUMCQLVLYFQIE7MF","created_at":"2026-07-05T06:09:52.062690+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUMCQLVL","created_at":"2026-07-05T06:09:52.062690+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/NUMCQLVLYFQIE7MF4WNUNGX2FA","json":"https://pith.science/pith/NUMCQLVLYFQIE7MF4WNUNGX2FA.json","graph_json":"https://pith.science/api/pith-number/NUMCQLVLYFQIE7MF4WNUNGX2FA/graph.json","events_json":"https://pith.science/api/pith-number/NUMCQLVLYFQIE7MF4WNUNGX2FA/events.json","paper":"https://pith.science/paper/NUMCQLVL"},"agent_actions":{"view_html":"https://pith.science/pith/NUMCQLVLYFQIE7MF4WNUNGX2FA","download_json":"https://pith.science/pith/NUMCQLVLYFQIE7MF4WNUNGX2FA.json","view_paper":"https://pith.science/paper/NUMCQLVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.06737&json=true","fetch_graph":"https://pith.science/api/pith-number/NUMCQLVLYFQIE7MF4WNUNGX2FA/graph.json","fetch_events":"https://pith.science/api/pith-number/NUMCQLVLYFQIE7MF4WNUNGX2FA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUMCQLVLYFQIE7MF4WNUNGX2FA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUMCQLVLYFQIE7MF4WNUNGX2FA/action/storage_attestation","attest_author":"https://pith.science/pith/NUMCQLVLYFQIE7MF4WNUNGX2FA/action/author_attestation","sign_citation":"https://pith.science/pith/NUMCQLVLYFQIE7MF4WNUNGX2FA/action/citation_signature","submit_replication":"https://pith.science/pith/NUMCQLVLYFQIE7MF4WNUNGX2FA/action/replication_record"}},"created_at":"2026-07-05T06:09:52.062690+00:00","updated_at":"2026-07-05T06:09:52.062690+00:00"}