{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UY3ALCI7RNDSQ77IIQE36PPN7C","short_pith_number":"pith:UY3ALCI7","canonical_record":{"source":{"id":"1802.09751","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-02-27T07:30:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9f11df5e26aa3449edf68f5d226044d83e72c78bc22be49aa2f271284fdc95ef","abstract_canon_sha256":"96fc1a3cbb614b4aa3dbd93e2bade488abb0ae817bc8159fca980fb88b3d7367"},"schema_version":"1.0"},"canonical_sha256":"a63605891f8b47287fe84409bf3dedf8b97a12454f3fb54d80368d6af566f576","source":{"kind":"arxiv","id":"1802.09751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09751","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09751v1","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09751","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"UY3ALCI7RNDS","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UY3ALCI7RNDSQ77I","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UY3ALCI7","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UY3ALCI7RNDSQ77IIQE36PPN7C","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09751","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-02-27T07:30:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9f11df5e26aa3449edf68f5d226044d83e72c78bc22be49aa2f271284fdc95ef","abstract_canon_sha256":"96fc1a3cbb614b4aa3dbd93e2bade488abb0ae817bc8159fca980fb88b3d7367"},"schema_version":"1.0"},"canonical_sha256":"a63605891f8b47287fe84409bf3dedf8b97a12454f3fb54d80368d6af566f576","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:22.337869Z","signature_b64":"lDgcbaTe2DvC5dP3nTdID8i3wehIqD7CPNV85LpfY61Mcm9sdW0lSdu8kLv1vgDq7GokbEF1bxbhHEvxi5v6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a63605891f8b47287fe84409bf3dedf8b97a12454f3fb54d80368d6af566f576","last_reissued_at":"2026-05-18T00:22:22.337338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:22.337338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09751","source_version":1,"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:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v9j8bO3eofQZJYLoz6AZPDxY0M0EVYa7Kn9ihSI4bUy9E871mQ2txmeItuNpE5T6rQyjzVhJcUEHztKYadCNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T12:48:40.092323Z"},"content_sha256":"2e85b5147be9f8ffbfc263165fdf7f18ad4568f971d2c8444a8e1432a69d6556","schema_version":"1.0","event_id":"sha256:2e85b5147be9f8ffbfc263165fdf7f18ad4568f971d2c8444a8e1432a69d6556"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UY3ALCI7RNDSQ77IIQE36PPN7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Binary Search For Split-Neighborly Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Percy Liang, Stephen Mussmann","submitted_at":"2018-02-27T07:30:32Z","abstract_excerpt":"In sequential hypothesis testing, Generalized Binary Search (GBS) greedily chooses the test with the highest information gain at each step. It is known that GBS obtains the gold standard query cost of $O(\\log n)$ for problems satisfying the $k$-neighborly condition, which requires any two tests to be connected by a sequence of tests where neighboring tests disagree on at most $k$ hypotheses. In this paper, we introduce a weaker condition, split-neighborly, which requires that for the set of hypotheses two neighbors disagree on, any subset is splittable by some test. For four problems that are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09751","kind":"arxiv","version":1},"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:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAyA1BmizBQ47IsB0xrR6qEH3q1BYOzVV5I3uG3W7sQ67hLbEXNb28FXwSaAAVLZgglf/owbRF0/bOmpn2KXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T12:48:40.092666Z"},"content_sha256":"dfb3eadafa2e7cdbb872d6add3d563312ca5e9550e20899482e6c0b424752996","schema_version":"1.0","event_id":"sha256:dfb3eadafa2e7cdbb872d6add3d563312ca5e9550e20899482e6c0b424752996"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UY3ALCI7RNDSQ77IIQE36PPN7C/bundle.json","state_url":"https://pith.science/pith/UY3ALCI7RNDSQ77IIQE36PPN7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UY3ALCI7RNDSQ77IIQE36PPN7C/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-07-04T12:48:40Z","links":{"resolver":"https://pith.science/pith/UY3ALCI7RNDSQ77IIQE36PPN7C","bundle":"https://pith.science/pith/UY3ALCI7RNDSQ77IIQE36PPN7C/bundle.json","state":"https://pith.science/pith/UY3ALCI7RNDSQ77IIQE36PPN7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UY3ALCI7RNDSQ77IIQE36PPN7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UY3ALCI7RNDSQ77IIQE36PPN7C","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":"96fc1a3cbb614b4aa3dbd93e2bade488abb0ae817bc8159fca980fb88b3d7367","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-02-27T07:30:32Z","title_canon_sha256":"9f11df5e26aa3449edf68f5d226044d83e72c78bc22be49aa2f271284fdc95ef"},"schema_version":"1.0","source":{"id":"1802.09751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09751","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09751v1","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09751","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"UY3ALCI7RNDS","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UY3ALCI7RNDSQ77I","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UY3ALCI7","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:dfb3eadafa2e7cdbb872d6add3d563312ca5e9550e20899482e6c0b424752996","target":"graph","created_at":"2026-05-18T00:22:22Z","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 sequential hypothesis testing, Generalized Binary Search (GBS) greedily chooses the test with the highest information gain at each step. It is known that GBS obtains the gold standard query cost of $O(\\log n)$ for problems satisfying the $k$-neighborly condition, which requires any two tests to be connected by a sequence of tests where neighboring tests disagree on at most $k$ hypotheses. In this paper, we introduce a weaker condition, split-neighborly, which requires that for the set of hypotheses two neighbors disagree on, any subset is splittable by some test. For four problems that are ","authors_text":"Percy Liang, Stephen Mussmann","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-02-27T07:30:32Z","title":"Generalized Binary Search For Split-Neighborly Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09751","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:2e85b5147be9f8ffbfc263165fdf7f18ad4568f971d2c8444a8e1432a69d6556","target":"record","created_at":"2026-05-18T00:22:22Z","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":"96fc1a3cbb614b4aa3dbd93e2bade488abb0ae817bc8159fca980fb88b3d7367","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-02-27T07:30:32Z","title_canon_sha256":"9f11df5e26aa3449edf68f5d226044d83e72c78bc22be49aa2f271284fdc95ef"},"schema_version":"1.0","source":{"id":"1802.09751","kind":"arxiv","version":1}},"canonical_sha256":"a63605891f8b47287fe84409bf3dedf8b97a12454f3fb54d80368d6af566f576","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a63605891f8b47287fe84409bf3dedf8b97a12454f3fb54d80368d6af566f576","first_computed_at":"2026-05-18T00:22:22.337338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:22.337338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lDgcbaTe2DvC5dP3nTdID8i3wehIqD7CPNV85LpfY61Mcm9sdW0lSdu8kLv1vgDq7GokbEF1bxbhHEvxi5v6DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:22.337869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e85b5147be9f8ffbfc263165fdf7f18ad4568f971d2c8444a8e1432a69d6556","sha256:dfb3eadafa2e7cdbb872d6add3d563312ca5e9550e20899482e6c0b424752996"],"state_sha256":"8929e728bd1d68321904f25abff6412f978104be0be92beaa7909e77848f3673"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdUE15VIx9OBwMOz+lGvoaqDUTVJ69NCQXrgS7o0W2VvgnBIoy173mUbsZAYRXvdUNq7R/TVnT0d7cSfGwoHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T12:48:40.094548Z","bundle_sha256":"98531f334dc058428ac7d061ed3fba6ee49bb76039958dd35d2a9f44d7a78b52"}}