Pith. sign in

Paper Citation Record · LEDGER

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits

As of 20 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2505.05014.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2505.05014 v1

Coverage vector

measured 43 of 43 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T23:26:14.380589Z

measured 43 of 43 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

43 of 43 outbound references displayed

  • verified exact1
  • verified fuzzy26
  • unresolved16
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 8ab09aa4-682a-4109-8c3b-98a928f0e1de · outbound

This paper cites Ailon, Z.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Ailon, Z

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:15.251346Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.088537Z digest=sha256:d54bf4a8e6de2bbad01f47d9b3b8060acc21f103165b9f059314f99309050e89

Observation b643ce79-8d88-4632-9109-818ba0d03a20 · outbound

This paper cites Audibert, S.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Audibert, S

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:15.230910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.103549Z digest=sha256:25d863f6e65883311c565939764bc4997c84bd88e6596b5aa13d8dc72810d259

Observation 512dade4-6229-4134-a84f-59228e46411e · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 3

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:15.212190Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.110960Z digest=sha256:b5964624333f16b4877ac3fc3fd3cae843067600894cad1233b6b74a95bb48eb

Observation 7520e6e9-f797-436b-b2d9-33c8755fb6cd · outbound

This paper cites Bubeck and N.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Bubeck and N

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:15.194936Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.122147Z digest=sha256:e9ccf37b978e756f0421edc5f7d60aa5f72934eba2ed484dce370a0824caeb82

Observation 93ff8717-794f-47f2-92dc-e8981c2d33e8 · outbound

This paper cites A short note on an inequality between KL and TV.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits A short note on an inequality between KL and TV

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-15T23:26:14.129876Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T23:26:14.129876Z digest=sha256:96df72326f6a6efb1098edb2aecfbeb035846364607ba8514469ca532d179741

Observation f4d81372-f0b6-40f1-aa07-b0d868890d2f · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 6

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:15.175583Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.139261Z digest=sha256:f959b2ed2b8b86756d2cd0e5ab130e4652640e4e3026f0cb118347fb6e907cc7

Observation a13b4ccb-570c-4629-8753-c9c4818f1209 · outbound

This paper cites Dudík, K.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Dudík, K

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:15.155807Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.150047Z digest=sha256:b3799a355a63ee1e75ee9b42db5865a7ceb0fbd00205c5ad02dd547c2ff88f9d

Observation 0ae9c2c6-403c-42be-a3bc-0cdd2cab8c1a · outbound

This paper cites Even-Dar, S.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Even-Dar, S

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-15T23:26:14.155859Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T23:26:14.155859Z digest=sha256:cde33c9471140b751bd8520dbaf9f14dca3ed734029bd96f69258578759fd961

Observation 792177ba-65b2-489f-869e-11f5039a99d1 · outbound

This paper cites Fulman and L.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Fulman and L

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:15.125834Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.168118Z digest=sha256:7dbf9bb7ab16263be78653ce1a9c2e374063d6bbaca6408fcad8920ba69878e2

Observation 1787d761-f38e-47af-8756-f7e9cb27cede · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 10

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:15.107927Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.175145Z digest=sha256:e9d1a0f13b502c8413d2a15f7309fe6f5e78ecd8d286dd1428d39bf678e1edce

Observation 52a73166-60bb-4db4-ac9e-e10b6cb8e088 · outbound

This paper cites Garivier and O.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Garivier and O

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:15.091622Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.183395Z digest=sha256:1526e3f98568a05756f4803db92ee234041ce9919d6e993b3bdf4572d30da9f2

Observation 899df130-fa7e-4697-a94a-43c98b7401c7 · outbound

This paper cites Garivier and E.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Garivier and E

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:15.073148Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.191048Z digest=sha256:b06841273ee0dbb80f6e59bf5b682d80d17b10652c21cead42235d8239d43e57

Observation 15d9c5c2-89f1-459a-bfff-0843418cd9b5 · outbound

This paper cites Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-15T23:26:14.203621Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T23:26:14.203621Z digest=sha256:fe114f80cd7be3c30fcdad12b422ed4dd7fe6941d3af6f835b02d2ebd93c7f08

Observation ee2f5db1-afdd-4644-b272-a4ced8f2c4bb · outbound

