{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NVITC2VHSG7Z4CABTN4YTASLPU","short_pith_number":"pith:NVITC2VH","schema_version":"1.0","canonical_sha256":"6d51316aa791bf9e08019b7989824b7d253c16d6507b0cd6d451183f657378d0","source":{"kind":"arxiv","id":"2405.16370","version":1},"attestation_state":"computed","paper":{"title":"Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett and Cheraghchi-Nakos's Nonadaptive Splitting with Explicit Scalars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hsin-Po Wang, Ryan Gabrys, Venkatesan Guruswami","submitted_at":"2024-05-25T22:39:47Z","abstract_excerpt":"We modify Cheraghchi-Nakos [CN20] and Price-Scarlett's [PS20] fast binary splitting approach to nonadaptive group testing. We show that, to identify a uniformly random subset of $k$ infected persons among a population of $n$, it takes only $\\ln(2 - 4\\varepsilon) ^{-2} k \\ln n$ tests and decoding complexity $O(\\varepsilon^{-2} k \\ln n)$, for any small $\\varepsilon > 0$, with vanishing error probability. In works prior to ours, only two types of group testing schemes exist. Those that use $\\ln(2)^{-2} k \\ln n$ or fewer tests require linear-in-$n$ complexity, sometimes even polynomial in $n$; tho"},"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":"2405.16370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-25T22:39:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"85cac0d4fff4012bb35cc78688cb3a75a59a9d576bcc8242bc92a1018db0c762","abstract_canon_sha256":"fffadae8c48e8ea735c74cd603eed0f59639961b0613cf6c841316f313ecc28b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:29.195115Z","signature_b64":"AJvC50GwHI0pp8nGsGOpqKZnFo/cVa0hoU0lh8L9ksE/3SJQGZyyOoOTVQYCdflU0F0wZCjIEs9tj/VA6nmZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d51316aa791bf9e08019b7989824b7d253c16d6507b0cd6d451183f657378d0","last_reissued_at":"2026-07-05T08:23:29.194418Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:29.194418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett and Cheraghchi-Nakos's Nonadaptive Splitting with Explicit Scalars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hsin-Po Wang, Ryan Gabrys, Venkatesan Guruswami","submitted_at":"2024-05-25T22:39:47Z","abstract_excerpt":"We modify Cheraghchi-Nakos [CN20] and Price-Scarlett's [PS20] fast binary splitting approach to nonadaptive group testing. We show that, to identify a uniformly random subset of $k$ infected persons among a population of $n$, it takes only $\\ln(2 - 4\\varepsilon) ^{-2} k \\ln n$ tests and decoding complexity $O(\\varepsilon^{-2} k \\ln n)$, for any small $\\varepsilon > 0$, with vanishing error probability. In works prior to ours, only two types of group testing schemes exist. Those that use $\\ln(2)^{-2} k \\ln n$ or fewer tests require linear-in-$n$ complexity, sometimes even polynomial in $n$; tho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16370","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/2405.16370/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":"2405.16370","created_at":"2026-07-05T08:23:29.194478+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16370v1","created_at":"2026-07-05T08:23:29.194478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16370","created_at":"2026-07-05T08:23:29.194478+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVITC2VHSG7Z","created_at":"2026-07-05T08:23:29.194478+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVITC2VHSG7Z4CAB","created_at":"2026-07-05T08:23:29.194478+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVITC2VH","created_at":"2026-07-05T08:23:29.194478+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17751","citing_title":"Group Testing with General Correlation Using Hypergraphs","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVITC2VHSG7Z4CABTN4YTASLPU","json":"https://pith.science/pith/NVITC2VHSG7Z4CABTN4YTASLPU.json","graph_json":"https://pith.science/api/pith-number/NVITC2VHSG7Z4CABTN4YTASLPU/graph.json","events_json":"https://pith.science/api/pith-number/NVITC2VHSG7Z4CABTN4YTASLPU/events.json","paper":"https://pith.science/paper/NVITC2VH"},"agent_actions":{"view_html":"https://pith.science/pith/NVITC2VHSG7Z4CABTN4YTASLPU","download_json":"https://pith.science/pith/NVITC2VHSG7Z4CABTN4YTASLPU.json","view_paper":"https://pith.science/paper/NVITC2VH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16370&json=true","fetch_graph":"https://pith.science/api/pith-number/NVITC2VHSG7Z4CABTN4YTASLPU/graph.json","fetch_events":"https://pith.science/api/pith-number/NVITC2VHSG7Z4CABTN4YTASLPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVITC2VHSG7Z4CABTN4YTASLPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVITC2VHSG7Z4CABTN4YTASLPU/action/storage_attestation","attest_author":"https://pith.science/pith/NVITC2VHSG7Z4CABTN4YTASLPU/action/author_attestation","sign_citation":"https://pith.science/pith/NVITC2VHSG7Z4CABTN4YTASLPU/action/citation_signature","submit_replication":"https://pith.science/pith/NVITC2VHSG7Z4CABTN4YTASLPU/action/replication_record"}},"created_at":"2026-07-05T08:23:29.194478+00:00","updated_at":"2026-07-05T08:23:29.194478+00:00"}