{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GW3KVPPJECFJ2XCGN7WN635MUR","short_pith_number":"pith:GW3KVPPJ","canonical_record":{"source":{"id":"2303.07154","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-13T14:28:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a2a95d25f290489dc42df5f4117fcb4ee09ec472944b6798e15a1fbf9eeb2139","abstract_canon_sha256":"a3264f3df8cefa3531c3e93b8da135e071a9235764130b9443ac738a26298f04"},"schema_version":"1.0"},"canonical_sha256":"35b6aabde9208a9d5c466fecdf6faca4577e1e75c30e384f315fe8d7a3739636","source":{"kind":"arxiv","id":"2303.07154","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.07154","created_at":"2026-07-05T07:45:45Z"},{"alias_kind":"arxiv_version","alias_value":"2303.07154v3","created_at":"2026-07-05T07:45:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.07154","created_at":"2026-07-05T07:45:45Z"},{"alias_kind":"pith_short_12","alias_value":"GW3KVPPJECFJ","created_at":"2026-07-05T07:45:45Z"},{"alias_kind":"pith_short_16","alias_value":"GW3KVPPJECFJ2XCG","created_at":"2026-07-05T07:45:45Z"},{"alias_kind":"pith_short_8","alias_value":"GW3KVPPJ","created_at":"2026-07-05T07:45:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GW3KVPPJECFJ2XCGN7WN635MUR","target":"record","payload":{"canonical_record":{"source":{"id":"2303.07154","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-13T14:28:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a2a95d25f290489dc42df5f4117fcb4ee09ec472944b6798e15a1fbf9eeb2139","abstract_canon_sha256":"a3264f3df8cefa3531c3e93b8da135e071a9235764130b9443ac738a26298f04"},"schema_version":"1.0"},"canonical_sha256":"35b6aabde9208a9d5c466fecdf6faca4577e1e75c30e384f315fe8d7a3739636","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:45.680329Z","signature_b64":"FXkWide+tKqR77ukFa9o5ecoXf4RJeuadf6twPO1k0l5xOUDwH/X0kPFKAnFuRx3rH8HSRJPgH05lFT+xfN6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35b6aabde9208a9d5c466fecdf6faca4577e1e75c30e384f315fe8d7a3739636","last_reissued_at":"2026-07-05T07:45:45.679836Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:45.679836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.07154","source_version":3,"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-07-05T07:45:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WCPRePhn4+wE9rzydHy+XZ0UGs2kjrpb4AH0dpPjqbqSvIs4iNSTmEWOxDL4F52Mhr5D95AK/vOnRtK4lUbTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:39:56.766573Z"},"content_sha256":"90320e8f1dd2a20088cdf099159b7bba9f5b57e3c0e366ffd0907e02e98bdd17","schema_version":"1.0","event_id":"sha256:90320e8f1dd2a20088cdf099159b7bba9f5b57e3c0e366ffd0907e02e98bdd17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GW3KVPPJECFJ2XCGN7WN635MUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differential Good Arm Identification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shou-De Lin, Tzu-Hsien Tsai, Yun-Da Tsai","submitted_at":"2023-03-13T14:28:21Z","abstract_excerpt":"This paper targets a variant of the stochastic multi-armed bandit problem called good arm identification (GAI). GAI is a pure-exploration bandit problem with the goal to output as many good arms using as few samples as possible, where a good arm is defined as an arm whose expected reward is greater than a given threshold. In this work, we propose DGAI - a differentiable good arm identification algorithm to improve the sample complexity of the state-of-the-art HDoC algorithm in a data-driven fashion. We also showed that the DGAI can further boost the performance of a general multi-arm bandit (M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.07154","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.07154/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:45:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ec0cbYbD2rCLda2hYCod/NI2ojz+5wD0iXME35mbOFI+Fhks1W3UZyaKyxDXddaxsNKYDhg7R9y+adVV7wE9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:39:56.767147Z"},"content_sha256":"7a5720f097351e75b5f6700894a7bcab0b6ecb0eafcfcd3a9b70e3c7d96ab9b0","schema_version":"1.0","event_id":"sha256:7a5720f097351e75b5f6700894a7bcab0b6ecb0eafcfcd3a9b70e3c7d96ab9b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GW3KVPPJECFJ2XCGN7WN635MUR/bundle.json","state_url":"https://pith.science/pith/GW3KVPPJECFJ2XCGN7WN635MUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GW3KVPPJECFJ2XCGN7WN635MUR/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-08-23T08:39:56Z","links":{"resolver":"https://pith.science/pith/GW3KVPPJECFJ2XCGN7WN635MUR","bundle":"https://pith.science/pith/GW3KVPPJECFJ2XCGN7WN635MUR/bundle.json","state":"https://pith.science/pith/GW3KVPPJECFJ2XCGN7WN635MUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GW3KVPPJECFJ2XCGN7WN635MUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GW3KVPPJECFJ2XCGN7WN635MUR","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":"a3264f3df8cefa3531c3e93b8da135e071a9235764130b9443ac738a26298f04","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-13T14:28:21Z","title_canon_sha256":"a2a95d25f290489dc42df5f4117fcb4ee09ec472944b6798e15a1fbf9eeb2139"},"schema_version":"1.0","source":{"id":"2303.07154","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.07154","created_at":"2026-07-05T07:45:45Z"},{"alias_kind":"arxiv_version","alias_value":"2303.07154v3","created_at":"2026-07-05T07:45:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.07154","created_at":"2026-07-05T07:45:45Z"},{"alias_kind":"pith_short_12","alias_value":"GW3KVPPJECFJ","created_at":"2026-07-05T07:45:45Z"},{"alias_kind":"pith_short_16","alias_value":"GW3KVPPJECFJ2XCG","created_at":"2026-07-05T07:45:45Z"},{"alias_kind":"pith_short_8","alias_value":"GW3KVPPJ","created_at":"2026-07-05T07:45:45Z"}],"graph_snapshots":[{"event_id":"sha256:7a5720f097351e75b5f6700894a7bcab0b6ecb0eafcfcd3a9b70e3c7d96ab9b0","target":"graph","created_at":"2026-07-05T07:45:45Z","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/2303.07154/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper targets a variant of the stochastic multi-armed bandit problem called good arm identification (GAI). GAI is a pure-exploration bandit problem with the goal to output as many good arms using as few samples as possible, where a good arm is defined as an arm whose expected reward is greater than a given threshold. In this work, we propose DGAI - a differentiable good arm identification algorithm to improve the sample complexity of the state-of-the-art HDoC algorithm in a data-driven fashion. We also showed that the DGAI can further boost the performance of a general multi-arm bandit (M","authors_text":"Shou-De Lin, Tzu-Hsien Tsai, Yun-Da Tsai","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-13T14:28:21Z","title":"Differential Good Arm Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.07154","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:90320e8f1dd2a20088cdf099159b7bba9f5b57e3c0e366ffd0907e02e98bdd17","target":"record","created_at":"2026-07-05T07:45:45Z","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":"a3264f3df8cefa3531c3e93b8da135e071a9235764130b9443ac738a26298f04","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-13T14:28:21Z","title_canon_sha256":"a2a95d25f290489dc42df5f4117fcb4ee09ec472944b6798e15a1fbf9eeb2139"},"schema_version":"1.0","source":{"id":"2303.07154","kind":"arxiv","version":3}},"canonical_sha256":"35b6aabde9208a9d5c466fecdf6faca4577e1e75c30e384f315fe8d7a3739636","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35b6aabde9208a9d5c466fecdf6faca4577e1e75c30e384f315fe8d7a3739636","first_computed_at":"2026-07-05T07:45:45.679836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:45:45.679836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FXkWide+tKqR77ukFa9o5ecoXf4RJeuadf6twPO1k0l5xOUDwH/X0kPFKAnFuRx3rH8HSRJPgH05lFT+xfN6Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:45:45.680329Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.07154","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90320e8f1dd2a20088cdf099159b7bba9f5b57e3c0e366ffd0907e02e98bdd17","sha256:7a5720f097351e75b5f6700894a7bcab0b6ecb0eafcfcd3a9b70e3c7d96ab9b0"],"state_sha256":"0287db4369ec36a5515b20258f84099c4d5a95ea5614b66c58cab4622c999e65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnXxHbqiyYkY9xAH/ZcU9Epr/Ii7uVA/Wv+K3KBBWV7Ytyr7VYLwryoIe6CS8INQHYMxsOwJCkV7AE1etLUgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T08:39:56.771139Z","bundle_sha256":"3cd62a665d366cadc095e1484273f5355d6682a7082e5da214ac47ab70fa61d6"}}