This paper cites Jamieson and R.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Jamieson and R

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:15.055705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.212742Z digest=sha256:9926bc914c7af589c2973b244e21a2b557f7ce6d5a59f9309ea4c6664a328ca8

Observation cf87c578-307c-41dd-bd96-548ab24e21f0 · outbound

This paper cites Kaplansky.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Kaplansky

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:15.035626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.218545Z digest=sha256:52e209c9c233380af67aefef6938d2406c9f3479b5d4481402062a48109a5736

Observation 87155744-1d9b-4bd8-98c4-208148b77221 · outbound

This paper cites Kaplansky.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Kaplansky

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:15.005071Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.224760Z digest=sha256:ae7030cab10692e7e67458308fc0bdcd94eeeaea579577aa6fdb46171f5db65d

Observation 15568638-9ce2-4ec8-9025-def2eb0b0517 · outbound

This paper cites Kaufmann, O.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Kaufmann, O

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.985596Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.229812Z digest=sha256:f833fc6e04d8405365ed5b409c8d787c56df9cefd3fe7be7f02acd3641ab1fb0

Observation 54657d53-bf62-41ca-9629-65d49fd33490 · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 18

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:14.968613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.235445Z digest=sha256:1c0e4a9d70defe49eb13a2e967eeb66c5cf813edd924b7952d770622ae66ce02

Observation a34b009c-c841-4c34-b8e5-577c124aa8de · outbound

This paper cites Komiyama, J.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Komiyama, J

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.953483Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.241394Z digest=sha256:873bdf0c01365c9974011b517d00daac4400299af9698d0ab339d9f963998e0f

Observation 652ae02c-5bf7-430b-94af-5feb49f6efc5 · outbound

This paper cites Komiyama, J.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Komiyama, J

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.935138Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.247063Z digest=sha256:1cc5685ab703cb492a18908b69b4b0f122f7bdbd9461ee7af4310604aa4f055a

Observation 953bbcbb-4abc-4144-900c-1b9066bf178e · outbound

This paper cites Lai and H.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Lai and H

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.917104Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.252643Z digest=sha256:43a6abbe58ae6f010e65f745dcd2d0bdecfd106b21da50b1888f4f0dc169d4ef

Observation 0023ad4f-cf22-488f-82fd-daca934435d9 · outbound

This paper cites Lu and S.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Lu and S

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.898306Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.258176Z digest=sha256:7e7ea6e8224b4a6dea6c06a271588fae20beea867e50045755ffefd2f3200478

Observation f828972e-cd82-471c-b88d-1677f1760d73 · outbound

This paper cites Maiti, K.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Maiti, K

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.876218Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.262601Z digest=sha256:6a878b2e8b85e5b985abbc8164c12e31fb66f05e9ba264fd3901b9e687f58ec4

Observation 1918fa44-a943-4a17-b01e-c1c845940576 · outbound

This paper cites On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-15T23:26:14.267059Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T23:26:14.267059Z digest=sha256:8217621c026fc936ffa83cb7274b4649e21b4e9f33b118c190492e3d2753d822

Observation 35688927-95d0-4fa1-a01e-d053c6904aae · outbound

This paper cites Maiti, R.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Maiti, R

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.862601Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.274199Z digest=sha256:14c0d751d8c4a1e2664b1b517f5df089182faaeb0591e01e95f4eb851dc978a1

Observation 079cc9db-6d25-4a66-9b86-aaaaac47ea2e · outbound

This paper cites Mannor and J.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Mannor and J

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.846729Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.279048Z digest=sha256:cdc29d4aefa98dc910beedd69813bf6496bfbe048bb21fdc7fcc58479c467ea2

Observation b5d0356c-23ad-4a25-917b-327401db7d47 · outbound

This paper cites Matousek and B.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Matousek and B

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.830936Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.285285Z digest=sha256:0928df29ee609f20e25ae5bd318988f2205a0d80598a5ad1d2b79f313ed90783

Observation 83df7862-fb51-4003-a3bc-aef29a9881af · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 28

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:14.815145Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.289850Z digest=sha256:b4da6e7c91851c7a4971182bcccc9929f857c2955ea231397579fde5d00b70eb

Observation 1395bafe-2aed-44bd-848e-c2a5db6184f6 · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 29

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:14.799647Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.296119Z digest=sha256:9ee667a788fe704a90cbefef6d39b1cbea72ca587483984b47a7a2d7c52dd6c0

