Pith. sign in

Paper Citation Record · LEDGER

Improved Lower Bounds for all Odd-Query Locally Decodable Codes

As of 19 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 2 inbound Pith citation observations for arXiv:2411.14361.

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

pith.paper-citation-record.v1
2411.14361 v1

Coverage vector

measured 45 of 45 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T15:34:46.653136Z

measured 47 of 47 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 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T15:31:29.746373Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-02T23:47:27.460201Z

Reference resolution

45 of 45 outbound references displayed

  • verified exact0
  • verified fuzzy34
  • unresolved11
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 627d3442-cb9f-4159-99ef-812119520f9f · outbound

This paper cites Essentially tight bounds for rainbow cycles in proper edge-colourings.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Essentially tight bounds for rainbow cycles in proper edge-colourings

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.237493Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.237493Z digest=sha256:5c3be176a59fe29bda3eb91b49d08d90724299e5059d1d3553f8b78a12b4ccb4

Observation add63f1a-c659-45da-a8db-a1932a504d27 · outbound

This paper cites Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.255372Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.255372Z digest=sha256:8d78cec72c8d333aadb4ae9dfa0a05af65d5b7200c84c6e4f03f948001512eb9

Observation 15fee0ed-5f18-4785-8f33-ad4c3f25c51e · outbound

This paper cites Kothari, and Peter Manohar.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Kothari, and Peter Manohar

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.265063Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.265063Z digest=sha256:96706f274665a8fc5a58dcec7f1db36f02c54dea9347a7985961cde231dee2ed

Observation 07eeb05c-9c88-480f-a61b-ee9a2b18c275 · outbound

This paper cites Proof verification and the hardness of approximation problems.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Proof verification and the hardness of approximation problems

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.280851Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.280851Z digest=sha256:e3549320ec5be2adc5cca98a790057346a0f1328a2f06a099b1387ac713046dd

Observation e1620601-93fb-49fb-8128-56a8f1b0bd7d · outbound

This paper cites Probabilistic checking of proofs: A new characterization of np.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Probabilistic checking of proofs: A new characterization of np

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:48.064791Z

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=arxiv_source observed=2026-08-12T15:34:46.291830Z digest=sha256:9dae877634277fc06f8a4766a0bede73cc51a2ca52449adfa5bb444aa35b70bb

Observation 24fe7f5c-ab7e-4768-886b-f40c635f125f · outbound

This paper cites Combinatorial Lower Bounds for 3-Query LDCs.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Combinatorial Lower Bounds for 3-Query LDCs

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:48.030184Z

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=arxiv_source observed=2026-08-12T15:34:46.299390Z digest=sha256:685ae6941e019823b32b0c434e99af9c7bf7ab8dafcba3377244baba26e0720a

Observation fa1c9259-1685-4820-a673-8c517d835b63 · outbound

This paper cites Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:48.003173Z

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=arxiv_source observed=2026-08-12T15:34:46.310161Z digest=sha256:27c224fca2fb25ce522f7273acbd5843c94bcdbe98c3c3ab3172389bba462814

Observation 6b9b3a95-0bcb-4b91-93f8-99c441cd404a · outbound

This paper cites Efficient and error-correcting data structures for membership and polynomial evaluation.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Efficient and error-correcting data structures for membership and polynomial evaluation

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.966387Z

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=arxiv_source observed=2026-08-12T15:34:46.319777Z digest=sha256:1019bf1a6512f61712f4f65fa8e583e8b010557bcef1643b003b8462146b1b38

Observation 3e2500ce-1d50-49a2-a8c8-2e3912edff48 · outbound

This paper cites 2-server PIR with subpolynomial communication.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes 2-server PIR with subpolynomial communication

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.937381Z

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=arxiv_source observed=2026-08-12T15:34:46.328493Z digest=sha256:bba291a243085fecb6a0b7522e27500426faebe3cf50f8264a0cc512428d0003

