{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FEHSAU4OYOU4SDQQUCVG5DSN6Q","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":"b262086757390ece03a2a3cf5d1a71a1b450063704b0c75eff2c2e58c77abf6e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-16T07:59:07Z","title_canon_sha256":"a7803f64615cf6eccec01c274a96da58bcbd8813745d38485f0c2a220f4553bb"},"schema_version":"1.0","source":{"id":"1803.06105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06105","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06105v1","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06105","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"FEHSAU4OYOU4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FEHSAU4OYOU4SDQQ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FEHSAU4O","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:8272b45658303fee1da93c2eab2c870354aff785603c510b120165b4062f24f8","target":"graph","created_at":"2026-05-18T00:20:50Z","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 non-adaptive group testing is to identify at most $d$ defective items from $N$ items, in which a test of a subset of $N$ items is positive if it contains at least one defective item, and negative otherwise. However, in many cases, especially in biological screening, the outcome is unreliable due to biochemical interaction; i.e., \\textit{noise.} Consequently, a positive result can change to a negative one (false negative) and vice versa (false positive). In this work, we first consider the dilution effect in which \\textit{the degree of noise depends on the number of items in the tes","authors_text":"Isao Echizen, Minoru Kuribayashi, Tetsuya Kojima, Thach V. Bui","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-16T07:59:07Z","title":"Efficient Decoding Schemes for Noisy Non-Adaptive Group Testing when Noise Depends on Number of Items in Test"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06105","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:ec90a2169014a5c7ccc7972fd46e993c398e5cb573865cd57f0adbe4890c0138","target":"record","created_at":"2026-05-18T00:20:50Z","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":"b262086757390ece03a2a3cf5d1a71a1b450063704b0c75eff2c2e58c77abf6e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-16T07:59:07Z","title_canon_sha256":"a7803f64615cf6eccec01c274a96da58bcbd8813745d38485f0c2a220f4553bb"},"schema_version":"1.0","source":{"id":"1803.06105","kind":"arxiv","version":1}},"canonical_sha256":"290f20538ec3a9c90e10a0aa6e8e4df43d1e86967443e11b82a204b13eeb20f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"290f20538ec3a9c90e10a0aa6e8e4df43d1e86967443e11b82a204b13eeb20f8","first_computed_at":"2026-05-18T00:20:50.621637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:50.621637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nSjzN9O+j7aTikPcsiZg9tMqvhPZOyGvIE1Tfg3gXi6DZMC6Zemif5S57s2zdPP5wOVNQmx5n5Ej4ImMIfj8BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:50.622203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec90a2169014a5c7ccc7972fd46e993c398e5cb573865cd57f0adbe4890c0138","sha256:8272b45658303fee1da93c2eab2c870354aff785603c510b120165b4062f24f8"],"state_sha256":"56bf18485c6c1fa41dca516ba4c94720ffe8b0e6bc6e09a8ff847033e92ba3fe"}