{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:K5OB6EP2MXQUCDWR4N2LADUZY2","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":"fefea2cbac7307afe6cb1375f900b413e8bcb9a757b910e047a339da1a1bad29","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-03T23:28:57Z","title_canon_sha256":"9f547e65af08c4520ae35ef7f90352ccf278cf47c0c3c96c017ebf23f0ee7ec2"},"schema_version":"1.0","source":{"id":"2001.01008","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.01008","created_at":"2026-07-05T03:07:42Z"},{"alias_kind":"arxiv_version","alias_value":"2001.01008v3","created_at":"2026-07-05T03:07:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.01008","created_at":"2026-07-05T03:07:42Z"},{"alias_kind":"pith_short_12","alias_value":"K5OB6EP2MXQU","created_at":"2026-07-05T03:07:42Z"},{"alias_kind":"pith_short_16","alias_value":"K5OB6EP2MXQUCDWR","created_at":"2026-07-05T03:07:42Z"},{"alias_kind":"pith_short_8","alias_value":"K5OB6EP2","created_at":"2026-07-05T03:07:42Z"}],"graph_snapshots":[{"event_id":"sha256:f44f51caee216d0243dfb61ad9bb6d05d5c76cd72cedb46cb5c5d43b06256fe7","target":"graph","created_at":"2026-07-05T03:07:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.01008/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The basic goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. The outcome of a test on a subset of items is positive if the subset has at least $u$ defective items, negative if it has up to $\\ell$ defective items, where $0\\leq\\ell<u$, and arbitrary otherwise. This is called threshold group testing. The parameter $g=u-\\ell-1$ is called \\textit{the gap}. In this paper, we focus on the case $g>0$, i.e., threshold group testing with a gap. Note that the results presented here are also applicable to th","authors_text":"Isao Echizen, Mahdi Cheraghchi, Thach V. Bui","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-03T23:28:57Z","title":"Improved non-adaptive algorithms for threshold group testing with a gap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.01008","kind":"arxiv","version":3},"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:6e3d8bb2edfd3afb0d1a60f7b80011037c511c6dc03407a6dc2882433d7cfcb4","target":"record","created_at":"2026-07-05T03:07:42Z","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":"fefea2cbac7307afe6cb1375f900b413e8bcb9a757b910e047a339da1a1bad29","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-03T23:28:57Z","title_canon_sha256":"9f547e65af08c4520ae35ef7f90352ccf278cf47c0c3c96c017ebf23f0ee7ec2"},"schema_version":"1.0","source":{"id":"2001.01008","kind":"arxiv","version":3}},"canonical_sha256":"575c1f11fa65e1410ed1e374b00e99c680c8e681a3084794f1d7b24aa6cf8897","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"575c1f11fa65e1410ed1e374b00e99c680c8e681a3084794f1d7b24aa6cf8897","first_computed_at":"2026-07-05T03:07:42.444677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:07:42.444677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ObXAliSje1O29CnLnC9oSUGLcsmVbOr05lp6x35KPDj3oSpnCp3lofkBXXD1/qU/Y23IgQKZihmz+WL6xHhQCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:07:42.445012Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.01008","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e3d8bb2edfd3afb0d1a60f7b80011037c511c6dc03407a6dc2882433d7cfcb4","sha256:f44f51caee216d0243dfb61ad9bb6d05d5c76cd72cedb46cb5c5d43b06256fe7"],"state_sha256":"1fa6275f18bfacd8e1d579d7fdd37abda7c5cf9513d293f85bba6bd2d89e8612"}