{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YKIVGX267LOWD7LMTIS6IRFN24","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":"7c54c1970c1cce6ca1c4d7a7a732c4140cf9e0975d5d953432545f7ee3f3bdcd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-31T07:20:48Z","title_canon_sha256":"744fbe1e1d143aad4db9dedf6f8f76de786c473f27be10580ebf6fa05415904e"},"schema_version":"1.0","source":{"id":"1904.00349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.00349","created_at":"2026-05-17T23:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.00349v1","created_at":"2026-05-17T23:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00349","created_at":"2026-05-17T23:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"YKIVGX267LOW","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YKIVGX267LOWD7LM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YKIVGX26","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:3e494b494004ca1fa21a0cef26b5af8187e91b6e946b10f0d01e50c89c7a434e","target":"graph","created_at":"2026-05-17T23:49:48Z","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 combinatorial group testing is to efficiently identify up to $d$ defective items in a large population of $n$ items, where $d \\ll n$. Defective items satisfy certain properties while the remaining items in the population do not. To efficiently identify defective items, a subset of items is pooled and then tested. In this work, we consider complex group testing (CmplxGT) in which a set of defective items consists of subsets of positive items (called \\textit{positive complexes}). CmplxGT is classified into two categories: classical CmplxGT (CCmplxGT) and generalized CmplxGT (GCmplxGT","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-03-31T07:20:48Z","title":"Efficient and error-tolerant schemes for non-adaptive complex group testing and its application in complex disease genetics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00349","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:45fd4201a7f7b8b2258299683a2ca05a000ca7531f3a575ed6b302789358bf99","target":"record","created_at":"2026-05-17T23:49:48Z","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":"7c54c1970c1cce6ca1c4d7a7a732c4140cf9e0975d5d953432545f7ee3f3bdcd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-31T07:20:48Z","title_canon_sha256":"744fbe1e1d143aad4db9dedf6f8f76de786c473f27be10580ebf6fa05415904e"},"schema_version":"1.0","source":{"id":"1904.00349","kind":"arxiv","version":1}},"canonical_sha256":"c291535f5efadd61fd6c9a25e444add71d9e7430a56b11dd6186d35d6d2a0488","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c291535f5efadd61fd6c9a25e444add71d9e7430a56b11dd6186d35d6d2a0488","first_computed_at":"2026-05-17T23:49:48.654346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:48.654346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wQmijpiR53PP9Ie+kzvhVEZP+wGhgrjCEUp42OmvzxyO3S1eDkK0ec1ROQNABMJ/etXgICLFkN9SxdzqoQy0Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:48.654812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.00349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45fd4201a7f7b8b2258299683a2ca05a000ca7531f3a575ed6b302789358bf99","sha256:3e494b494004ca1fa21a0cef26b5af8187e91b6e946b10f0d01e50c89c7a434e"],"state_sha256":"e536adddce379362ca0efdecd824e8e2c6dae0c101d2f3c909796ec8d31fd7ec"}