{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FP46IBSKNFH26LUFCW3AE25HU2","short_pith_number":"pith:FP46IBSK","canonical_record":{"source":{"id":"2006.00661","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-01T01:28:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6468865d6608dc441f95f07f8a2ffc869e2be6aba35394525933d3e9edb49d59","abstract_canon_sha256":"245d8199d50d12be323316b9e4167eb47f598cfe7af72bbc1ca5aae7f72a4965"},"schema_version":"1.0"},"canonical_sha256":"2bf9e4064a694faf2e8515b6026ba7a685da3f1164529b29a374163e4e1b7929","source":{"kind":"arxiv","id":"2006.00661","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.00661","created_at":"2026-07-05T02:26:48Z"},{"alias_kind":"arxiv_version","alias_value":"2006.00661v5","created_at":"2026-07-05T02:26:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00661","created_at":"2026-07-05T02:26:48Z"},{"alias_kind":"pith_short_12","alias_value":"FP46IBSKNFH2","created_at":"2026-07-05T02:26:48Z"},{"alias_kind":"pith_short_16","alias_value":"FP46IBSKNFH26LUF","created_at":"2026-07-05T02:26:48Z"},{"alias_kind":"pith_short_8","alias_value":"FP46IBSK","created_at":"2026-07-05T02:26:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FP46IBSKNFH26LUFCW3AE25HU2","target":"record","payload":{"canonical_record":{"source":{"id":"2006.00661","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-01T01:28:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6468865d6608dc441f95f07f8a2ffc869e2be6aba35394525933d3e9edb49d59","abstract_canon_sha256":"245d8199d50d12be323316b9e4167eb47f598cfe7af72bbc1ca5aae7f72a4965"},"schema_version":"1.0"},"canonical_sha256":"2bf9e4064a694faf2e8515b6026ba7a685da3f1164529b29a374163e4e1b7929","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:48.336754Z","signature_b64":"7FtFlhJ6Ciaa5l9cX8+wl9Ho4c0YsamfF2Ow93+OipZqTwr++YM2yS9SOk5vNVMER5NXyVUHZPY/j0JMbSukCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bf9e4064a694faf2e8515b6026ba7a685da3f1164529b29a374163e4e1b7929","last_reissued_at":"2026-07-05T02:26:48.336303Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:48.336303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.00661","source_version":5,"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-05T02:26:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhRSbDSLjmkMPmnr+rvyOnXDr8A0Zzx+MHAg4CdFIhfiIOIlwotxza5dudsWxWZEyNKZt2AqBFXmcxPnZVWQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T05:25:40.623089Z"},"content_sha256":"87c5c196b9f2164e0c5bc65ad4bf943ef89501c6e410e85109e328c6b157aafd","schema_version":"1.0","event_id":"sha256:87c5c196b9f2164e0c5bc65ad4bf943ef89501c6e410e85109e328c6b157aafd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FP46IBSKNFH26LUFCW3AE25HU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Submodular Bandit Problem Under Multiple Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Janmajay Singh, Masahiro Sato, Sho Takemori, Takashi Sonoda, Tomoko Ohkuma","submitted_at":"2020-06-01T01:28:44Z","abstract_excerpt":"The linear submodular bandit problem was proposed to simultaneously address diversified retrieval and online learning in a recommender system. If there is no uncertainty, this problem is equivalent to a submodular maximization problem under a cardinality constraint. However, in some situations, recommendation lists should satisfy additional constraints such as budget constraints, other than a cardinality constraint. Thus, motivated by diversified retrieval considering budget constraints, we introduce a submodular bandit problem under the intersection of $l$ knapsacks and a $k$-system constrain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00661","kind":"arxiv","version":5},"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/2006.00661/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-05T02:26:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gv6cmwvAYp+yKV2qrgDCgFeihw6tOlBa/KBb0uR0F8G4RGbHFnWNMR0ZrGKQdtp2/x1zzSV/VcMzsBnR1NWrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T05:25:40.623463Z"},"content_sha256":"3aeda71b008db3a49d36345bce7a6549597a5288ad62aee30df68fbc7696d6e3","schema_version":"1.0","event_id":"sha256:3aeda71b008db3a49d36345bce7a6549597a5288ad62aee30df68fbc7696d6e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FP46IBSKNFH26LUFCW3AE25HU2/bundle.json","state_url":"https://pith.science/pith/FP46IBSKNFH26LUFCW3AE25HU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FP46IBSKNFH26LUFCW3AE25HU2/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-18T05:25:40Z","links":{"resolver":"https://pith.science/pith/FP46IBSKNFH26LUFCW3AE25HU2","bundle":"https://pith.science/pith/FP46IBSKNFH26LUFCW3AE25HU2/bundle.json","state":"https://pith.science/pith/FP46IBSKNFH26LUFCW3AE25HU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FP46IBSKNFH26LUFCW3AE25HU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FP46IBSKNFH26LUFCW3AE25HU2","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":"245d8199d50d12be323316b9e4167eb47f598cfe7af72bbc1ca5aae7f72a4965","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-01T01:28:44Z","title_canon_sha256":"6468865d6608dc441f95f07f8a2ffc869e2be6aba35394525933d3e9edb49d59"},"schema_version":"1.0","source":{"id":"2006.00661","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.00661","created_at":"2026-07-05T02:26:48Z"},{"alias_kind":"arxiv_version","alias_value":"2006.00661v5","created_at":"2026-07-05T02:26:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00661","created_at":"2026-07-05T02:26:48Z"},{"alias_kind":"pith_short_12","alias_value":"FP46IBSKNFH2","created_at":"2026-07-05T02:26:48Z"},{"alias_kind":"pith_short_16","alias_value":"FP46IBSKNFH26LUF","created_at":"2026-07-05T02:26:48Z"},{"alias_kind":"pith_short_8","alias_value":"FP46IBSK","created_at":"2026-07-05T02:26:48Z"}],"graph_snapshots":[{"event_id":"sha256:3aeda71b008db3a49d36345bce7a6549597a5288ad62aee30df68fbc7696d6e3","target":"graph","created_at":"2026-07-05T02:26:48Z","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/2006.00661/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The linear submodular bandit problem was proposed to simultaneously address diversified retrieval and online learning in a recommender system. If there is no uncertainty, this problem is equivalent to a submodular maximization problem under a cardinality constraint. However, in some situations, recommendation lists should satisfy additional constraints such as budget constraints, other than a cardinality constraint. Thus, motivated by diversified retrieval considering budget constraints, we introduce a submodular bandit problem under the intersection of $l$ knapsacks and a $k$-system constrain","authors_text":"Janmajay Singh, Masahiro Sato, Sho Takemori, Takashi Sonoda, Tomoko Ohkuma","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-01T01:28:44Z","title":"Submodular Bandit Problem Under Multiple Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00661","kind":"arxiv","version":5},"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:87c5c196b9f2164e0c5bc65ad4bf943ef89501c6e410e85109e328c6b157aafd","target":"record","created_at":"2026-07-05T02:26:48Z","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":"245d8199d50d12be323316b9e4167eb47f598cfe7af72bbc1ca5aae7f72a4965","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-01T01:28:44Z","title_canon_sha256":"6468865d6608dc441f95f07f8a2ffc869e2be6aba35394525933d3e9edb49d59"},"schema_version":"1.0","source":{"id":"2006.00661","kind":"arxiv","version":5}},"canonical_sha256":"2bf9e4064a694faf2e8515b6026ba7a685da3f1164529b29a374163e4e1b7929","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bf9e4064a694faf2e8515b6026ba7a685da3f1164529b29a374163e4e1b7929","first_computed_at":"2026-07-05T02:26:48.336303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:26:48.336303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7FtFlhJ6Ciaa5l9cX8+wl9Ho4c0YsamfF2Ow93+OipZqTwr++YM2yS9SOk5vNVMER5NXyVUHZPY/j0JMbSukCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:26:48.336754Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.00661","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87c5c196b9f2164e0c5bc65ad4bf943ef89501c6e410e85109e328c6b157aafd","sha256:3aeda71b008db3a49d36345bce7a6549597a5288ad62aee30df68fbc7696d6e3"],"state_sha256":"af67fb08da0d368a5c6633169900cf2c1de5ff2c86dec08f5bcfa575df47cacb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ejn40Au2qOJSNE2BBZ4hEOaq+Qbat8vwzVfqx9A1neVYnKM9FJMjBtPswJr8hOOEkl1BimDgPATKvy7vKlyCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T05:25:40.625939Z","bundle_sha256":"f895db48349080108f60735ba9e27f536e226e0c8833e4982f5cdb4edcc02ac5"}}