Observation 886ea159-a94c-40aa-8e58-00c905792139 · outbound

This paper cites Rainbow Turán problem for even cycles.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Rainbow Turán problem for even cycles

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.893796Z

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=arxiv_source observed=2026-08-12T15:34:46.336460Z digest=sha256:80721da58c93588ba21f0e4a672ed9d74f34aeb15f7c8588d8d6a6ca109fca2c

Observation 32b20f1e-552f-486a-a8ef-01a41b3ca997 · outbound

This paper cites Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.867981Z

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=arxiv_source observed=2026-08-12T15:34:46.346942Z digest=sha256:c423a2a1380689d5fb30f7c90b3f4810e84a7dbc46654b7bf2a28e2beef09e73

Observation c574a743-cde0-472e-979f-1b2833b3ae0d · outbound

This paper cites On matrix rigidity and locally self-correctable codes.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes On matrix rigidity and locally self-correctable codes

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.842091Z

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=arxiv_source observed=2026-08-12T15:34:46.353098Z digest=sha256:e67a1891cb21edc685dcf48c732df51c32412a7ffa96a8ac968189392d16eb4a

Observation 0a0b0bf5-2bd8-42b1-85c4-d5a94791da06 · outbound

This paper cites 3-query locally decodable codes of subexponential length.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes 3-query locally decodable codes of subexponential length

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.816661Z

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=arxiv_source observed=2026-08-12T15:34:46.361139Z digest=sha256:7731f38c2463b9cbf1705fe82ef76186f7ac7c54874ffcd84acace493b74a902

Observation dee6fb7d-d954-451c-a330-b34116371f88 · outbound

This paper cites Kothari, and Peter Manohar.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Kothari, and Peter Manohar

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.370161Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.370161Z digest=sha256:3a5c5a028aeb369867d5707777fe66b21a1a956e405b02b5cd96655d088326e2

Observation ef201e75-fd50-41ca-9f9b-724a82c9b4bb · outbound

This paper cites Lower bounds for linear locally decodable codes and private information retrieval.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Lower bounds for linear locally decodable codes and private information retrieval

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.756857Z

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=arxiv_source observed=2026-08-12T15:34:46.376125Z digest=sha256:53d2cda3c145e1b95dc683abc3a422b9b78551b643beee5eac4f7ee0fc2f0ddf

Observation fef77379-8dbd-4a59-9a17-91f3d37b2318 · outbound

This paper cites Kothari, and Sidhanth Mohanty.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Kothari, and Sidhanth Mohanty

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.731890Z

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=arxiv_source observed=2026-08-12T15:34:46.386923Z digest=sha256:923c014798eb5df4aead0b0a5c846088d9e56244c224f0055e2baa23cfbec187

Observation 244dd6f4-e4aa-41cd-835d-ed115f847734 · outbound

This paper cites Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.403268Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.403268Z digest=sha256:4f8e336df195dcbc99911b0e2f74aad5e80c98f4daf7711a35e43cc687f1435f

Observation fc8c76b8-d837-46b7-b2f2-dc0d0c48c8fd · outbound

This paper cites On the hardness of information-theoretic multiparty computation.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes On the hardness of information-theoretic multiparty computation

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.701813Z

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=arxiv_source observed=2026-08-12T15:34:46.411792Z digest=sha256:e1ea8b4426d6a8e87c002965d67a873bcc7b977b1dbe1b51123f2d6af0a8a6f8

Observation 59a7204d-6577-45d9-baf3-8356c3404e84 · outbound

This paper cites Rainbow Tur \'a n number of even cycles, repeated patterns and blow-ups of cycles.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Rainbow Tur \'a n number of even cycles, repeated patterns and blow-ups of cycles

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.666114Z

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=arxiv_source observed=2026-08-12T15:34:46.420827Z digest=sha256:ff03e763599f58f328abe6e8516c737db08d0b46b8d84548422cc4b025cef6cf

