{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2MKMSMMXQOJ5RQ2CAVY63UTIYO","short_pith_number":"pith:2MKMSMMX","canonical_record":{"source":{"id":"1901.06740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-20T22:02:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3559992e7df8dcfd7bad6e58877cb6d3060fbbbf4437b47663be673b59f2cf4f","abstract_canon_sha256":"eae11db67fadf4c3a7983c405c75aceb201999ccca93c98e625ef2cb3acd2b96"},"schema_version":"1.0"},"canonical_sha256":"d314c931978393d8c3420571edd268c384cd116a723d7ef8c53375b739c5517e","source":{"kind":"arxiv","id":"1901.06740","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06740","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06740v2","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06740","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"pith_short_12","alias_value":"2MKMSMMXQOJ5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2MKMSMMXQOJ5RQ2C","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2MKMSMMX","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2MKMSMMXQOJ5RQ2CAVY63UTIYO","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-20T22:02:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3559992e7df8dcfd7bad6e58877cb6d3060fbbbf4437b47663be673b59f2cf4f","abstract_canon_sha256":"eae11db67fadf4c3a7983c405c75aceb201999ccca93c98e625ef2cb3acd2b96"},"schema_version":"1.0"},"canonical_sha256":"d314c931978393d8c3420571edd268c384cd116a723d7ef8c53375b739c5517e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:26.532237Z","signature_b64":"mnzlS0+ZBugSDdNhTGMBXuzNB6MI2H0gBY24uxYzkU4FBX4PaX74rPH0+ahen8qz3eU2dTSUJUGi4mWgtchpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d314c931978393d8c3420571edd268c384cd116a723d7ef8c53375b739c5517e","last_reissued_at":"2026-05-17T23:47:26.531766Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:26.531766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06740","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egmi3XZfmJQVxtlVDBz07zUiHvf3z7T2fm9zGhli0YI66NreMPpL5C3kyfliz5un9XtNobqCQrS8GmKlu9+FCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:11:17.079912Z"},"content_sha256":"dbae931fa3bd1da600d34fa3baaac460e568604248c8145826b6712d085e6049","schema_version":"1.0","event_id":"sha256:dbae931fa3bd1da600d34fa3baaac460e568604248c8145826b6712d085e6049"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2MKMSMMXQOJ5RQ2CAVY63UTIYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Algorithm for Two-Stage Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ilya Vorobyev","submitted_at":"2019-01-20T22:02:54Z","abstract_excerpt":"Group testing is a well-known search problem that consists in detecting of $s$ defective members of a set of $t$ samples by carrying out tests on properly chosen subsets of samples. In classical group testing the goal is to find all defective elements by using the minimal possible number of tests in the worst case. In this work, two-stage group testing is considered. Using the hypergraph approach we design a new search algorithm, which allows improving the known results for fixed $s$ and $t\\to\\infty$. For the case $s=2$ this algorithm achieves information-theoretic lower bound $2\\log_2t(1+o(1)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06740","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8YK8lrBq4Pnm/oicXDLdbwB2q48zu9KYpV9X1DRJUm/BHBw1ZxhzU8vPMSMNO60uhj23Shhwgvb7iZmOOFjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:11:17.080250Z"},"content_sha256":"6890e94e58a356612c09f4333ad06626efed4028093483fc97dab28a289863d2","schema_version":"1.0","event_id":"sha256:6890e94e58a356612c09f4333ad06626efed4028093483fc97dab28a289863d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MKMSMMXQOJ5RQ2CAVY63UTIYO/bundle.json","state_url":"https://pith.science/pith/2MKMSMMXQOJ5RQ2CAVY63UTIYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MKMSMMXQOJ5RQ2CAVY63UTIYO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T18:11:17Z","links":{"resolver":"https://pith.science/pith/2MKMSMMXQOJ5RQ2CAVY63UTIYO","bundle":"https://pith.science/pith/2MKMSMMXQOJ5RQ2CAVY63UTIYO/bundle.json","state":"https://pith.science/pith/2MKMSMMXQOJ5RQ2CAVY63UTIYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MKMSMMXQOJ5RQ2CAVY63UTIYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2MKMSMMXQOJ5RQ2CAVY63UTIYO","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":"eae11db67fadf4c3a7983c405c75aceb201999ccca93c98e625ef2cb3acd2b96","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-20T22:02:54Z","title_canon_sha256":"3559992e7df8dcfd7bad6e58877cb6d3060fbbbf4437b47663be673b59f2cf4f"},"schema_version":"1.0","source":{"id":"1901.06740","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06740","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06740v2","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06740","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"pith_short_12","alias_value":"2MKMSMMXQOJ5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2MKMSMMXQOJ5RQ2C","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2MKMSMMX","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:6890e94e58a356612c09f4333ad06626efed4028093483fc97dab28a289863d2","target":"graph","created_at":"2026-05-17T23:47:26Z","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":"Group testing is a well-known search problem that consists in detecting of $s$ defective members of a set of $t$ samples by carrying out tests on properly chosen subsets of samples. In classical group testing the goal is to find all defective elements by using the minimal possible number of tests in the worst case. In this work, two-stage group testing is considered. Using the hypergraph approach we design a new search algorithm, which allows improving the known results for fixed $s$ and $t\\to\\infty$. For the case $s=2$ this algorithm achieves information-theoretic lower bound $2\\log_2t(1+o(1)","authors_text":"Ilya Vorobyev","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-20T22:02:54Z","title":"A New Algorithm for Two-Stage Group Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06740","kind":"arxiv","version":2},"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:dbae931fa3bd1da600d34fa3baaac460e568604248c8145826b6712d085e6049","target":"record","created_at":"2026-05-17T23:47:26Z","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":"eae11db67fadf4c3a7983c405c75aceb201999ccca93c98e625ef2cb3acd2b96","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-20T22:02:54Z","title_canon_sha256":"3559992e7df8dcfd7bad6e58877cb6d3060fbbbf4437b47663be673b59f2cf4f"},"schema_version":"1.0","source":{"id":"1901.06740","kind":"arxiv","version":2}},"canonical_sha256":"d314c931978393d8c3420571edd268c384cd116a723d7ef8c53375b739c5517e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d314c931978393d8c3420571edd268c384cd116a723d7ef8c53375b739c5517e","first_computed_at":"2026-05-17T23:47:26.531766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:26.531766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mnzlS0+ZBugSDdNhTGMBXuzNB6MI2H0gBY24uxYzkU4FBX4PaX74rPH0+ahen8qz3eU2dTSUJUGi4mWgtchpAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:26.532237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06740","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbae931fa3bd1da600d34fa3baaac460e568604248c8145826b6712d085e6049","sha256:6890e94e58a356612c09f4333ad06626efed4028093483fc97dab28a289863d2"],"state_sha256":"b96d68088d2e526c62d37e7f22432cf747967fd60265414bfbaee2c404f48bcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUfWja4UADjiEZ1bBAD41zIxLCBYAKU65+Ec+25Ra9D+RtQY5oV6op1xFqVMbQykn14B8FNMIf6dv4pKW0DZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:11:17.082256Z","bundle_sha256":"d1830f433749b534b7efc1ca0f2e447a6240dbf141a5e063a481646306acadb8"}}