{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RDFQZAI622QV5T3MUV4HBVKD4X","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":"3c09c3e9943b9d45374f48a96cbc36ac4f1aaaa59d2bd5ee746d56fc54fbe1ce","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-14T13:11:15Z","title_canon_sha256":"75bc87c620538d6eda7c40b565dec73654315f22087e328237795a82248a2632"},"schema_version":"1.0","source":{"id":"1407.3631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3631","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3631v1","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3631","created_at":"2026-05-18T02:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"RDFQZAI622QV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RDFQZAI622QV5T3M","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RDFQZAI6","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:cf630730f3a909fb27cbd69daf336b22669e69d812ee20ca50059a0a8608792c","target":"graph","created_at":"2026-05-18T02:46:59Z","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":"In the classical combinatorial (adaptive) group testing problem, one is given two integers \\(d\\) and \\(n\\), where \\(0\\le d\\le n\\), and a population of \\(n\\) items, exactly \\(d\\) of which are known to be defective. The question is to devise an optimal sequential algorithm that, at each step, tests a subset of the population and determines whether such subset is contaminated (i.e. contains defective items) or otherwise. The problem is solved only when the \\(d\\) defective items are identified. The minimum number of steps that an optimal sequential algorithm takes in general (i.e. in the worst cas","authors_text":"David Cariolaro, Yi Zhang, Zhaiming Shen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-14T13:11:15Z","title":"Group Testing with Pools of Fixed Size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3631","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:288b340e79647ad3db61231faa59b458bf9553cb8b5db78f579aa31124686040","target":"record","created_at":"2026-05-18T02:46:59Z","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":"3c09c3e9943b9d45374f48a96cbc36ac4f1aaaa59d2bd5ee746d56fc54fbe1ce","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-14T13:11:15Z","title_canon_sha256":"75bc87c620538d6eda7c40b565dec73654315f22087e328237795a82248a2632"},"schema_version":"1.0","source":{"id":"1407.3631","kind":"arxiv","version":1}},"canonical_sha256":"88cb0c811ed6a15ecf6ca57870d543e5d1511471a44f50ef2d1b484b4d639161","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88cb0c811ed6a15ecf6ca57870d543e5d1511471a44f50ef2d1b484b4d639161","first_computed_at":"2026-05-18T02:46:59.433367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:59.433367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cgW9c4biPM1XJ1l5cj0FsGJL8ynZo7KTZLUFF4Zg8zsvRD7j5Qc0UtcgTkC+0Tpc9lbvhZ0QcYZkz9W4EicZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:59.433873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:288b340e79647ad3db61231faa59b458bf9553cb8b5db78f579aa31124686040","sha256:cf630730f3a909fb27cbd69daf336b22669e69d812ee20ca50059a0a8608792c"],"state_sha256":"fdd551a077872f52a563020406cc2cf9a48c954bcb6736b4c9d125580320c352"}