Observation ad1a2aeb-ba50-44d4-994c-ec8056462e7a · outbound

This paper cites A k^ q q-2 Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes A k^ q q-2 Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.631502Z

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=arxiv_source observed=2026-08-12T15:34:46.435273Z digest=sha256:9b627b27e4fb951115b1c3c19e1d53324208bad992baedd85636b19cdf057b39

Observation bcb28238-a2b7-415c-b712-37df1821bf02 · outbound

This paper cites On the turán number of the hypercube.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes On the turán number of the hypercube

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.601431Z

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=arxiv_source observed=2026-08-12T15:34:46.443702Z digest=sha256:b2988203557c5600b134de8d0ffee2245866f637f0a4d0d7eaa29f6361dcd6ef

Observation 2e314ae5-f4b6-4620-b404-a0b473cd1069 · outbound

This paper cites Rainbow Cycles in Properly Edge-Colored Graphs.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Rainbow Cycles in Properly Edge-Colored Graphs

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.566562Z

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=arxiv_source observed=2026-08-12T15:34:46.455473Z digest=sha256:ebd3628ed15b3e7a11cf1dedc326bc41d607abb8e7ffc7f1bcaf4bc9470adcb5

Observation 28cd0697-be3f-4599-93af-182197876f8c · outbound

This paper cites An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.464339Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.464339Z digest=sha256:4cdf91750fd819f31fb7a72abdf47cf532a4bac5e692ce04acf7295e49db9c5c

Observation 4fae3958-2ac1-40a1-b0ed-4e378f2e97d3 · outbound

This paper cites Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.469953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.469953Z digest=sha256:f43e6d0699391b6eb45fa01cd6a528d2dec026413e59d07632c4464cc732717e

Observation 2a0c2042-7330-4b64-884f-9c694a783221 · outbound

This paper cites Rainbow Tur \'a n Problems.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Rainbow Tur \'a n Problems

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.538080Z

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=arxiv_source observed=2026-08-12T15:34:46.477276Z digest=sha256:8e86d332d961d6105eeb0c7f257669779255237463148959204ce6274d00592a

Observation 38a1f3bf-f30e-4587-873f-828b75c12287 · outbound

This paper cites On the efficiency of local decoding procedures for error-correcting codes.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes On the efficiency of local decoding procedures for error-correcting codes

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.506162Z

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=arxiv_source observed=2026-08-12T15:34:46.491488Z digest=sha256:e2e07cd720cd21ac624fc142dbf9c7dea93294a15fd9140a99112760f1d8bae9

Observation 5fcce227-9ea3-4b26-9562-9ada908046be · outbound

This paper cites Concentration of multivariate polynomials and its applications.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Concentration of multivariate polynomials and its applications

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.502895Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.502895Z digest=sha256:eba706130efd986139386200173cb9227cea639a9c0c436ac7707bd21e8f3814

Observation 2ee6319e-f64a-4075-afd6-ee1fccba6dba · outbound

This paper cites Exponential lower bound for 2-query locally decodable codes via a quantum argument.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Exponential lower bound for 2-query locally decodable codes via a quantum argument

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.453353Z

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=arxiv_source observed=2026-08-12T15:34:46.513040Z digest=sha256:5e4bd9da54582feeb15fc8e1c445b8fe9bf9817d3fb0a0ca88b83ba950a039f6

Observation aaed958a-92bf-4662-9b1c-6b33b14d2593 · outbound

This paper cites Noncommutative K hintchine and P aley inequalities.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Noncommutative K hintchine and P aley inequalities

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.425367Z

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=arxiv_source observed=2026-08-12T15:34:46.518695Z digest=sha256:6a74adfef6b7d3cf08b5f7555f6a84efbbdfc097d3beb02cab21d67948243db3

Observation 77eb75a8-02eb-413b-9c03-d2a88cb24b5d · outbound

