{"as_of":"2026-08-13T04:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ef05956940c3a21dfe0f108a3d7fb566c270b004e28ecc0aad32d2e9ebfc4da","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:34:46.653136Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:31:29.746373Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T23:47:27.460201Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14361","snapshot_observed_at":"2026-08-12T15:31:29.746373Z","title":"Kothari, and Andrew D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14276","last_updated":"2025-08-25T14:47:28Z","snapshot_observed_at":"2026-08-12T15:18:48.413858Z","submitted_at":"2024-11-21T16:31:26Z","title":"A $k^{\\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:31:29.746373Z"},"links":{"cited_paper":"/paper/2411.14361","citing_paper":"/paper/2411.14276"},"observation_digest":"sha256:fbeaa4cbf0f195ecd9edcf6f496c25a12a75025322970922e34f75bdff536b33","observation_id":"38cceb38-3891-4ecb-b6f3-93d6c958fc02","resolution":{"observed_at":"2026-08-12T15:31:29.746373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"cited_work":{"arxiv_id":"2411.14361","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.14361","snapshot_observed_at":"2026-07-02T23:47:27.460201Z","title":"[BHLM25] Arpon Basu, Jun-Ting Hsieh, Andrew D","venue":null,"work_id":"0bc28ff1-d74e-4f52-b824-8af4ff2659ba","year":null},"citing_paper":{"arxiv_id":"2606.08597","last_updated":"2026-06-07T12:20:36Z","snapshot_observed_at":"2026-08-09T02:13:54.571610Z","submitted_at":"2026-06-07T12:20:36Z","title":"Kikuchi Graphs of Random Hypergraphs are Approximately Johnson","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T17:58:42.283848Z"},"links":{"cited_paper":"/paper/2411.14361","citing_paper":"/paper/2606.08597"},"observation_digest":"sha256:3910e7653b013f35904a242c643fd003b9cd3dea84ec023150cd1d80439f35ad","observation_id":"2dd49339-15e6-4481-85a1-33e8f10127b9","resolution":{"observed_at":"2026-07-02T23:47:27.461914Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.14361/citation-record","integrity":"/paper/2411.14361/integrity","json":"/paper/2411.14361/citation-record.json","paper":"/paper/2411.14361"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.04460","last_updated":"2025-02-26T14:45:22Z","snapshot_observed_at":"2026-08-05T03:19:08.140633Z","submitted_at":"2023-09-08T17:42:11Z","title":"Essentially tight bounds for rainbow cycles in proper edge-colourings","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.04460","snapshot_observed_at":"2026-08-12T15:34:46.237493Z","title":"Essentially tight bounds for rainbow cycles in proper edge-colourings","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.237493Z"},"links":{"cited_paper":"/paper/2309.04460","citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:367a1c3c455cbe0bdfd1fd8fac0ff627dfa96dabeb2d4e386b85e416f852ac18","observation_id":"627d3442-cb9f-4159-99ef-812119520f9f","resolution":{"observed_at":"2026-08-12T15:34:46.237493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05864","last_updated":"2024-04-08T20:54:14Z","snapshot_observed_at":"2026-08-13T00:34:40.007429Z","submitted_at":"2024-04-08T20:54:14Z","title":"Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05864","snapshot_observed_at":"2026-08-12T15:34:46.255372Z","title":"Near-tight bounds for 3-query locally correctable binary linear codes via rainbow cycles","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.255372Z"},"links":{"cited_paper":"/paper/2404.05864","citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:a8ef7de05c18a84909610de97413d338744f984297ba07ce72951e99957bcb23","observation_id":"add63f1a-c659-45da-a8db-a1932a504d27","resolution":{"observed_at":"2026-08-12T15:34:46.255372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:46.265063Z","title":"Kothari, and Peter Manohar","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.265063Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:1857030df52f087c144d07104508fe835604975c9a449d742edfc8674afa4364","observation_id":"15fee0ed-5f18-4785-8f33-ad4c3f25c51e","resolution":{"observed_at":"2026-08-12T15:34:46.265063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:46.280851Z","title":"Proof verification and the hardness of approximation problems","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.280851Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:24f8de573ca4e67588b482770be345051980b5a2cab24756395598637771c2e0","observation_id":"07eeb05c-9c88-480f-a61b-ee9a2b18c275","resolution":{"observed_at":"2026-08-12T15:34:46.280851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:48.056569Z","title":"Probabilistic checking of proofs: A new characterization of np","venue":null,"work_id":"87b8ac39-d4d1-4913-80c0-762a21cb0322","year":1998},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.291830Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:10392c2b10c67022edd17efa38bb7d524dda390bd9e2b76fe4ed8438091b2c88","observation_id":"e1620601-93fb-49fb-8128-56a8f1b0bd7d","resolution":{"observed_at":"2026-08-12T15:34:48.064791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:48.022181Z","title":"Combinatorial Lower Bounds for 3-Query LDCs","venue":null,"work_id":"1e2eaa16-0702-4386-ba70-a3bb2d09836e","year":2020},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.299390Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:a26750ba2680125056eba481e7624e37c5a2cb8c3a0e57981a9fd4c768e366f0","observation_id":"24fe7f5c-ab7e-4768-886b-f40c635f125f","resolution":{"observed_at":"2026-08-12T15:34:48.030184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.988157Z","title":"Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes","venue":null,"work_id":"8b5e5765-e497-4163-9bbb-54c850041b2f","year":2011},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.310161Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:004ad00adf9d2452f56d52151a5aaabfa93a6c5446b8594632e825d883ba40f4","observation_id":"fa1c9259-1685-4820-a673-8c517d835b63","resolution":{"observed_at":"2026-08-12T15:34:48.003173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.955277Z","title":"Efficient and error-correcting data structures for membership and polynomial evaluation","venue":null,"work_id":"6a5a5ec2-8cc7-4d41-aec3-d8d9cffd42d6","year":2010},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.319777Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:473061ef5c923a554a16da4cbe37205ce12979523c4b2cb0dee1598a8d48fa24","observation_id":"6b9b3a95-0bcb-4b91-93f8-99c441cd404a","resolution":{"observed_at":"2026-08-12T15:34:47.966387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.928663Z","title":"2-server PIR with subpolynomial communication","venue":null,"work_id":"dfa8ad48-6502-42ad-8818-d8a099cdab48","year":2016},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.328493Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:0807828944b0b5a6b8a0bd13547356df7ef01cc5ffe4d6c130332c60b281b84c","observation_id":"3e2500ce-1d50-49a2-a8c8-2e3912edff48","resolution":{"observed_at":"2026-08-12T15:34:47.937381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.885114Z","title":"Rainbow Turán problem for even cycles","venue":null,"work_id":"5e4b867b-e1e2-47a6-8ef4-d6edd4a00650","year":2013},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.336460Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:a3ef56e4841ccbe0ba9ed2b0caa889f799c108040e3662fdf769c5532f13d2e7","observation_id":"886ea159-a94c-40aa-8e58-00c905792139","resolution":{"observed_at":"2026-08-12T15:34:47.893796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.858779Z","title":"Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits","venue":null,"work_id":"9e7397a7-69eb-48fd-a69d-cde4cbb7ad9f","year":2005},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.346942Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:1ec06dbd602deb1276b345484c630eea7b57b5c1b1479aae96af7483f2beb74b","observation_id":"32b20f1e-552f-486a-a8ef-01a41b3ca997","resolution":{"observed_at":"2026-08-12T15:34:47.867981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.835663Z","title":"On matrix rigidity and locally self-correctable codes","venue":null,"work_id":"f014f6a1-684e-4515-81f4-4265689657bd","year":2010},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.353098Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:8effcb743913015cc6e9d65d8a7e6ae51bc4c613640fc7e901f9341c2e8f791e","observation_id":"c574a743-cde0-472e-979f-1b2833b3ae0d","resolution":{"observed_at":"2026-08-12T15:34:47.842091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.806998Z","title":"3-query locally decodable codes of subexponential length","venue":null,"work_id":"9ee5883d-d55e-4d39-84b7-2f02b05061cb","year":2009},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.361139Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:0c9baaa0c88d0b9e105d4bef2190e114c070292ba316e49aeb542bc0eb584ad7","observation_id":"0a0b0bf5-2bd8-42b1-85c4-d5a94791da06","resolution":{"observed_at":"2026-08-12T15:34:47.816661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:46.370161Z","title":"Kothari, and Peter Manohar","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.370161Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:2a192d67bd28f6b9d5f680bec6b7aea8a2b7722f2e2de8cfa7f92134f306090b","observation_id":"dee6fb7d-d954-451c-a330-b34116371f88","resolution":{"observed_at":"2026-08-12T15:34:46.370161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.750347Z","title":"Lower bounds for linear locally decodable codes and private information retrieval","venue":null,"work_id":"7c033def-2cda-404f-ac82-66cbd67cedaa","year":2006},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.376125Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:bf2a23c9a5d82139e54276fb93169f4f859f3036d9a85d89bf02a8d13cfe4e29","observation_id":"ef201e75-fd50-41ca-9f9b-724a82c9b4bb","resolution":{"observed_at":"2026-08-12T15:34:47.756857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.719937Z","title":"Kothari, and Sidhanth Mohanty","venue":null,"work_id":"b6f749d3-2e76-4287-a0ec-0e50a6f917f6","year":2023},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.386923Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:9697900af427968d9fb08d565d3bb9b44789bfe895a05960fcc8b37110e9d5b9","observation_id":"fef77379-8dbd-4a59-9a17-91f3d37b2318","resolution":{"observed_at":"2026-08-12T15:34:47.731890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11590","last_updated":"2024-11-25T19:47:41Z","snapshot_observed_at":"2026-07-06T17:18:32.330256Z","submitted_at":"2024-01-21T20:42:12Z","title":"Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11590","snapshot_observed_at":"2026-08-12T15:34:46.403268Z","title":"Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.403268Z"},"links":{"cited_paper":"/paper/2401.11590","citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:8b468f3c30e07eb91602498b54763e0968849eed5772512eb2eb9796d4b460a9","observation_id":"244dd6f4-e4aa-41cd-835d-ed115f847734","resolution":{"observed_at":"2026-08-12T15:34:46.403268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.690204Z","title":"On the hardness of information-theoretic multiparty computation","venue":null,"work_id":"c9e0cfe9-a638-44f0-8d06-f7cd2597a0d2","year":2004},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.411792Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:8fc2b42f1a006f9833dd1368b98768586ecd684086f2751ea16c9c678d24238f","observation_id":"fc8c76b8-d837-46b7-b2f2-dc0d0c48c8fd","resolution":{"observed_at":"2026-08-12T15:34:47.701813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.653101Z","title":"Rainbow Tur \\'a n number of even cycles, repeated patterns and blow-ups of cycles","venue":null,"work_id":"ee0fe1fe-74c2-4c3d-bb49-ecf147668af9","year":2020},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.420827Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:16ba5e8ff1cab59bbdcea04bfaf42d7aec239064d7807282171410185d80f5a3","observation_id":"59a7204d-6577-45d9-baf3-8356c3404e84","resolution":{"observed_at":"2026-08-12T15:34:47.666114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.620962Z","title":"A k^ q q-2 Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs","venue":null,"work_id":"de823ab5-12f6-40a6-84b3-055a2890d431","year":2024},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.435273Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:c88ec1a16316c10342cb324af42dd9109efa3063fa1d93cceaf925b361a2a67a","observation_id":"ad1a2aeb-ba50-44d4-994c-ec8056462e7a","resolution":{"observed_at":"2026-08-12T15:34:47.631502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.587977Z","title":"On the turán number of the hypercube","venue":null,"work_id":"cf53ee35-7dc2-48f3-a032-974781b86268","year":2024},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.443702Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:42026a194850e35ee80eea3fbdeca7ac162dfa0b2a13ba1e3315cae012041a15","observation_id":"bcb28238-a2b7-415c-b712-37df1821bf02","resolution":{"observed_at":"2026-08-12T15:34:47.601431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.559027Z","title":"Rainbow Cycles in Properly Edge-Colored Graphs","venue":null,"work_id":"9803930b-534a-4661-a191-fe75e0a6c5e1","year":2024},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.455473Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:3f8fdf949cafeb39ac87513cc4135245f59119c959dabb3f0f49eb833bed9e50","observation_id":"2e314ae5-f4b6-4620-b404-a0b473cd1069","resolution":{"observed_at":"2026-08-12T15:34:47.566562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.00558","last_updated":"2023-11-01T14:55:04Z","snapshot_observed_at":"2026-08-12T19:33:53.153989Z","submitted_at":"2023-11-01T14:55:04Z","title":"An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.00558","snapshot_observed_at":"2026-08-12T15:34:46.464339Z","title":"Kothari and Peter Manohar","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.464339Z"},"links":{"cited_paper":"/paper/2311.00558","citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:b2a95c49b0dfc5a5a862cd9248fa03da03b619fce3e950449fa83ef091f92cd4","observation_id":"28cd0697-be3f-4599-93af-182197876f8c","resolution":{"observed_at":"2026-08-12T15:34:46.464339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06513","last_updated":"2024-10-28T14:00:45Z","snapshot_observed_at":"2026-08-13T00:33:57.497010Z","submitted_at":"2024-04-09T17:59:47Z","title":"Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.06513","snapshot_observed_at":"2026-08-12T15:34:46.469953Z","title":"Kothari and Peter Manohar","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.469953Z"},"links":{"cited_paper":"/paper/2404.06513","citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:a8e87714ed9c756018137b2c149c2a2bf9301e2f99ec74ebd5a83d32b36f3666","observation_id":"4fae3958-2ac1-40a1-b0ed-4e378f2e97d3","resolution":{"observed_at":"2026-08-12T15:34:46.469953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.527995Z","title":"Rainbow Tur \\'a n Problems","venue":null,"work_id":"b8301da2-94ca-4b76-b8fc-820cb9eb2641","year":2007},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.477276Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:650bb3792569ea923d33ab5c1e2323b523049ef2742cf4120e4eb204a69aa715","observation_id":"2a0c2042-7330-4b64-884f-9c694a783221","resolution":{"observed_at":"2026-08-12T15:34:47.538080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.500354Z","title":"On the efficiency of local decoding procedures for error-correcting codes","venue":null,"work_id":"045aa19c-7e15-4250-ae06-d752d4862fc3","year":2000},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.491488Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:100013dfc1b2bcc536a7431103969062a240140a03f86c0f03ee21ecb7091823","observation_id":"38a1f3bf-f30e-4587-873f-828b75c12287","resolution":{"observed_at":"2026-08-12T15:34:47.506162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:46.502895Z","title":"Concentration of multivariate polynomials and its applications","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.502895Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:c6335f3265656491dc2718bbea2906ae8e2b23f3a94186980bae703efaaaf244","observation_id":"5fcce227-9ea3-4b26-9562-9ada908046be","resolution":{"observed_at":"2026-08-12T15:34:46.502895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.445985Z","title":"Exponential lower bound for 2-query locally decodable codes via a quantum argument","venue":null,"work_id":"a72b8a2d-5913-41b7-ac99-0b45e3e34fbc","year":2004},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.513040Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:d46a4949eb407b86f7e8a31aad0604b23bddd17b458a57973f00ee28e7781cb0","observation_id":"2ee6319e-f64a-4075-afd6-ee1fccba6dba","resolution":{"observed_at":"2026-08-12T15:34:47.453353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.417416Z","title":"Noncommutative K hintchine and P aley inequalities","venue":null,"work_id":"18ab0fda-d004-42f8-95a0-ecac4029b425","year":1991},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.518695Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:6e93009dfdd8ab2b324123e9de38ad85a178bf641929294aa7600311d4b65f4c","observation_id":"aaed958a-92bf-4662-9b1c-6b33b14d2593","resolution":{"observed_at":"2026-08-12T15:34:47.425367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.378900Z","title":"Romashchenko","venue":null,"work_id":"8c8371b8-e63a-49d8-a387-82443586a3b4","year":2006},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.528834Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:41a2adfb1b2638b8b9e4686cc3c79f0b13526041e59434e83cbdf9d1351fffbf","observation_id":"77eb75a8-02eb-413b-9c03-d2a88cb24b5d","resolution":{"observed_at":"2026-08-12T15:34:47.392265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.344294Z","title":"Concentration and moment inequalities for polynomials of independent random variables","venue":null,"work_id":"56235eae-0ad2-4611-a7f8-d893a7f33e07","year":2012},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.535377Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:6bbbaf41be3878c70141b708b25ba27552002b85ab6cfc39930b0f30fe755075","observation_id":"2f7c2fb9-1ce9-4131-9740-86814ae5db06","resolution":{"observed_at":"2026-08-12T15:34:47.350882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.305185Z","title":"The moduli of smoothness and convexity and the R ademacher averages of trace classes S p (1 p< )","venue":null,"work_id":"c073aeb2-9071-46a4-b50b-e681c2796daa","year":1974},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.542661Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:f364b245ca761e23052575402613dd90b709e2e9284f3d3823e9adc7be4f4017","observation_id":"6bf0776c-d061-4b2d-bf44-c9ef56672879","resolution":{"observed_at":"2026-08-12T15:34:47.318633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.269587Z","title":"Robust (rainbow) subdivisions and simplicial cycles","venue":null,"work_id":"c94e224d-379f-4b3b-a970-338442747e96","year":2024},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.550980Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:3d03f6145ee41d52ff133c4c823d46cc5a0abf5816b6138ede36257cc8caf49c","observation_id":"bf88e662-f20b-40d9-a89e-ad7906863ad6","resolution":{"observed_at":"2026-08-12T15:34:47.283459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0409044","last_updated":"2004-09-24T02:38:24Z","snapshot_observed_at":"2026-07-07T03:06:00.568661Z","submitted_at":"2004-09-24T02:38:24Z","title":"Some Applications of Coding Theory in Computational Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0409044","snapshot_observed_at":"2026-08-12T15:34:46.567783Z","title":"Some applications of coding theory in computational complexity","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.567783Z"},"links":{"cited_paper":"/paper/cs/0409044","citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:99e9d0e6068e0123ff6acc99cdb70a22252f130a9800d5907d0d22de84a50581","observation_id":"65bdf34b-c28e-4ca8-b0dd-3d4930df3f72","resolution":{"observed_at":"2026-08-12T15:34:46.567783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.237250Z","title":null,"venue":null,"work_id":"7d36548a-598e-43e4-b49b-e02a3f90d573","year":2015},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.575820Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:5c321a90a5c20b5e44eb4eef0ccf0060c78b2e6688bdbec6887f658b992c796b","observation_id":"ea34a8c9-e7fd-4222-b4d1-4cd6922013ea","resolution":{"observed_at":"2026-08-12T15:34:47.244651Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.204798Z","title":"Wein, Ahmed El Alaoui, and Cristopher Moore","venue":null,"work_id":"74eb36ec-a22f-464d-82ef-8095ab218053","year":2019},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.582284Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:713d95ba91623ddf7678091c47abfb5242e67cb070db82292cf5dfb4867a9819","observation_id":"9ba6e859-6c0e-4b8b-ac97-98c34da9df08","resolution":{"observed_at":"2026-08-12T15:34:47.215506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.170082Z","title":"Error-correcting data structures","venue":null,"work_id":"ae355e5c-cc30-4506-a765-d1896bb2a82c","year":2009},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.587933Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:1a78dec340121d8618bc043f5d79eb5bd7289e09067958662e79dfd4282526a0","observation_id":"ea181e68-99f9-495d-9444-317de3a2879c","resolution":{"observed_at":"2026-08-12T15:34:47.178745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.142382Z","title":"New lower bounds for general locally decodable codes","venue":null,"work_id":"5601f491-3886-4d59-a676-9e425368a908","year":2007},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.598101Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:5c061cef5e6035695d4b2308cf6acaa4b3d37587192e22ad8ffd2e2d037f4bb1","observation_id":"23230138-13c2-4f97-a9d0-d464cdcec7a9","resolution":{"observed_at":"2026-08-12T15:34:47.149558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.113326Z","title":"Corruption and recovery-efficient locally decodable codes","venue":null,"work_id":"d02b05db-9b5d-478f-908c-17ca4c1452bf","year":2008},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.603870Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:50b4f307677606da156a15eaf6207e559cada61595cedc036926be5aabecb515","observation_id":"9782917b-f5e9-4759-8fd0-38bfaf772b5d","resolution":{"observed_at":"2026-08-12T15:34:47.120960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.071188Z","title":"A quadratic lower bound for three-query linear locally decodable codes over any field","venue":null,"work_id":"ddb0c9a8-8cdd-40d4-be61-e566c5900b69","year":2012},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.609833Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:ba0521e6b53913aa2e8cbed105f8d31190b51b45df823551a08cc73959391dd4","observation_id":"baf803c4-8298-479f-be11-8de52effd63f","resolution":{"observed_at":"2026-08-12T15:34:47.078438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.041509Z","title":"Improved lower bounds for locally decodable codes and private information retrieval","venue":null,"work_id":"b4688fce-4002-4075-996d-7293826c56f6","year":2005},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.616816Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:3804a40971d7f6af1e32a548d96b145119ac5aa6ed21dcd42dec0686e9fe4bbc","observation_id":"8c2c9d4f-e76a-44f2-942d-c77952383734","resolution":{"observed_at":"2026-08-12T15:34:47.048812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:47.015847Z","title":"A stronger bound for linear 3-lcc","venue":null,"work_id":"de882bae-628d-4579-813d-7a541a3c0455","year":2024},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.626336Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:da965056b834caf7a7c8e974a2083704a983a5fd05304853390d010da54f244c","observation_id":"1be158aa-fe90-4b86-9c44-0dd023124635","resolution":{"observed_at":"2026-08-12T15:34:47.022498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:46.994955Z","title":"Towards 3-query locally decodable codes of subexponential length","venue":null,"work_id":"7619fe1c-ae43-41e0-924c-958c4fbf9a9d","year":2008},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.635856Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:ed027df89dcb7f5a689b4dd8b6eb7fed7f61416e6efade8c072f4c920c2697ec","observation_id":"32167074-6d2f-494e-b8ed-74e950ada6af","resolution":{"observed_at":"2026-08-12T15:34:47.002160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:46.961691Z","title":"Locally Decodable Codes and Private Information Retrieval Schemes","venue":null,"work_id":"e5a41ca7-c949-4901-a557-9984dabd81c6","year":2010},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.645217Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:f677d5182f117afe3f608b5da4b5fb7fb90a592ba8db8426dc73d5d28ccae882","observation_id":"27788524-4c62-45aa-a887-64acd7545d61","resolution":{"observed_at":"2026-08-12T15:34:46.970195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:34:46.933449Z","title":"Locally decodable codes","venue":null,"work_id":"9918d132-6085-40ec-87f5-d4616111542d","year":2012},"citing_paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-12T15:34:46.653136Z"},"links":{"citing_paper":"/paper/2411.14361"},"observation_digest":"sha256:df86f91ffe2d0d83e58e13cf0893313c0a6dd6bbb6c865a8c66a6614ce2454b6","observation_id":"79c60779-fa4b-4a0f-aa56-fae2719a63d5","resolution":{"observed_at":"2026-08-12T15:34:46.941201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.14361","last_updated":"2024-11-21T18:00:12Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T15:13:47.080718Z","submitted_at":"2024-11-21T18:00:12Z","title":"Improved Lower Bounds for all Odd-Query Locally Decodable Codes"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":45},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"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."}