{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S3EPN3CE6BCWE2K77T5UKEHRGF","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":"429b1cdb3b4bc8b873b25937d1629c1e8e5fcdfcdbb99dabc4b6a47d8422af26","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-06T10:20:46Z","title_canon_sha256":"80b906ea51b632eaa60142d9ef506bf3a120dbb8ba45bef5ac5cfe3cd46d8898"},"schema_version":"1.0","source":{"id":"1911.02287","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.02287","created_at":"2026-07-05T02:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"1911.02287v3","created_at":"2026-07-05T02:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.02287","created_at":"2026-07-05T02:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"S3EPN3CE6BCW","created_at":"2026-07-05T02:39:55Z"},{"alias_kind":"pith_short_16","alias_value":"S3EPN3CE6BCWE2K7","created_at":"2026-07-05T02:39:55Z"},{"alias_kind":"pith_short_8","alias_value":"S3EPN3CE","created_at":"2026-07-05T02:39:55Z"}],"graph_snapshots":[{"event_id":"sha256:2a3e38e1a5209f2f0e9d2f3019b166b813597220bd12067b8c6686f49478c2b8","target":"graph","created_at":"2026-07-05T02:39:55Z","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/1911.02287/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the group testing problem the aim is to identify a small set of $k\\sim n^\\theta$ infected individuals out of a population size $n$, $0<\\theta<1$. We avail ourselves of a test procedure capable of testing groups of individuals, with the test returning a positive result iff at least one individual in the group is infected. The aim is to devise a test design with as few tests as possible so that the set of infected individuals can be identified correctly with high probability. We establish an explicit sharp information-theoretic/algorithmic phase transition $\\minf$ for non-adaptive group testi","authors_text":"Amin Coja-Oghlan, Max Hahn-Klimroth, Oliver Gebhard, Philipp Loick","cross_cats":["cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-06T10:20:46Z","title":"Optimal group testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.02287","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:9d1c2e5179a610c578f56222a914c697a6b26a0329ad2053382a480e1aae857b","target":"record","created_at":"2026-07-05T02:39:55Z","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":"429b1cdb3b4bc8b873b25937d1629c1e8e5fcdfcdbb99dabc4b6a47d8422af26","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-11-06T10:20:46Z","title_canon_sha256":"80b906ea51b632eaa60142d9ef506bf3a120dbb8ba45bef5ac5cfe3cd46d8898"},"schema_version":"1.0","source":{"id":"1911.02287","kind":"arxiv","version":3}},"canonical_sha256":"96c8f6ec44f04562695ffcfb4510f131542b40e91416d6fdc4d806da3a9d25cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96c8f6ec44f04562695ffcfb4510f131542b40e91416d6fdc4d806da3a9d25cf","first_computed_at":"2026-07-05T02:39:55.604535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:39:55.604535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+zqbWtyfuhvzfaODX3tnGKln04QAVHvF2lTUPkdtgyPyXBunuJgpH5OFFlH/tYgPLmM9hVf20Wg3Qg0WNSZJCw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:39:55.604939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.02287","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d1c2e5179a610c578f56222a914c697a6b26a0329ad2053382a480e1aae857b","sha256:2a3e38e1a5209f2f0e9d2f3019b166b813597220bd12067b8c6686f49478c2b8"],"state_sha256":"e7a829e6693ab3bf872c8603680d52887a0b4c3808bd1a2c89835097d1cf28ae"}