Paper Citation Record · LEDGER

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials

As of 12 August 2026, this Paper Citation Record lists 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:2511.03388.

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

pith.paper-citation-record.v1
2511.03388 v2

Coverage vector

measured 7 of 7 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T00:11:06.710276Z

measured 7 of 7 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 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

7 of 7 outbound references displayed

verified exact1
verified fuzzy0
unresolved6
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d55f8d98-9cfa-44cf-90e7-62cf87b220d9 · outbound

This paper cites Monotone Bounded-Depth Complexity of Homomorphism Polynomials.

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials Monotone Bounded-Depth Complexity of Homomorphism Polynomials

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T00:11:05.712852Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b55b91a-05ae-4207-9c36-66afb00893fa · outbound

This paper cites Robustly Sepa- rating the Arithmetic Monotone Hierarchy via Graph Inner-Product.

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials Robustly Sepa- rating the Arithmetic Monotone Hierarchy via Graph Inner-Product

Reference 2

Resolution: verified exact; doi, observed 2026-08-04T00:14:09.918849Z

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.

Observation f737f084-87a3-4058-b0f9-33da22cf1c4f · outbound

This paper cites Homomorphism Tensors and Linear Equations.

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials Homomorphism Tensors and Linear Equations

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T00:11:06.027366Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd37836c-9551-4520-8db5-a98ae86ceb4d · outbound

This paper cites Completeness for VP and VNP from Graph Homomorphism.

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials Completeness for VP and VNP from Graph Homomorphism

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T00:11:06.136653Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ea5b784-802e-4502-ac08-ba9f8dda30f8 · outbound

This paper cites Graph Homomorphism and Natural VNP-Complete Families.

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials Graph Homomorphism and Natural VNP-Complete Families

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T00:11:06.373066Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48669a75-cc66-475d-92cf-01825cca6f2b · outbound

This paper cites On monotone formulae with restricted depth.

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials On monotone formulae with restricted depth

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T00:11:06.543642Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 314c679c-6518-4f0b-a727-3b2ab6176a5e · outbound

This paper cites Monotone Arithmetic Com- plexity of Graph Homomorphism Polynomials.

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials Monotone Arithmetic Com- plexity of Graph Homomorphism Polynomials

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T00:11:06.710276Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.