{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JCJRPVLJYIJZI3JVGLMIZ6KDSY","short_pith_number":"pith:JCJRPVLJ","canonical_record":{"source":{"id":"1509.09011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-30T04:36:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"560b904245b1ca21515806df3cc28a6067bf1fdad80ef03084baeb3b9c65bd20","abstract_canon_sha256":"a43f42a52f18a9ea77915d2a748d15de03bf917db1d4c75c22c4cef29c74e12b"},"schema_version":"1.0"},"canonical_sha256":"489317d569c213946d3532d88cf943961872b047a940c8e28b60af644ceaa88b","source":{"kind":"arxiv","id":"1509.09011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09011","created_at":"2026-05-18T01:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09011v1","created_at":"2026-05-18T01:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09011","created_at":"2026-05-18T01:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"JCJRPVLJYIJZ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JCJRPVLJYIJZI3JV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JCJRPVLJ","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JCJRPVLJYIJZI3JVGLMIZ6KDSY","target":"record","payload":{"canonical_record":{"source":{"id":"1509.09011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-30T04:36:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"560b904245b1ca21515806df3cc28a6067bf1fdad80ef03084baeb3b9c65bd20","abstract_canon_sha256":"a43f42a52f18a9ea77915d2a748d15de03bf917db1d4c75c22c4cef29c74e12b"},"schema_version":"1.0"},"canonical_sha256":"489317d569c213946d3532d88cf943961872b047a940c8e28b60af644ceaa88b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:29.325810Z","signature_b64":"PrseM18+s1dzivpXPrnoeQkm57MuW5Vp45gxaOvkGYwpfalYGHXe7ipHA+pRakiI8OxjTQ9gEVpogNvOJlVcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"489317d569c213946d3532d88cf943961872b047a940c8e28b60af644ceaa88b","last_reissued_at":"2026-05-18T01:31:29.325383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:29.325383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.09011","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-18T01:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHwA9asznlgX00ZnMT6bM70FYxN2BFYKeQcWKXhYKkBm+BelyNbci/mQRv5cAGWmwKmUh2odtuCAPV3E0lghBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:05:21.644004Z"},"content_sha256":"fc7f90d71ff482d9e7318c18302b8027bb0b0fac0c311b36034f0fb4c2c8902f","schema_version":"1.0","event_id":"sha256:fc7f90d71ff482d9e7318c18302b8027bb0b0fac0c311b36034f0fb4c2c8902f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JCJRPVLJYIJZI3JVGLMIZ6KDSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hiroshi Nakagawa, Junpei Komiyama, Junya Honda","submitted_at":"2015-09-30T04:36:40Z","abstract_excerpt":"Partial monitoring is a general model for sequential learning with limited feedback formalized as a game between two players. In this game, the learner chooses an action and at the same time the opponent chooses an outcome, then the learner suffers a loss and receives a feedback signal. The goal of the learner is to minimize the total loss. In this paper, we study partial monitoring with finite actions and stochastic outcomes. We derive a logarithmic distribution-dependent regret lower bound that defines the hardness of the problem. Inspired by the DMED algorithm (Honda and Takemura, 2010) for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09011","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-18T01:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qTktRl5MY99s/NM4n4VvkpGw7CWn9UIGE6E5uHDNnrcTbxad1HajRIx5ZvC59Ra3M9Kjnpwnd2wUwJUfc99AAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:05:21.644717Z"},"content_sha256":"715ed200b8fe47fc174c2df4c7aadcd8a2965b5cad12c2b3ef8178312c13a5b5","schema_version":"1.0","event_id":"sha256:715ed200b8fe47fc174c2df4c7aadcd8a2965b5cad12c2b3ef8178312c13a5b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCJRPVLJYIJZI3JVGLMIZ6KDSY/bundle.json","state_url":"https://pith.science/pith/JCJRPVLJYIJZI3JVGLMIZ6KDSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCJRPVLJYIJZI3JVGLMIZ6KDSY/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-07T09:05:21Z","links":{"resolver":"https://pith.science/pith/JCJRPVLJYIJZI3JVGLMIZ6KDSY","bundle":"https://pith.science/pith/JCJRPVLJYIJZI3JVGLMIZ6KDSY/bundle.json","state":"https://pith.science/pith/JCJRPVLJYIJZI3JVGLMIZ6KDSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCJRPVLJYIJZI3JVGLMIZ6KDSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JCJRPVLJYIJZI3JVGLMIZ6KDSY","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":"a43f42a52f18a9ea77915d2a748d15de03bf917db1d4c75c22c4cef29c74e12b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-30T04:36:40Z","title_canon_sha256":"560b904245b1ca21515806df3cc28a6067bf1fdad80ef03084baeb3b9c65bd20"},"schema_version":"1.0","source":{"id":"1509.09011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09011","created_at":"2026-05-18T01:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09011v1","created_at":"2026-05-18T01:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09011","created_at":"2026-05-18T01:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"JCJRPVLJYIJZ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JCJRPVLJYIJZI3JV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JCJRPVLJ","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:715ed200b8fe47fc174c2df4c7aadcd8a2965b5cad12c2b3ef8178312c13a5b5","target":"graph","created_at":"2026-05-18T01:31:29Z","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":"Partial monitoring is a general model for sequential learning with limited feedback formalized as a game between two players. In this game, the learner chooses an action and at the same time the opponent chooses an outcome, then the learner suffers a loss and receives a feedback signal. The goal of the learner is to minimize the total loss. In this paper, we study partial monitoring with finite actions and stochastic outcomes. We derive a logarithmic distribution-dependent regret lower bound that defines the hardness of the problem. Inspired by the DMED algorithm (Honda and Takemura, 2010) for","authors_text":"Hiroshi Nakagawa, Junpei Komiyama, Junya Honda","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-30T04:36:40Z","title":"Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09011","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:fc7f90d71ff482d9e7318c18302b8027bb0b0fac0c311b36034f0fb4c2c8902f","target":"record","created_at":"2026-05-18T01:31:29Z","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":"a43f42a52f18a9ea77915d2a748d15de03bf917db1d4c75c22c4cef29c74e12b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-30T04:36:40Z","title_canon_sha256":"560b904245b1ca21515806df3cc28a6067bf1fdad80ef03084baeb3b9c65bd20"},"schema_version":"1.0","source":{"id":"1509.09011","kind":"arxiv","version":1}},"canonical_sha256":"489317d569c213946d3532d88cf943961872b047a940c8e28b60af644ceaa88b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"489317d569c213946d3532d88cf943961872b047a940c8e28b60af644ceaa88b","first_computed_at":"2026-05-18T01:31:29.325383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:29.325383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PrseM18+s1dzivpXPrnoeQkm57MuW5Vp45gxaOvkGYwpfalYGHXe7ipHA+pRakiI8OxjTQ9gEVpogNvOJlVcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:29.325810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.09011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc7f90d71ff482d9e7318c18302b8027bb0b0fac0c311b36034f0fb4c2c8902f","sha256:715ed200b8fe47fc174c2df4c7aadcd8a2965b5cad12c2b3ef8178312c13a5b5"],"state_sha256":"0441539876a38ca29c8961454f0a46d9e5f6ca7a3a3eca705412ded7a8bbb86f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiNVMl3OPKAhfyHeM5UtzuEl0eqW6tb2NC36Db/0pGSdJKzPOucqKviI1bVSkWbocEaYNfz4OA+cz72QwsnFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:05:21.648454Z","bundle_sha256":"b797da0b3e096401b1c3fda204c2d9d89c1cd73b520a76b37766169076531b9e"}}