This paper cites Romashchenko.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Romashchenko

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.392265Z

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=arxiv_source observed=2026-08-12T15:34:46.528834Z digest=sha256:622b526a0b23f2619cdf4437447d8632b1cd7e935f3ae372c4fb0bca93b65953

Observation 2f7c2fb9-1ce9-4131-9740-86814ae5db06 · outbound

This paper cites Concentration and moment inequalities for polynomials of independent random variables.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Concentration and moment inequalities for polynomials of independent random variables

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.350882Z

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=arxiv_source observed=2026-08-12T15:34:46.535377Z digest=sha256:269131de171a85b0e356aab92b0a4d537709fadba9dbf428b8185e0f5df7899c

Observation 6bf0776c-d061-4b2d-bf44-c9ef56672879 · outbound

This paper cites The moduli of smoothness and convexity and the R ademacher averages of trace classes S p (1 p< ).

Improved Lower Bounds for all Odd-Query Locally Decodable Codes The moduli of smoothness and convexity and the R ademacher averages of trace classes S p (1 p< )

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.318633Z

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=arxiv_source observed=2026-08-12T15:34:46.542661Z digest=sha256:57058ace03164e0b1173e3e9c6125b61620490a74f29cfadcb643cf87f3c5a2c

Observation bf88e662-f20b-40d9-a89e-ad7906863ad6 · outbound

This paper cites Robust (rainbow) subdivisions and simplicial cycles.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Robust (rainbow) subdivisions and simplicial cycles

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.283459Z

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=arxiv_source observed=2026-08-12T15:34:46.550980Z digest=sha256:3da3d174bd2dc226a97582812e74f2b21a5754e75060ee6e6489230c982f9f03

Observation 65bdf34b-c28e-4ca8-b0dd-3d4930df3f72 · outbound

This paper cites Some Applications of Coding Theory in Computational Complexity.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Some Applications of Coding Theory in Computational Complexity

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-12T15:34:46.567783Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T15:34:46.567783Z digest=sha256:e4d39ec706febe9810e3820c86c60556896df38d230c4d09d7fb8172de9a52d0

Observation ea34a8c9-e7fd-4222-b4d1-4cd6922013ea · outbound

This paper cites an unresolved cited work.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Unresolved cited work

Reference 35

Resolution
unresolved
raw_fallback, observed 2026-08-12T15:34:47.244651Z

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=arxiv_source observed=2026-08-12T15:34:46.575820Z digest=sha256:990227c5c29b1424595515edd8524e340bbefb6de9ff22745f166c110aebfff0

Observation 9ba6e859-6c0e-4b8b-ac97-98c34da9df08 · outbound

This paper cites Wein, Ahmed El Alaoui, and Cristopher Moore.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Wein, Ahmed El Alaoui, and Cristopher Moore

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.215506Z

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=arxiv_source observed=2026-08-12T15:34:46.582284Z digest=sha256:109fbe9b4b395fd0bc57d1bcc10ed51b94cef60996bc440576fd9ac2d62e2e5f

Observation ea181e68-99f9-495d-9444-317de3a2879c · outbound

This paper cites Error-correcting data structures.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Error-correcting data structures

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.178745Z

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=arxiv_source observed=2026-08-12T15:34:46.587933Z digest=sha256:6a81bc80d59848298039ecb09848a67e025ad4c7f4f32e34f746654703bc7515

Observation 23230138-13c2-4f97-a9d0-d464cdcec7a9 · outbound

This paper cites New lower bounds for general locally decodable codes.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes New lower bounds for general locally decodable codes

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.149558Z

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=arxiv_source observed=2026-08-12T15:34:46.598101Z digest=sha256:e9f26a33ced8cea1678e5623b5e7584e2844bfec5f81bc3cfcd3edf7029caeef

Observation 9782917b-f5e9-4759-8fd0-38bfaf772b5d · outbound

