{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VPA53E7EEOEVUEMIG6JK5NFT5P","short_pith_number":"pith:VPA53E7E","canonical_record":{"source":{"id":"1712.03168","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2017-12-08T16:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"7ff78990bd75fb6af3d2811b03248701882488639c2dca9a604fd12e4bef38a2","abstract_canon_sha256":"cb8876b49867a0397ee3804504273623fa02be89db9f20ad4ce9c3c51f7dcb74"},"schema_version":"1.0"},"canonical_sha256":"abc1dd93e423895a11883792aeb4b3ebc5873ef459a37f0d0a347f62fa5949bb","source":{"kind":"arxiv","id":"1712.03168","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03168","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03168v2","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03168","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"pith_short_12","alias_value":"VPA53E7EEOEV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VPA53E7EEOEVUEMI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VPA53E7E","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VPA53E7EEOEVUEMIG6JK5NFT5P","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03168","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2017-12-08T16:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"7ff78990bd75fb6af3d2811b03248701882488639c2dca9a604fd12e4bef38a2","abstract_canon_sha256":"cb8876b49867a0397ee3804504273623fa02be89db9f20ad4ce9c3c51f7dcb74"},"schema_version":"1.0"},"canonical_sha256":"abc1dd93e423895a11883792aeb4b3ebc5873ef459a37f0d0a347f62fa5949bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:31.195163Z","signature_b64":"KeU+zoE2aAFJOvM9YkSC44nEaWbu/VTtn6kum4Z+9hWhXVgPYVwwgXQOTz/7/RJocfvfoZ7V5xbhVQW3BKrGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abc1dd93e423895a11883792aeb4b3ebc5873ef459a37f0d0a347f62fa5949bb","last_reissued_at":"2026-05-18T00:18:31.194645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:31.194645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03168","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-18T00:18:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90FxEnObERQcWExZzrq0/QPvJWu7a9qXtyTEWmnxqHVs5BYvf7Ep8LNyWzJaU8Sb1xz0GWiYfDN1arwaJDu7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:44:07.386878Z"},"content_sha256":"070fcaacf680af744fd88b1d2ad7231bb3644d88dd5f6306c810879853a38f07","schema_version":"1.0","event_id":"sha256:070fcaacf680af744fd88b1d2ad7231bb3644d88dd5f6306c810879853a38f07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VPA53E7EEOEVUEMIG6JK5NFT5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On optimal policy in the group testing with incomplete identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.OT","authors_text":"Yaakov Malinovsky","submitted_at":"2017-12-08T16:54:22Z","abstract_excerpt":"Consider a very large (infinite) population of items, where each item independent from the others is defective with probability p, or good with probability q=1-p. The goal is to identify N good items as quickly as possible. The following group testing policy (policy A) is considered: test items together in the groups, if the test outcome of group i of size n_i is negative, then accept all items in this group as good, otherwise discard the group. Then, move to the next group and continue until exact N good items are found. The goal is to find an optimal testing configuration, i.e., group sizes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03168","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-18T00:18:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdrvnOxVcRfM7Mry3LojMgYLD39zUB/t0S9wAbyEdDr+UNq0S9W3dtPx2M7BYxL/EBqdsoJvFDxUxZ5hDXUmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:44:07.387225Z"},"content_sha256":"4e8c4edfbad7e24c58a6ec21bdd55ecb90c8b4f8386199bb80d999d2d27cc5c1","schema_version":"1.0","event_id":"sha256:4e8c4edfbad7e24c58a6ec21bdd55ecb90c8b4f8386199bb80d999d2d27cc5c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/bundle.json","state_url":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/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-21T06:44:07Z","links":{"resolver":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P","bundle":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/bundle.json","state":"https://pith.science/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPA53E7EEOEVUEMIG6JK5NFT5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VPA53E7EEOEVUEMIG6JK5NFT5P","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":"cb8876b49867a0397ee3804504273623fa02be89db9f20ad4ce9c3c51f7dcb74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2017-12-08T16:54:22Z","title_canon_sha256":"7ff78990bd75fb6af3d2811b03248701882488639c2dca9a604fd12e4bef38a2"},"schema_version":"1.0","source":{"id":"1712.03168","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03168","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03168v2","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03168","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"pith_short_12","alias_value":"VPA53E7EEOEV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VPA53E7EEOEVUEMI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VPA53E7E","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:4e8c4edfbad7e24c58a6ec21bdd55ecb90c8b4f8386199bb80d999d2d27cc5c1","target":"graph","created_at":"2026-05-18T00:18:31Z","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":"Consider a very large (infinite) population of items, where each item independent from the others is defective with probability p, or good with probability q=1-p. The goal is to identify N good items as quickly as possible. The following group testing policy (policy A) is considered: test items together in the groups, if the test outcome of group i of size n_i is negative, then accept all items in this group as good, otherwise discard the group. Then, move to the next group and continue until exact N good items are found. The goal is to find an optimal testing configuration, i.e., group sizes,","authors_text":"Yaakov Malinovsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2017-12-08T16:54:22Z","title":"On optimal policy in the group testing with incomplete identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03168","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:070fcaacf680af744fd88b1d2ad7231bb3644d88dd5f6306c810879853a38f07","target":"record","created_at":"2026-05-18T00:18:31Z","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":"cb8876b49867a0397ee3804504273623fa02be89db9f20ad4ce9c3c51f7dcb74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.OT","submitted_at":"2017-12-08T16:54:22Z","title_canon_sha256":"7ff78990bd75fb6af3d2811b03248701882488639c2dca9a604fd12e4bef38a2"},"schema_version":"1.0","source":{"id":"1712.03168","kind":"arxiv","version":2}},"canonical_sha256":"abc1dd93e423895a11883792aeb4b3ebc5873ef459a37f0d0a347f62fa5949bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abc1dd93e423895a11883792aeb4b3ebc5873ef459a37f0d0a347f62fa5949bb","first_computed_at":"2026-05-18T00:18:31.194645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:31.194645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KeU+zoE2aAFJOvM9YkSC44nEaWbu/VTtn6kum4Z+9hWhXVgPYVwwgXQOTz/7/RJocfvfoZ7V5xbhVQW3BKrGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:31.195163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03168","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:070fcaacf680af744fd88b1d2ad7231bb3644d88dd5f6306c810879853a38f07","sha256:4e8c4edfbad7e24c58a6ec21bdd55ecb90c8b4f8386199bb80d999d2d27cc5c1"],"state_sha256":"1926aed59eeae87d1d097b73e84980f1a1554844c229ed5bcbffeaf16af12f72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZHesITh4mMwfbIM3g8T0eRN2RSPowai3jm+gOw4zGAEZ9f/CmPyN2BKMm5NNKeDxN4CtLjt19fEcBM4Fh1CDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T06:44:07.389182Z","bundle_sha256":"a02df60002c2d86589698de46b6a7c8ae3155f424535d34ba8f55c9030021d9b"}}