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-20T06:33:59.587034+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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.103549Z digest=sha256:76ae70944b3071c39a6426311c69cb1b59f13a594217f290365ba525ac34dcb3

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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:ffc5e357e0a4bb4c91818c35cde7ef8d2ccdc4610f520f3b318017d310235630

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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:4fc5daa0e5ef343c81e5318cbeff78661d05e53f77904ad5fffa7ab139da656b

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.168118Z digest=sha256:4d09c6687946c4d6cda04bffb40bdfef9548ab4f6796d57fb2e06fddfebed45e

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.183395Z digest=sha256:56b8d546e269a22b74753a51c18d9ae93e917b2284de8df2385f21b16e447064

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-20T06:33:59.587034+00:00.

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

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:cc624c7a8f85fed5f745d253c2602c07d8810609f73cb1d77b636b7179bceff9

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.212742Z digest=sha256:4fddcca5accc09d57bdac51ed48b7fd07940a26eb406a71aaf15be9e701724af

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.235445Z digest=sha256:711175cb72bf4f7fcbe8a74c2526b5fe55b5a75339484fd0d5cf9f50b3493d97

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.241394Z digest=sha256:8485ae029c76ad017b61e96bf1b1cfbae75b2778f3161259ac059ccd03db0fa0

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.252643Z digest=sha256:3a289410797b30ec5195b48d16316c838e36815102411d5335027486b5fbd5a4

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.258176Z digest=sha256:4451f0812b5f6b2fa0bafbb46b845891ea5d1610f80c9e1a3cc2ad5f776f5361

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-20T06:33:59.587034+00:00.

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

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:807c3a0aa9c72183ae8dc609a8093624c980a42d6184e9b5751f5df9431e3082

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.274199Z digest=sha256:67e6e8310bbc28e0a268c3f87657ce9f8907b60d0176dd13568f3517f122cb16

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.285285Z digest=sha256:8f4bea1bbc2e4378c89f84e9b59e7167d722ef6488b655d34253279d5c9abf39

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.306265Z digest=sha256:9cc01f321aa75d19af41b0fbeadb270faf37582a94735ec9d4beada60cc973f9

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.342630Z digest=sha256:193b76375c3456df0b2c4478d2ace67b1e1bb37ec475a6724518d5ea4af71e98

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.348320Z digest=sha256:09aa1d48ec9b7ddca0794853e2537b2f22dd9a2a60acc0abda8865292fe9eaa6

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.366726Z digest=sha256:65dea3c511ba1b434091259998ca7bafb8431e6cf8ae6a7b35e7ea05d07981b0

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-15T23:26:14.373572Z digest=sha256:2a51f5fe791a577fefc0aff6bd80786f7578e630e93f8b2ce54b41afb9143b2b

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-20T06:33:59.587034+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.