This paper cites Corruption and recovery-efficient locally decodable codes.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Corruption and recovery-efficient locally decodable codes

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.120960Z

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=arxiv_source observed=2026-08-12T15:34:46.603870Z digest=sha256:df4fc2b848986d53e2a69e723dc0673c86e566af31d880f81b93a739a0a7568f

Observation baf803c4-8298-479f-be11-8de52effd63f · outbound

This paper cites A quadratic lower bound for three-query linear locally decodable codes over any field.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes A quadratic lower bound for three-query linear locally decodable codes over any field

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.078438Z

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=arxiv_source observed=2026-08-12T15:34:46.609833Z digest=sha256:3ac1ecfb83e7b18cec3210406c484db00d0042137f18c80d6300ad9b291ae38c

Observation 8c2c9d4f-e76a-44f2-942d-c77952383734 · outbound

This paper cites Improved lower bounds for locally decodable codes and private information retrieval.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Improved lower bounds for locally decodable codes and private information retrieval

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.048812Z

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=arxiv_source observed=2026-08-12T15:34:46.616816Z digest=sha256:4c2aabfdc3a8dbf6230f1ad3eeb892d57668c54ff735c302d3ab4b04274a21cc

Observation 1be158aa-fe90-4b86-9c44-0dd023124635 · outbound

This paper cites A stronger bound for linear 3-lcc.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes A stronger bound for linear 3-lcc

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.022498Z

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=arxiv_source observed=2026-08-12T15:34:46.626336Z digest=sha256:f743b031af040fe5cc926dd9787f9966114fb559fa26d3bbad25093625d19d58

Observation 32167074-6d2f-494e-b8ed-74e950ada6af · outbound

This paper cites Towards 3-query locally decodable codes of subexponential length.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Towards 3-query locally decodable codes of subexponential length

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:47.002160Z

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=arxiv_source observed=2026-08-12T15:34:46.635856Z digest=sha256:1adeb896a551295d901ed7152879ae8cbe5a51bef1a0472fcd732b31a71a2cb3

Observation 27788524-4c62-45aa-a887-64acd7545d61 · outbound

This paper cites Locally Decodable Codes and Private Information Retrieval Schemes.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Locally Decodable Codes and Private Information Retrieval Schemes

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:46.970195Z

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=arxiv_source observed=2026-08-12T15:34:46.645217Z digest=sha256:c9f0ffe07b9e9a07e3b9369797a17e3c288da7d011e1e5b0bf746b676da903f4

Observation 79c60779-fa4b-4a0f-aa56-fae2719a63d5 · outbound

This paper cites Locally decodable codes.

Improved Lower Bounds for all Odd-Query Locally Decodable Codes Locally decodable codes

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T15:34:46.941201Z

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=arxiv_source observed=2026-08-12T15:34:46.653136Z digest=sha256:6ad2c0cf5cf34ca19f6ad7ae59caec54272f6ed2213ee1ad220a8823523705aa

Pith citing papers

Observation 38cceb38-3891-4ecb-b6f3-93d6c958fc02 · inbound

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs cites this paper.

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs Improved Lower Bounds for all Odd-Query Locally Decodable Codes

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-12T15:31:29.746373Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T15:31:29.746373Z digest=sha256:b25e399ec6d9120ff30bbd8256925598ddd0843b3b7b33c756c090deebc83657

Observation 2dd49339-15e6-4481-85a1-33e8f10127b9 · inbound

Kikuchi Graphs of Random Hypergraphs are Approximately Johnson cites this paper.

Kikuchi Graphs of Random Hypergraphs are Approximately Johnson Improved Lower Bounds for all Odd-Query Locally Decodable Codes

Reference 4

Resolution
verified exact
arxiv_id, observed 2026-07-02T23:47:27.461914Z

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-06-27T17:58:42.283848Z digest=sha256:03d1f93990ecb958df2a5d506326022af21b6f66f8f07ca26eaa19ca3489dc17