{"as_of":"2026-08-13T13:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:510aa7f050d578a9212f2cb2f14eadb86d36f78319f3709c74d20ed1cbf0cdcc","coverage":[{"denominator":300,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T04:35:03.214200Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.13686/citation-record","integrity":"/paper/2607.13686/integrity","json":"/paper/2607.13686/citation-record.json","paper":"/paper/2607.13686"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:52.011448Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:52.011448Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:3c5884323e52ee32bbe83392b0669f92c06726e29e83249757d81e95bb1baa70","observation_id":"fb272ead-da0f-4c22-a035-ee175df69803","resolution":{"observed_at":"2026-08-02T04:34:52.011448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:52.122438Z","title":"1933 , journal =","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:52.122438Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:6bbf4562c2ad3c4a51545ba75a6c6fd84a16e41691b1bcf9b0b56e22cc7fcc7c","observation_id":"ed4ac562-878e-400c-9039-da3201adb163","resolution":{"observed_at":"2026-08-02T04:34:52.122438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:52.249949Z","title":", year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:52.249949Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:050b22f2c49e8d52b5578d8f5dacea4d40279d896bc7636683c12b756cb326f7","observation_id":"660bb325-2487-432b-92b5-72107b7baa16","resolution":{"observed_at":"2026-08-02T04:34:52.249949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:52.363942Z","title":"1936 , journal =","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:52.363942Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:aadeef38a094898f66923ebfe3bb702f6a63e9bdd238d5e622fb2ade5b4de9cd","observation_id":"8b344e90-5591-4492-afdb-806833c26f63","resolution":{"observed_at":"2026-08-02T04:34:52.363942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:52.536746Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:52.536746Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:f09df27dfca70d158fa26affaa1e32350710e0721fd5deee20e20b3740576472","observation_id":"f2a92f68-1105-4a7d-93d5-a633dc879414","resolution":{"observed_at":"2026-08-02T04:34:52.536746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:52.703232Z","title":"1952 , journal =","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:52.703232Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:bc88166dcd97f5013adc3863a76799b133f1c0c636c1e4a9eb76501d4cfd6b84","observation_id":"a303dac9-89a7-4725-974a-9d33267d7274","resolution":{"observed_at":"2026-08-02T04:34:52.703232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:52.885962Z","title":"Journal of the American statistical Association , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:52.885962Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:5e2e83354fded3a19f8d059d098170c5d8a4d7bc6c2f801f7136354347c9b700","observation_id":"3bdf674b-535c-4324-bfe7-aacbd98f45e2","resolution":{"observed_at":"2026-08-02T04:34:52.885962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:53.040970Z","title":"Biometrika , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:53.040970Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:5cc405315d7512a80dc2558fc9b602a949c09a062f4ec6eccacb3f6d4694320d","observation_id":"83158c46-fc95-41a9-b0fc-c3ada44b2718","resolution":{"observed_at":"2026-08-02T04:34:53.040970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:53.184308Z","title":"Biometrika , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:53.184308Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:24079c04411e8eb0d8f4f36fee724f940052ea55bc1276355bde8b5601b5ba9f","observation_id":"f0178777-c5b0-4081-8e3c-4951fbb193f4","resolution":{"observed_at":"2026-08-02T04:34:53.184308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:53.334681Z","title":"The Bell System Technical Journal , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:53.334681Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:5b1163ed35c999fbd780aa6e0c05ee25983e8bbe171a985f28f7dfc7b97d9ba4","observation_id":"c80e661c-16a2-414e-bc07-41c75054a003","resolution":{"observed_at":"2026-08-02T04:34:53.334681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:53.506060Z","title":"Biometrics , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:53.506060Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:78c1aaff503bb1e0b13226c98b92d421c59179faccd57fe23d75936c765651e4","observation_id":"e9e4f801-8c48-43b1-a0bb-aecbe48d23b1","resolution":{"observed_at":"2026-08-02T04:34:53.506060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:53.698796Z","title":"The Annals of Mathematical Statistics , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:53.698796Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:effd87f526dd3ca5ea80087149d9b971e3bf089a8474d1abdd94560ed975feb5","observation_id":"5e1677a7-5e3d-4d11-ae18-bc665c0de5e0","resolution":{"observed_at":"2026-08-02T04:34:53.698796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:53.913829Z","title":"Canadian Journal of Mathematics , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:53.913829Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:a19977bb22e72246e23b3f2863aade257ba386b8cb572fcd65a0437b6700db4e","observation_id":"649c0ea9-a043-48b3-9585-d73dcb3a6e4e","resolution":{"observed_at":"2026-08-02T04:34:53.913829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:54.118813Z","title":"Journal of the American Statistical Association , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:54.118813Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:be5b49a86e317a49a8aa53204a667cf0aa262df8d3a22081489f18f2fe97de92","observation_id":"ef42ecf5-0dfd-4b10-ad91-95f79910f176","resolution":{"observed_at":"2026-08-02T04:34:54.118813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:54.347698Z","title":"Annals of Mathematical Statistics , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:54.347698Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:41d721ee98d22c824a0e81d432db75e5617d599975259397ab7c365b5ecdf0ad","observation_id":"225bd5cb-0f66-4acc-a90f-233107df5cb6","resolution":{"observed_at":"2026-08-02T04:34:54.347698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:54.550081Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:54.550081Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:6dd9898788df00ce5b39ff260c4a3a834ca1caa95a2ba13d8907ce8c7063ae12","observation_id":"10f0298d-1e39-4962-ab04-187d688b454b","resolution":{"observed_at":"2026-08-02T04:34:54.550081Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:54.693214Z","title":"The Computer Journal , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:54.693214Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:ea0074520c571b638d8f109824d773652b3ffecb06f0d76888454e48f17f1ccb","observation_id":"bc42b728-0f0f-455f-a4d4-b7eb9b095129","resolution":{"observed_at":"2026-08-02T04:34:54.693214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:54.812947Z","title":"Journal of the Royal Statistical Society: Series B (Methodological) , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:54.812947Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:a4855582167b5effe1df549d0651fe6b93fec0c68785f07f41c8f1a98a94ca6a","observation_id":"7ad70223-08b5-4c2c-8d74-04d5a324f984","resolution":{"observed_at":"2026-08-02T04:34:54.812947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:54.947835Z","title":"IEEE Trans","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:54.947835Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:016b4f9b743a574590cb820783153ba1fb25e6dcf5010a2c171121a064b291a5","observation_id":"34ea5039-8fdb-4ca8-9dc4-055b24b11e2c","resolution":{"observed_at":"2026-08-02T04:34:54.947835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:55.093538Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:55.093538Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:bdfbf0ecabc360cc093402e99ea7083b38cc2f440ff0f090cc53484ded247da1","observation_id":"926bbb91-45bd-44bb-a220-5d8cff251c49","resolution":{"observed_at":"2026-08-02T04:34:55.093538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:55.212162Z","title":"1985 , journal =","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:55.212162Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:dff474dc898dfd3d21289516e6e5753de1b2667bc79b2834a5111f921dc22031","observation_id":"6856087e-9684-4ba1-90f4-f5c1b1ffe03b","resolution":{"observed_at":"2026-08-02T04:34:55.212162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:55.339586Z","title":"Advances in Applied Mathematics , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:55.339586Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:bfcfd5179a2826493a75d6dfdb147b38ef260a2262982bec96f4ed1fa26e8235","observation_id":"310be6dd-246f-4ab4-9661-f1d77210674a","resolution":{"observed_at":"2026-08-02T04:34:55.339586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:55.458534Z","title":"Automatic Control, IEEE Transactions on , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:55.458534Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:3f2aff8fb550ee32410f3f947ecee7018d66b3a6e5e3f75b5cce33da1dc68142","observation_id":"1e7afb7e-6328-4caa-bfdb-17990cf0082e","resolution":{"observed_at":"2026-08-02T04:34:55.458534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:55.594201Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:55.594201Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:36d83f9b1d30caedfe7e91653e0f8d037fb309a33c9ba03c3eb3a2c196d8d8b8","observation_id":"973b81c4-0b52-40be-9f2a-e6d157bc883f","resolution":{"observed_at":"2026-08-02T04:34:55.594201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:55.662061Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:55.662061Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:e236fce38bc604a685aacbd7fa4dcbf3c0c875f61e12efb5328197cf96d0616e","observation_id":"1408d8f8-14ff-45ac-bcff-94f7adfde9b7","resolution":{"observed_at":"2026-08-02T04:34:55.662061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:55.776948Z","title":"Proceedings of the Conference on Learning Theory (COLT) , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:55.776948Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:fd2052549fc51258dcb047874388cadcf7497cd16096e23acd60241f2d2dd678","observation_id":"e1d4fc11-c152-484d-b94f-75c862acae5a","resolution":{"observed_at":"2026-08-02T04:34:55.776948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:55.882517Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:55.882517Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:0a2579ad535f3bff6fc0e175345a786c1f9a7133759100b9c2ff930a7997db44","observation_id":"ca408267-3184-44e1-980b-72c09a55cbe2","resolution":{"observed_at":"2026-08-02T04:34:55.882517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:55.969807Z","title":"1990 , journal =","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:55.969807Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:b72e01ce5b868feda1212e6fde42077359a33ac848c6eb94f95bc86336db59e0","observation_id":"f660677b-9bc5-410c-b75b-cbb9c5715449","resolution":{"observed_at":"2026-08-02T04:34:55.969807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:56.077682Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligence , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:56.077682Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:70d9a70f75a1cd1c6f8c04cdddad779ad893b750ffff4a6ab409ff0f51ef4b0d","observation_id":"c59323d2-d386-4616-8e08-62be59e62a37","resolution":{"observed_at":"2026-08-02T04:34:56.077682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:56.203318Z","title":"Advances in Neural Information Processing Systems (NeurIPS) , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:56.203318Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:eab8f718f98a0641e53a8629c08d838da49870a283f3f2d4b30ee778359ad252","observation_id":"a2378398-e8bf-4d4f-b2ba-77121229fc1c","resolution":{"observed_at":"2026-08-02T04:34:56.203318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:56.262659Z","title":"NSF-CBMS regional conference series in probability and statistics , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:56.262659Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:76a3ae32811b922b66a23e53c21d5253f5aa12b4e71ebc3c83c9cd8e72c39e60","observation_id":"d7f05800-3d49-4a0e-b7cc-ed0c1375fbb5","resolution":{"observed_at":"2026-08-02T04:34:56.262659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:56.347783Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:56.347783Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:a81fe5118e36eb3e2e3189c7723cac0e3fcc44ae694a9756cb0580236858cfc2","observation_id":"ecf78f56-4e09-4881-a28e-0d9b3a3fb3dc","resolution":{"observed_at":"2026-08-02T04:34:56.347783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:56.403186Z","title":"Proceedings of the International Conference on Machine Learning (ICML) , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:56.403186Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:30b14f2e957637484181811ad789681b69b0e58917c12105c7147f2d04ad9b6b","observation_id":"53e605e9-54b5-4aca-bd69-735aa41c792e","resolution":{"observed_at":"2026-08-02T04:34:56.403186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:56.483941Z","title":"Journal of the Royal Statistical Society: Series B (Methodological) , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:56.483941Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:38ea9b22edc2fbfd0306a7adb722d2a69510efff6d04defe1bc33bad0981ac0a","observation_id":"0895fd6a-1c18-438c-9967-b2c7246cee7e","resolution":{"observed_at":"2026-08-02T04:34:56.483941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:56.600164Z","title":"Discrete","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:56.600164Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:6285f7005a2fd26c1b9e2c8a8eb4ea0c093a9f96b28b1ed79df83b9d527d56fa","observation_id":"acb399d6-4c19-48c1-8c81-931add4d1c6e","resolution":{"observed_at":"2026-08-02T04:34:56.600164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:56.724880Z","title":"1993 , journal =","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:56.724880Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:f10b9bee9f71e16e92335a009c32379cf9802d67fd6290252892a4dade1af6c0","observation_id":"589b20be-dba7-48bf-87b6-e5b5ad94b67e","resolution":{"observed_at":"2026-08-02T04:34:56.724880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:56.847120Z","title":"Biometrika , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:56.847120Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:fb9cbb5c723a7032c4f45a418af6c232281458660c18cd5a932949c91979c4c9","observation_id":"60103dbc-214d-4ea8-acb4-dccbcbaec467","resolution":{"observed_at":"2026-08-02T04:34:56.847120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:56.966510Z","title":"The Annals of Statistics , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:56.966510Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:db056f8e8358d4505dab371627a0123c764f78294d1f27f6d0691c6e37bd23e2","observation_id":"62258551-5958-479e-9d78-ae8f902b6ffb","resolution":{"observed_at":"2026-08-02T04:34:56.966510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:57.110257Z","title":"1994 , month =","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:57.110257Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:ae55bd371d8a1b26c09f3056260ef87dac510b3b0ce1723c18811073ac001c1f","observation_id":"e964e4d8-caa9-4d26-9822-843ff4ab26dc","resolution":{"observed_at":"2026-08-02T04:34:57.110257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:57.271352Z","title":"1994 , journal =","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:57.271352Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:8b4e091830f78d45fdc90ea3a6a0a3173ff9aa794b3c05d7e4490b838df4cc71","observation_id":"1f1ac1e7-3ad8-41a5-8eb8-90f34b1520a4","resolution":{"observed_at":"2026-08-02T04:34:57.271352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:57.457135Z","title":"SIAM journal on control and optimization , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:57.457135Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:b5a9dd0c941e6a211d3d9cb1c918b82f82e8e684705d6d42ac093114a58eac78","observation_id":"afd5db92-2581-4f84-9dec-2967f729e509","resolution":{"observed_at":"2026-08-02T04:34:57.457135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:57.591477Z","title":"Advances in Applied Probability , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:57.591477Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:891af8485eee305c9cec32baba27b71bb90192f4cbeb02364b976588c5c314d6","observation_id":"4f317565-cb3f-4171-afec-c81a65187e0c","resolution":{"observed_at":"2026-08-02T04:34:57.591477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:57.655958Z","title":"Journal of the American Statistical Association , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:57.655958Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:ea900f47f3904e3f4d2a4b62e6db75f7f84d90994babbb85ba0b09ae6fa4b37f","observation_id":"a59a4009-3c82-4639-be8e-6b16b6c66a5a","resolution":{"observed_at":"2026-08-02T04:34:57.655958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:57.707138Z","title":"Advances in Applied Mathematics , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:57.707138Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:d14f551eadea3a479bd3eeb4086ce33fb409e440dcd8b39344f827b19b8afec6","observation_id":"08f06e3c-fa07-41e6-87b3-2838bc1f3a78","resolution":{"observed_at":"2026-08-02T04:34:57.707138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:57.794490Z","title":"Journal of artificial intelligence research , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:57.794490Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:a71e6833946c90224e1396e5aad70de1b8d9f19dd82c5e6b0efec2ad0f2fa980","observation_id":"15623507-8349-4c6f-9342-3b871ad6da0c","resolution":{"observed_at":"2026-08-02T04:34:57.794490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:57.919755Z","title":"Mathematics of Operations Research , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:57.919755Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:fce2c4a983bbf0e8137baa731707dce265f78021d34f06d7579b0901e4afa78e","observation_id":"20de0dc0-6c04-43dd-accf-17f77d5ec6b0","resolution":{"observed_at":"2026-08-02T04:34:57.919755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:58.085646Z","title":"Journal of the Royal Statistical Society: Series B (Methodological) , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:58.085646Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:88376847ef6d0ae65fe89d104a6f670219ecfb9776e57ee33a69c522f3adf63f","observation_id":"d84c1934-c13f-4273-9d49-a9a1b25aebb8","resolution":{"observed_at":"2026-08-02T04:34:58.085646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:58.218324Z","title":"Machine Learning , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:58.218324Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:40f13f48dddccefa9efde5c2e4ad7896469d4d8d2238b00e1fba4b7a2fa0a55a","observation_id":"592c44c3-8a01-4f52-81a9-30d85c8e932d","resolution":{"observed_at":"2026-08-02T04:34:58.218324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:58.426083Z","title":"Proceedings of the ACM symposium on Theory of computing (STOC) , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:58.426083Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:c7953e47282526047bb77dfeaa7fe7b2e3ce230d539fbf3f44988b070bf887a0","observation_id":"c1f3982c-8573-4bfb-87d8-f16150849363","resolution":{"observed_at":"2026-08-02T04:34:58.426083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:58.538582Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:58.538582Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:e69a1a5b70d6330175dea45485abc7c1487fc826b805b4dc811d661fc1a3a23a","observation_id":"619d2603-2493-4058-8def-116598903c47","resolution":{"observed_at":"2026-08-02T04:34:58.538582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:58.660489Z","title":"Artificial Intelligence Review , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:58.660489Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:13bc161cdd9d91ecd5169dbdfdc4b273f8fa5df810b57c4af80dac56effb71a0","observation_id":"ebe248b5-3bd1-400b-a804-8aaca2559f9b","resolution":{"observed_at":"2026-08-02T04:34:58.660489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:58.806421Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:58.806421Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:3a7214df6dc2877779f95b6b84930d8a995a11250ced7c05a57817e4986284b8","observation_id":"5afa7866-9c0e-4335-a7a1-c66bfdba9ec4","resolution":{"observed_at":"2026-08-02T04:34:58.806421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:58.924088Z","title":"IEEE Transactions on Circuits and Systems for Video Technology , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:58.924088Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:e69a28e21025d739fa14c6afaaa44d78d321fddfdb01ac9e73e035bc3ae61d2a","observation_id":"4e8329aa-7533-4b6d-a723-4b6569c000f4","resolution":{"observed_at":"2026-08-02T04:34:58.924088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:59.054407Z","title":"1998 , booktitle =","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:59.054407Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:d2486fb20e80d00f3948eef91304e51adcb65b7460e85cc37392925023e86c9f","observation_id":"e029dad9-b182-486e-adaa-ac9f77a48e00","resolution":{"observed_at":"2026-08-02T04:34:59.054407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:59.193585Z","title":"1998 , publisher =","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:59.193585Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:d3e570cb686c9fb4930a9bd527238abd063c406778033bd86a499438897ba3a2","observation_id":"79c05781-9d3f-466d-a32b-063aaa7e4c75","resolution":{"observed_at":"2026-08-02T04:34:59.193585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:59.328742Z","title":"1999 , booktitle =","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:59.328742Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:fd913573517b559fdbd93c6d0e32cc3a7098ebe58d92d32d4dcf97e94df0ddd9","observation_id":"47bb23b3-4f68-4d29-b986-59bc45fef982","resolution":{"observed_at":"2026-08-02T04:34:59.328742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:59.440490Z","title":", year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:59.440490Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:5361d0fbaea4403c9b8ae3621041b72734e84fc2f8285fd7b77e3ed7fde962ac","observation_id":"18b275e1-c75f-4753-b2b1-12d9543232a5","resolution":{"observed_at":"2026-08-02T04:34:59.440490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:59.546492Z","title":"1999 , journal =","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:59.546492Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:2e7f0f280821652c92fc45037a5b010f04c6bf8dcbad57c2f65241d67f0ff256","observation_id":"67542938-6532-44c4-8de4-d0c20075ab65","resolution":{"observed_at":"2026-08-02T04:34:59.546492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:59.705572Z","title":"and Gallagher, Hanna Alix , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:59.705572Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:200151c26d9c18ca119a1a77e3fcd9bfbf03ad45408e826867aa6f03b90ba58f","observation_id":"27e30a7a-c48c-4014-bb86-43b82bd57fc0","resolution":{"observed_at":"2026-08-02T04:34:59.705572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:59.808238Z","title":"The Annals of Statistics , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:59.808238Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:b645ce2ceda8e8a048cbd43571f893ebf5f6ba436a6421d6d647a4fddf6f8b8b","observation_id":"e9793583-135f-4365-a714-22df2c0cf5c7","resolution":{"observed_at":"2026-08-02T04:34:59.808238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:34:59.916441Z","title":"1999 , booktitle =","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-02T04:34:59.916441Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:0000f505718f07bca70c48f908b348987ba7d47b573a7590efc1ed3cf9df824c","observation_id":"e4611e64-6d7a-4ca0-80e2-3dc4c48dbc0c","resolution":{"observed_at":"2026-08-02T04:34:59.916441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1023/a:1007595032382","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":", year =","venue":"Machine Learning","work_id":"1807f903-9be9-468f-ba90-40fc0be6da92","year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.023886Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:a5e063172ce112fe4b6eb58bc172d5820ce70d555c7a67958f73747e6902ffe2","observation_id":"7b9852d6-67e4-4631-aea6-9dda250b866c","resolution":{"observed_at":"2026-08-02T04:38:47.563676Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.088582Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.088582Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:feaeec19038e49f84eb16301b0590bc43645956dc5ab3b35e69e54ca43e7e4df","observation_id":"4fa375d5-acb0-4d8a-8e15-b976ddf2a2d1","resolution":{"observed_at":"2026-08-02T04:35:00.088582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.163148Z","title":", author =","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.163148Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:1d6001384987a163c357d81c639d6ca78b5d05e9d886c19c2239b3cf23d1d38a","observation_id":"cd9ec274-cda2-476f-afbb-75a6b426533e","resolution":{"observed_at":"2026-08-02T04:35:00.163148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.270247Z","title":"Proceedings of The International Conference on Machine Learning (ICML) , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.270247Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:c96af2c1d29d6b872f90d438c91352c89978ddf7544509fea2236fe8e0d7bc4b","observation_id":"d27e8928-6941-440c-b813-88bc5e18ad85","resolution":{"observed_at":"2026-08-02T04:35:00.270247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.369404Z","title":"Proceedings of the International Conference on Image Processing (ICIP) , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.369404Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:5463c759643e3d0e69c4737b72d335526d2a884e380336310cc33fb466023037","observation_id":"bff60c5e-aaf9-44e1-9843-0b95ac680932","resolution":{"observed_at":"2026-08-02T04:35:00.369404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.455565Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.455565Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:0de97412da95f9ac3da23feca11ca00d649af3ff808327df7c622969ab5e693f","observation_id":"cbddbf06-852d-4aa6-9f0f-0291f13aee40","resolution":{"observed_at":"2026-08-02T04:35:00.455565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.509480Z","title":"Journal of Machine Learning Research , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.509480Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:cdbe451c75a72e30069c31849f4701650f42d2b9dbfcb8109645bd8a898aa9df","observation_id":"13719951-5dae-4d01-9093-abace73843cd","resolution":{"observed_at":"2026-08-02T04:35:00.509480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.555182Z","title":"2002 , journal =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.555182Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:246a9f403478a2910a03283fcd32a2002c9a697a300cccc9d63da7e46c2dcf0e","observation_id":"27b1b3a3-ac33-41f0-a413-d0ceb5f096e0","resolution":{"observed_at":"2026-08-02T04:35:00.555182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.660659Z","title":"2002 , journal =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.660659Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:0aa28065b0bfb4c930e7edb576fb28ea9f29d3d012f12f0e97fccd36c0df6ba6","observation_id":"7fbb7d44-544a-4fed-b20c-d0a7ab8ff1bb","resolution":{"observed_at":"2026-08-02T04:35:00.660659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.774361Z","title":"Proceedings of the Conference on Learning Theory (COLT) , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.774361Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:0aeef26a2d698c2f13ef453ab48d5fb490d86639fcd448b5aa1246fbd5b2e7e9","observation_id":"ae533764-6790-4d7f-9b5c-b569b7ca9e24","resolution":{"observed_at":"2026-08-02T04:35:00.774361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.823044Z","title":"2002 , booktitle =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.823044Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:280dbe568c1c3a06dff04f0be95dcfc0c5c3d53e92d0362e6e6be26704e15005","observation_id":"a7aba76a-86db-4ded-ade9-25de7043ec3f","resolution":{"observed_at":"2026-08-02T04:35:00.823044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.869287Z","title":"Statistics in medicine , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.869287Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:dbb1b2e00ce7fe6af1ba6462f6261ee29a8adfa7600faf45a1bbdf06759c12ba","observation_id":"1cd3f72b-9714-41d9-9b80-56a700674d5a","resolution":{"observed_at":"2026-08-02T04:35:00.869287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:00.961587Z","title":"Machine learning , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:00.961587Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:f6b7c4de0dd01011fdd5353156d1d55b13833b1ad3881c2ffceef200e41f0d38","observation_id":"5a95d6f6-77a2-4ce5-b8fe-ff4d58394268","resolution":{"observed_at":"2026-08-02T04:35:00.961587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:01.054489Z","title":"2002 , journal =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:01.054489Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:23488d52f62b2c1c86c986971f3965e4492a9e1190e71c2afbd50889e125e236","observation_id":"52953641-faba-491e-8acf-8a22086f46e2","resolution":{"observed_at":"2026-08-02T04:35:01.054489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:01.165978Z","title":"2002 , publisher =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:01.165978Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:f25676b289b85837dc93ffe441677635c24abfce926b496367306afef25f0b1e","observation_id":"e471c4ca-db3b-4aa9-8318-51f07512cd6c","resolution":{"observed_at":"2026-08-02T04:35:01.165978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:01.241162Z","title":"British Journal of Developmental Psychology , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:01.241162Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:27d87810fd884411d52784be5e3f52dc35aa4f8b82a8e337f584b612e6faf4bd","observation_id":"35294c42-cbf7-4789-9f5f-258046a6ad58","resolution":{"observed_at":"2026-08-02T04:35:01.241162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:01.361428Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:01.361428Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:f0d2bd78b19fa86e3b83bd5d856d944b32a49fcae5f0a8f3a3ad897f2330e5ae","observation_id":"8a8a76f8-8b27-48a2-9713-430e1d41e65f","resolution":{"observed_at":"2026-08-02T04:35:01.361428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:01.449125Z","title":"IEEE Transactions on Information Theory , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:01.449125Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:2eec20fcb6e43c5dce80397441f5d05ffdb18f3c8823045f8cc4fb8dd8d64f88","observation_id":"24f778b9-46f8-4526-848d-4cb8e34b398d","resolution":{"observed_at":"2026-08-02T04:35:01.449125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:01.557305Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:01.557305Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:f085726c12cd3ce70bd84165cc617f2ea3da1a86c9504eead2f8428729b2a09b","observation_id":"96b05a66-e70f-4aa0-8777-cad0ed7e312f","resolution":{"observed_at":"2026-08-02T04:35:01.557305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:01.662675Z","title":"Mathematical Programming, Series B , doi =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:01.662675Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:65160850327b25efdb922531b10cfb327ada42bc11d82adf4bdd5fdf1fbb7a8b","observation_id":"94166334-2679-4ad0-8982-2c0e7f190057","resolution":{"observed_at":"2026-08-02T04:35:01.662675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:01.765225Z","title":"Multimedia systems , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:01.765225Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:b710d8802038e17d74f617411cb55d851062c49b94ed4a824fc9c22c6d0eb5b3","observation_id":"3b0ed156-d5d8-4484-a536-79f422eba074","resolution":{"observed_at":"2026-08-02T04:35:01.765225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:01.867587Z","title":"ICML workshop on The Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:01.867587Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:a1b7aef00063cafe75aa357e6baea2299a2ad7922de3da195c23211212775f1e","observation_id":"6f8e112e-0732-41dc-86df-bcddb1440c5c","resolution":{"observed_at":"2026-08-02T04:35:01.867587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:01.945398Z","title":"Proceedings of the International Conference on Machine Learning (ICML) , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:01.945398Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:06a173acdbe336b1c4a5493232a8e8f4ade10aef1e2457f6aef316f890d91c99","observation_id":"1c29824b-ec03-4ad0-92a2-bc3e9dd9aebc","resolution":{"observed_at":"2026-08-02T04:35:01.945398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.010880Z","title":"Machine Learning , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.010880Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:c13da041e21f5988385b2e29fb72b863beb5e76c196e4471178ab67144af77c2","observation_id":"c0cf2ada-06e7-4bcd-ac74-f50d9f2dc6e5","resolution":{"observed_at":"2026-08-02T04:35:02.010880Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.104505Z","title":"Proceedings of the ACM Symposium on Theory of Computing (STOC) , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.104505Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:3e994e1f667cf961653e1445105ede701b252dc985d775d583be7e24f24df437","observation_id":"f0fd77a8-b6b6-4aa6-a68f-0e4d06aa5c77","resolution":{"observed_at":"2026-08-02T04:35:02.104505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.186951Z","title":"Proceedings of the Twentieth Annual Symposium on Computational Geometry , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.186951Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:9d09348d2825636c28279cbe213db65a5671920a11c808f6ec14adf44edb52cb","observation_id":"4fa47f1e-dbcd-4de8-aeaa-24c75ea3747d","resolution":{"observed_at":"2026-08-02T04:35:02.186951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.241233Z","title":"The Annals of Statistics , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.241233Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:7fa52c55f9bc3d4adfacaaa43b41f8718b5bcc5d911fe389b0a646d52c96e741","observation_id":"e48b08f2-138e-4f55-a837-7a9f8e854772","resolution":{"observed_at":"2026-08-02T04:35:02.241233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.311509Z","title":"and Bousquet, Olivier and Mendelson, Shahar , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.311509Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:be99b32e7078ecb85df76c7d118c73f6f515aa613ff5d75d020eaa24a8de7d44","observation_id":"5c586f85-46f9-4b74-90eb-50e950a68846","resolution":{"observed_at":"2026-08-02T04:35:02.311509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.417283Z","title":"Social Choice and Welfare , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.417283Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:bdcfb08b194592ea7562b32be9b3c18de98f4e77754fe9d1196a826917caddb3","observation_id":"a5e170ce-a7bc-47f0-a4b5-b33fe33c4b41","resolution":{"observed_at":"2026-08-02T04:35:02.417283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.498362Z","title":"Advances in Neural Information Processing Systems (NeurIPS) , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.498362Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:64595a4a75f4ed8749c6181d934809ff618b2ea9a55eafde1601a3f4a9925c7e","observation_id":"0e5bf215-5986-4bad-9891-742acffdd95d","resolution":{"observed_at":"2026-08-02T04:35:02.498362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.574493Z","title":"Journal of Optimization Theory and applications , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.574493Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:72bc6bdbb51403940552fbf6a0359868c6eeb5fc6db273b58e57afd58f44b8c0","observation_id":"ec21c690-ac2a-4d8a-af64-4518167925db","resolution":{"observed_at":"2026-08-02T04:35:02.574493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.657065Z","title":"2005 , booktitle =","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.657065Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:8ffbe781ebd873c108574e65275028dcffc24028ab0cefc01d2f51c1d20b2616","observation_id":"dc672f48-e790-4575-9987-136e9dc668e5","resolution":{"observed_at":"2026-08-02T04:35:02.657065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.759515Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.759515Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:c629473e5350c1183f31b5eddb1ff0d87456e72c873472aaea28944ad185dbe2","observation_id":"4692124a-7081-405c-ac4b-a2f09a5c693d","resolution":{"observed_at":"2026-08-02T04:35:02.759515Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.864896Z","title":"2006 , booktitle =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.864896Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:7570cb8d810787f5513de29522a7d807e66a2f8bf3336786fa85bad12fc01e20","observation_id":"4ad9e083-5cc9-461b-a674-9a1191ad8a54","resolution":{"observed_at":"2026-08-02T04:35:02.864896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:02.976254Z","title":"2006 , journal =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:02.976254Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:12444e0ed38d5673d9414558bd898b70ab7eadaff72da06009c49a1cba6b7c98","observation_id":"aab61e06-aec3-47d5-8867-cb5fc6649509","resolution":{"observed_at":"2026-08-02T04:35:02.976254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:03.023988Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:03.023988Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:e0a444953636a004d04111e5d18f380ac53d89df43747d7d52d5530c23d65301","observation_id":"3cef4872-7e1c-4280-b73f-e8c2ac7903ba","resolution":{"observed_at":"2026-08-02T04:35:03.023988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:03.109051Z","title":"Journal of Machine Learning Research , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:03.109051Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:4982050f4ec7b4237cd31f94c93723e2c5e8190137458f5c2b280a9ea5d4956c","observation_id":"62c73e96-dc17-48e7-9899-3a6dfcaad709","resolution":{"observed_at":"2026-08-02T04:35:03.109051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:03.139911Z","title":"2006 , booktitle =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:03.139911Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:8b2f3d664315c3957e0f041d72f7f307da9c8c0eaf73190a186fb3a0297a52ee","observation_id":"10441aa9-d921-4558-904d-56f159655f6e","resolution":{"observed_at":"2026-08-02T04:35:03.139911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:35:03.214200Z","title":"2006 , booktitle =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-02T04:35:03.214200Z"},"links":{"citing_paper":"/paper/2607.13686"},"observation_digest":"sha256:c4c487e4f2bc4d004ffb739b744b2d339cc8d62c0cd09347f50313b84315a221","observation_id":"5b403354-2712-4447-81f3-850d3f52df82","resolution":{"observed_at":"2026-08-02T04:35:03.214200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.13686","last_updated":"2026-07-15T10:28:05Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T07:22:45.440235Z","submitted_at":"2026-07-15T10:28:05Z","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":2,"unresolved":96,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":300},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 0 inbound Pith citation observations for arXiv:2607.13686."}