Paper Citation Record · LEDGER

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism

As of 19 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2608.08578.

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

pith.paper-citation-record.v1
2608.08578 v1

Coverage vector

measured 33 of 33 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T04:44:43.452623Z

measured 33 of 33 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

33 of 33 outbound references displayed

verified exact0
verified fuzzy32
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 1179103f-fbf0-4701-a634-2c23c9a79f3e · outbound

This paper cites Annals of Pure and Applied Logic , volume =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Annals of Pure and Applied Logic , volume =

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.830023Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 88e424e4-3e03-4eb9-999c-8b657e02d097 · outbound

This paper cites Combinatorica , volume =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Combinatorica , volume =

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.819995Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation fd51ded2-7673-4fb6-88c4-89f4e454d551 · outbound

This paper cites Proceedings of the 47th Annual.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Proceedings of the 47th Annual

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.810858Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 259ecd31-de25-45cf-8b56-beb682623d2f · outbound

This paper cites Journal of the.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Journal of the

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.802224Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation eb3e1f4b-7649-4ea0-875d-0aed757d2ce6 · outbound

This paper cites 2026 , doi =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism 2026 , doi =

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.792604Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 31e0e656-d89b-4e00-b853-b0538ad1c438 · outbound

This paper cites Theorem in the additive number theory , journal =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Theorem in the additive number theory , journal =

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.782999Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 9210f949-e5f8-42b0-b218-5035466caecb · outbound

This paper cites Saxe and Michael Sipser , title =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Saxe and Michael Sipser , title =

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.771170Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation fb5f82cb-4b65-46a6-8b54-86f8681d2339 · outbound

This paper cites Computational Complexity , volume =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Computational Complexity , volume =

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.761192Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a4aad4f3-9e34-4a84-ba7a-dd3d3036a71d · outbound

This paper cites Almost Optimal Lower Bounds for Small Depth Circuits , booktitle =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Almost Optimal Lower Bounds for Small Depth Circuits , booktitle =

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.750758Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 1daab7b8-33d3-4a92-acfe-b48a265ce8e3 · outbound

This paper cites 2017 , doi =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism 2017 , doi =

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.740133Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 46819901-f502-4931-a03d-e4eb4592a99c · outbound

This paper cites Algorithmica , volume =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Algorithmica , volume =

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.729985Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 97db8724-95b7-4fbe-9aae-2dc6d6cabfeb · outbound

This paper cites 1997 , doi =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism 1997 , doi =

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.718938Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation e9848ce7-7230-46db-a6b0-53001528c5b5 · outbound

This paper cites On Some Fine-Grained Questions in Algorithms and Complexity , booktitle =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism On Some Fine-Grained Questions in Algorithms and Complexity , booktitle =

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.708592Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 0a457af4-6912-4e34-936e-0435cf9605c0 · outbound

This paper cites Proceedings of the 26th Annual.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Proceedings of the 26th Annual

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.698928Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7c1a2714-7e75-4c88-896e-f19f182dfb48 · outbound

This paper cites Lawrence and Wegman, Mark N.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Lawrence and Wegman, Mark N

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.689048Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7e5c99a1-5314-4b98-a63e-f6a667a7ba2a · outbound

This paper cites Information Processing 77, Proceedings of the 7th IFIP Congress 1977, Toronto, Canada, August 8--12, 1977 , editor =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Information Processing 77, Proceedings of the 7th IFIP Congress 1977, Toronto, Canada, August 8--12, 1977 , editor =

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.679645Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 229306a3-7c02-45ac-acee-5280204c786c · outbound

This paper cites , title =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism , title =

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.665779Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation ae47658b-fdd2-4b79-b593-d1f1896491d9 · outbound

This paper cites Explicit near-Ramanujan graphs of every degree.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Explicit near-Ramanujan graphs of every degree

Reference 18

Resolution: metadata mismatch; local_arxiv, observed 2026-08-14T04:44:43.488994Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 48fd80b7-65b1-4065-8c25-795230d6414c · outbound

This paper cites Proceedings of the 40th Annual ACM Symposium on Theory of Computing , series =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Proceedings of the 40th Annual ACM Symposium on Theory of Computing , series =

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.656142Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 740ea224-9649-45c5-8c2d-e6f4b3ea6ed4 · outbound

This paper cites 2026 , month = jul, note =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism 2026 , month = jul, note =

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.645500Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f7c295c8-c5be-49e1-b0a7-505559e288fd · outbound

This paper cites Discrete Applied Mathematics , volume =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Discrete Applied Mathematics , volume =

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.634654Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 5bae94a8-9395-4b0e-b80f-55c284018576 · outbound

This paper cites Computational Complexity , volume =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Computational Complexity , volume =

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.624063Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 18177914-45b2-4a90-b1f4-249229ddb1d3 · outbound

This paper cites Journal of Computer and System Sciences , volume =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Journal of Computer and System Sciences , volume =

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.613684Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a7ba9e99-bbb1-49ea-b7c8-84378662b509 · outbound

This paper cites Journal of Computer and System Sciences , volume =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Journal of Computer and System Sciences , volume =

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.601830Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 0bf2aa7f-ced3-4896-a49d-5579e8fd119b · outbound

This paper cites Ryan Williams , title =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Ryan Williams , title =

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.591184Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b25069db-cb84-4d04-9d6c-ff3cc263e38d · outbound

This paper cites 2026 , note =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism 2026 , note =

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.580234Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation eb07983c-cf53-4d2a-89a4-2d3425c95355 · outbound

This paper cites Kane and R.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Kane and R

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.569465Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation beac17a7-20c9-486b-b685-78e2fab1a136 · outbound

This paper cites The Orthogonal Vectors Conjecture and Nonuniform Circuit Lower Bounds , journal =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism The Orthogonal Vectors Conjecture and Nonuniform Circuit Lower Bounds , journal =

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.558913Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 07d40dfb-b0bd-442f-a626-6d636f8d5e4b · outbound

This paper cites Advances in Cryptology---.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Advances in Cryptology---

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.548440Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c7782df1-8887-4df1-9407-02ecb820d2f8 · outbound

This paper cites Journal of the.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Journal of the

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.536027Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 86211006-ad39-4ac3-a9c2-db8f76704996 · outbound

This paper cites Schwartzbach and Akhil Vanukuri and Prashant Nalini Vasudevan , title =.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Schwartzbach and Akhil Vanukuri and Prashant Nalini Vasudevan , title =

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.524261Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 250bb389-c843-4615-aeee-ab8a0ae4ec7d · outbound

This paper cites Proceedings of the 50th Annual.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Proceedings of the 50th Annual

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.512854Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 5a6fa1eb-406d-44f3-8505-547e8b02f02f · outbound

This paper cites Average-Case Hardness of Parity Problems: Orthogonal Vectors,.

Fine-Grained AC$^0$ Lower Bounds for $k$-OV, $k$-XOR, and $k$-SUM via Colored Subgraph Isomorphism Average-Case Hardness of Parity Problems: Orthogonal Vectors,

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T04:44:43.501700Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Pith citing papers

No inbound Pith citation observations are available.