{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NLCTXATKJQYQJM2MVT3L2IYJKJ","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":"d170af67616e065d8dd3fa58373026268b630bf7c24b8df4d247f17537ebeadb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T12:34:31Z","title_canon_sha256":"f4ef6a00ad52df16673a3b4aa0d3cf239828c607275e35092e91a73776a65cd7"},"schema_version":"1.0","source":{"id":"1901.02283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02283","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02283v1","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02283","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"NLCTXATKJQYQ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NLCTXATKJQYQJM2M","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NLCTXATK","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:a9dc209bdc0cb4e57857e4d3515be874ef8317a6738a7649507ac3fd665a2089","target":"graph","created_at":"2026-05-17T23:56:43Z","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":"The 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$. A test is positive if it has at least $u$ defective items and negative otherwise. Our objective is to identify defective items in sublinear time the number of items, e.g., $\\mathrm{poly}(d, \\ln{n}),$ by using the number of tests as low as possible. In this paper, we reduce the number of tests to $O \\left( h \\times \\frac{d^2 \\ln^2{n}}{\\mathsf{W}^2(d \\ln{n})} \\right)$ and the decoding time to $O \\left( \\mathrm{dec}_0 \\times h \\right),$ where $\\","authors_text":"Isao Echizen, Mahdi Cheraghchi, Minoru Kuribayashi, Thach V. Bui","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T12:34:31Z","title":"Improved encoding and decoding for non-adaptive threshold group testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02283","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:fa3360c0f8a84fb3c0fac0d3f138640f388781f464466ecb03cb689c78a28397","target":"record","created_at":"2026-05-17T23:56:43Z","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":"d170af67616e065d8dd3fa58373026268b630bf7c24b8df4d247f17537ebeadb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T12:34:31Z","title_canon_sha256":"f4ef6a00ad52df16673a3b4aa0d3cf239828c607275e35092e91a73776a65cd7"},"schema_version":"1.0","source":{"id":"1901.02283","kind":"arxiv","version":1}},"canonical_sha256":"6ac53b826a4c3104b34cacf6bd230952586e76ccc7adf0c57d6093855494024b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ac53b826a4c3104b34cacf6bd230952586e76ccc7adf0c57d6093855494024b","first_computed_at":"2026-05-17T23:56:43.648470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:43.648470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1n7YZKlBb6RKedfizABqTwbU3ekH8uP985HxBBNRVBQP2Q1XZGdEbaahgcq8E7RMJNpEZwD/6nixaTO3mC36Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:43.648870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa3360c0f8a84fb3c0fac0d3f138640f388781f464466ecb03cb689c78a28397","sha256:a9dc209bdc0cb4e57857e4d3515be874ef8317a6738a7649507ac3fd665a2089"],"state_sha256":"3238cd1d0f61d0e41717acfe02330b7f79917ee920118d07bb69ab58d4756646"}