Observation a562c932-1a8a-45c1-b0b4-dcb796db47da · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 30

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:14.783551Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.301463Z digest=sha256:ddad3bd6ae3d1e89fec526ab5222db3e8a56f4425c9613ffd6acab2f4723b53c

Observation 8b54e049-d78d-4917-9e99-2c072d77667f · outbound

This paper cites Balanced Non-Transitive Dice II: Tournaments.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Balanced Non-Transitive Dice II: Tournaments

Reference 31

Resolution
verified exact
local_arxiv, observed 2026-08-15T23:26:14.448659Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.306265Z digest=sha256:4dc1202485be602efff74f5b537f839955799bc6f46e3d106d588d16c70a73f7

Observation bfb0f0e0-9d27-41af-8671-7ec5160f5a98 · outbound

This paper cites Schaefer and J.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Schaefer and J

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.767757Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.311449Z digest=sha256:18ce600df7acf3fdc57cde32ee69cecbfee8d2d1ec2bcc5c5285a9981fc153ac

Observation e1b36f84-c3fe-4206-b937-f1f02adcad04 · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 33

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:14.752383Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.317038Z digest=sha256:bb6b4d09ba7d033f4c05e09be023032bbf43ec9fe5a4b30d655402218f01cd43

Observation 181c3d59-f938-4823-89e8-cc33258e6052 · outbound

This paper cites Urvoy, F.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Urvoy, F

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.737523Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.322344Z digest=sha256:ea1623cf6d5d00d45737586724ec4b43fa5537451c9b9c768e15d5949d3a1596

Observation b3a50d7c-0cc6-4137-b0cc-cb4ca35b73ad · outbound

This paper cites von Neumann and O.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits von Neumann and O

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.723044Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.331755Z digest=sha256:ddef04659c4005a9caa1a0a7d89bc1ce5dafa08cd98864a877a14983003c43f5

Observation 0ca7c9ec-a836-4f67-8770-720b1670cdba · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 36

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:14.708811Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.337158Z digest=sha256:fb7a513f0e16408640f8b4e83e8e3ba5c3816e251bcc3d018d8524af0daa4c3f

Observation 7b55fbea-c842-47ce-aca0-49a14ed52406 · outbound

This paper cites Yue and T.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Yue and T

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.691764Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.342630Z digest=sha256:016f08fa7b71d477141345fbaf9a8ac2176a53c4343780b22818a48a44e9b01b

Observation fb894987-b0e7-4b22-ae71-c0131b4726ef · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 38

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:14.672171Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.348320Z digest=sha256:1cf0d2e51d34f2808d1efc1d7dc9fa49d0c629587c2625b3859ce29f1f4b773e

Observation a4299d94-500a-4f7f-aa74-d717f0d22427 · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 39

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:14.651139Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.353323Z digest=sha256:e3b507c14fc4764c9858358d5660f9c862367c9f98714fcb61b7c23a3e436d2f

Observation 9b3ec3a7-9e81-422e-a55b-6ee6ca88a420 · outbound

This paper cites Zoghi, S.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Zoghi, S

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.633040Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.359294Z digest=sha256:e42d602a164f3034cec12c3cca3a837bb02916894fdaa383f9964c171513f2d1

Observation 06314983-a8ef-49e6-b70a-8ed7b9120280 · outbound

This paper cites Zoghi, Z.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Zoghi, Z

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.602460Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.366726Z digest=sha256:78e8f92b92dc142fccf116fdc40e46b17879e0b4d248c7478b15d040dcce3f45

Observation f9150ac8-771c-4127-b593-e829b59e9188 · outbound

This paper cites A is non-redundant.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits A is non-redundant

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-15T23:26:14.582398Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.373572Z digest=sha256:47ded3d295ee07975d4b072c5fe477e1109fcdae1bef3f8aff646320159d0833

Observation 4922c7c8-689c-40d7-9fc1-ec72e667d569 · outbound

This paper cites an unresolved cited work.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Unresolved cited work

Reference 43

Resolution
unresolved
raw_fallback, observed 2026-08-15T23:26:14.560232Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T23:26:14.380589Z digest=sha256:ba60aba80335a07255f6c951248677e8d680dfaaffce8dc5c559563d98a113a5

Pith citing papers

No inbound Pith citation observations are available.