Pith. sign in

Paper Citation Record · LEDGER

Improved Lower Bounds for all Odd-Query Locally Decodable Codes

As of 13 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-12T06:34:41.77262+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:367a1c3c455cbe0bdfd1fd8fac0ff627dfa96dabeb2d4e386b85e416f852ac18

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

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:1857030df52f087c144d07104508fe835604975c9a449d742edfc8674afa4364

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:24f8de573ca4e67588b482770be345051980b5a2cab24756395598637771c2e0

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.291830Z digest=sha256:10392c2b10c67022edd17efa38bb7d524dda390bd9e2b76fe4ed8438091b2c88

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.299390Z digest=sha256:a26750ba2680125056eba481e7624e37c5a2cb8c3a0e57981a9fd4c768e366f0

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.310161Z digest=sha256:004ad00adf9d2452f56d52151a5aaabfa93a6c5446b8594632e825d883ba40f4

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.319777Z digest=sha256:473061ef5c923a554a16da4cbe37205ce12979523c4b2cb0dee1598a8d48fa24

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.328493Z digest=sha256:0807828944b0b5a6b8a0bd13547356df7ef01cc5ffe4d6c130332c60b281b84c

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.336460Z digest=sha256:a3ef56e4841ccbe0ba9ed2b0caa889f799c108040e3662fdf769c5532f13d2e7

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.346942Z digest=sha256:1ec06dbd602deb1276b345484c630eea7b57b5c1b1479aae96af7483f2beb74b

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.353098Z digest=sha256:8effcb743913015cc6e9d65d8a7e6ae51bc4c613640fc7e901f9341c2e8f791e

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.361139Z digest=sha256:0c9baaa0c88d0b9e105d4bef2190e114c070292ba316e49aeb542bc0eb584ad7

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:2a192d67bd28f6b9d5f680bec6b7aea8a2b7722f2e2de8cfa7f92134f306090b

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.376125Z digest=sha256:bf2a23c9a5d82139e54276fb93169f4f859f3036d9a85d89bf02a8d13cfe4e29

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.386923Z digest=sha256:9697900af427968d9fb08d565d3bb9b44789bfe895a05960fcc8b37110e9d5b9

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:8b468f3c30e07eb91602498b54763e0968849eed5772512eb2eb9796d4b460a9

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.411792Z digest=sha256:8fc2b42f1a006f9833dd1368b98768586ecd684086f2751ea16c9c678d24238f

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.420827Z digest=sha256:16ba5e8ff1cab59bbdcea04bfaf42d7aec239064d7807282171410185d80f5a3

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.435273Z digest=sha256:c88ec1a16316c10342cb324af42dd9109efa3063fa1d93cceaf925b361a2a67a

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.443702Z digest=sha256:42026a194850e35ee80eea3fbdeca7ac162dfa0b2a13ba1e3315cae012041a15

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.455473Z digest=sha256:3f8fdf949cafeb39ac87513cc4135245f59119c959dabb3f0f49eb833bed9e50

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

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

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.477276Z digest=sha256:650bb3792569ea923d33ab5c1e2323b523049ef2742cf4120e4eb204a69aa715

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.491488Z digest=sha256:100013dfc1b2bcc536a7431103969062a240140a03f86c0f03ee21ecb7091823

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

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.513040Z digest=sha256:d46a4949eb407b86f7e8a31aad0604b23bddd17b458a57973f00ee28e7781cb0

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.518695Z digest=sha256:6e93009dfdd8ab2b324123e9de38ad85a178bf641929294aa7600311d4b65f4c

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.528834Z digest=sha256:41a2adfb1b2638b8b9e4686cc3c79f0b13526041e59434e83cbdf9d1351fffbf

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.535377Z digest=sha256:6bbbaf41be3878c70141b708b25ba27552002b85ab6cfc39930b0f30fe755075

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.542661Z digest=sha256:f364b245ca761e23052575402613dd90b709e2e9284f3d3823e9adc7be4f4017

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.550980Z digest=sha256:3d03f6145ee41d52ff133c4c823d46cc5a0abf5816b6138ede36257cc8caf49c

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:99e9d0e6068e0123ff6acc99cdb70a22252f130a9800d5907d0d22de84a50581

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.575820Z digest=sha256:5c321a90a5c20b5e44eb4eef0ccf0060c78b2e6688bdbec6887f658b992c796b

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.582284Z digest=sha256:713d95ba91623ddf7678091c47abfb5242e67cb070db82292cf5dfb4867a9819

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.587933Z digest=sha256:1a78dec340121d8618bc043f5d79eb5bd7289e09067958662e79dfd4282526a0

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.598101Z digest=sha256:5c061cef5e6035695d4b2308cf6acaa4b3d37587192e22ad8ffd2e2d037f4bb1

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.603870Z digest=sha256:50b4f307677606da156a15eaf6207e559cada61595cedc036926be5aabecb515

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.609833Z digest=sha256:ba0521e6b53913aa2e8cbed105f8d31190b51b45df823551a08cc73959391dd4

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.616816Z digest=sha256:3804a40971d7f6af1e32a548d96b145119ac5aa6ed21dcd42dec0686e9fe4bbc

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.626336Z digest=sha256:da965056b834caf7a7c8e974a2083704a983a5fd05304853390d010da54f244c

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.635856Z digest=sha256:ed027df89dcb7f5a689b4dd8b6eb7fed7f61416e6efade8c072f4c920c2697ec

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.645217Z digest=sha256:f677d5182f117afe3f608b5da4b5fb7fb90a592ba8db8426dc73d5d28ccae882

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-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-12T15:34:46.653136Z digest=sha256:df86f91ffe2d0d83e58e13cf0893313c0a6dd6bbb6c865a8c66a6614ce2454b6

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

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-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-06-27T17:58:42.283848Z digest=sha256:3910e7653b013f35904a242c643fd003b9cd3dea84ec023150cd1d80439f35ad