Paper Citation Record · LEDGER

Testing APS conjecture on regular graphs

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

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

pith.paper-citation-record.v1
2507.10050 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-06T17:49:46.887759Z

measured 33 of 33 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+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 exact4
verified fuzzy15
unresolved14
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation df07c871-447b-415b-93b5-253d14756ddd · outbound

This paper cites an unresolved cited work.

Testing APS conjecture on regular graphs Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-06T17:49:47.907542Z

Source-reported events for the cited work

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

Observation 8aecb504-c149-4dee-aa98-9f704d7f2c40 · outbound

This paper cites an unresolved cited work.

Testing APS conjecture on regular graphs Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-06T17:49:47.959847Z

Source-reported events for the cited work

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

Observation 3638e151-1984-4054-b97b-5958fa229817 · outbound

This paper cites Label the resulting graph by Gk p.

Testing APS conjecture on regular graphs Label the resulting graph by Gk p

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.858427Z

Source-reported events for the cited work

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

Observation 6b07fd9d-c766-4d90-a528-ce9b9cca1d4c · outbound

This paper cites [https://iopscience.iop.org/article/10.1088/1367-2630/10/7/073013].

Testing APS conjecture on regular graphs [https://iopscience.iop.org/article/10.1088/1367-2630/10/7/073013]

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-06T17:49:44.986301Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b56cfe8a-ccc9-4de3-8ca8-73db56df502e · outbound

This paper cites an unresolved cited work.

Testing APS conjecture on regular graphs Unresolved cited work

Reference 5

Resolution: unresolved; raw_fallback, observed 2026-08-06T17:49:47.887727Z

Source-reported events for the cited work

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

Observation 96f44512-903b-4a18-84bb-5d14a4f11d9c · outbound

This paper cites [https://arxiv.org/abs/2401.03616].

Testing APS conjecture on regular graphs [https://arxiv.org/abs/2401.03616]

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-06T17:49:45.143792Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1affe8e9-a6e0-4d36-9aeb-03878b8f5964 · outbound

This paper cites an unresolved cited work.

Testing APS conjecture on regular graphs Unresolved cited work

Reference 7

Resolution: unresolved; raw_fallback, observed 2026-08-06T17:49:47.841452Z

Source-reported events for the cited work

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

Observation 32fda5f4-366b-4e34-ab68-7edb459389b6 · outbound

This paper cites Delete the following edges to get a quasi-complete graph H wk+2 k+1 : H wk+2 k+2 = Kk+2 −   (k−3)/2[ i=0 {w2i+1w2i+2}   ∪ {wkwk+2, wk+1wk+2}.

Testing APS conjecture on regular graphs Delete the following edges to get a quasi-complete graph H wk+2 k+1 : H wk+2 k+2 = Kk+2 −   (k−3)/2[ i=0 {w2i+1w2i+2}   ∪ {wkwk+2, wk+1wk+2}

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.825016Z

Source-reported events for the cited work

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

Observation e670481a-0032-4fa9-b1e2-e09df078abc7 · outbound

This paper cites Then connect v with each xj.

Testing APS conjecture on regular graphs Then connect v with each xj

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.807036Z

Source-reported events for the cited work

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

Observation cac3b18b-2ae8-4dcb-abd6-e469c479d96c · outbound

This paper cites Therefore, we choose one rotation angle θ1 for the internal edges of H x,y k+1, and θ2 for the remaining ones.

Testing APS conjecture on regular graphs Therefore, we choose one rotation angle θ1 for the internal edges of H x,y k+1, and θ2 for the remaining ones

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.788125Z

Source-reported events for the cited work

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

Observation 1232a0b5-fc17-4e91-83d0-8acf95abba32 · outbound

This paper cites We assign θ1, θ2 and θ3 to them respectively.

Testing APS conjecture on regular graphs We assign θ1, θ2 and θ3 to them respectively

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.769396Z

Source-reported events for the cited work

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

Observation 23181b29-27f5-49ba-9503-5104134808b4 · outbound

This paper cites Fractional Entanglement Distribution.

Testing APS conjecture on regular graphs Fractional Entanglement Distribution

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.925570Z

Source-reported events for the cited work

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

Observation 403ac2d6-c86b-44de-ae18-9c405c964139 · outbound

This paper cites an unresolved cited work.

Testing APS conjecture on regular graphs Unresolved cited work

Reference 13

Resolution: unresolved; raw_fallback, observed 2026-08-06T17:49:47.942298Z

Source-reported events for the cited work

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

Observation a8053ec5-a024-42ac-bf0a-0e5ae6bd0860 · outbound

This paper cites Goemans and D.P.

Testing APS conjecture on regular graphs Goemans and D.P

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.749702Z

Source-reported events for the cited work

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

Observation 3bda2079-cc97-4e71-b700-a1e359d0e0eb · outbound

This paper cites Lasserre, 2002, An explicit equivalent positive semidefinite program for nonlinear 0-1 programs, SIAM J.

Testing APS conjecture on regular graphs Lasserre, 2002, An explicit equivalent positive semidefinite program for nonlinear 0-1 programs, SIAM J

Reference 16

Resolution: verified exact; doi, observed 2026-08-06T17:49:47.108670Z

Source-reported events for the cited work

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

Observation 10883f3b-a1cb-4e47-b6eb-23c5dc1fb0eb · outbound

This paper cites an unresolved cited work.

Testing APS conjecture on regular graphs Unresolved cited work

Reference 17

Resolution: unresolved; raw_fallback, observed 2026-08-06T17:49:47.724844Z

Source-reported events for the cited work

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

Observation cbeb673c-75c2-44f6-b69f-55173e56f320 · outbound

This paper cites Distributed Entanglement.

Testing APS conjecture on regular graphs Distributed Entanglement

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-06T17:49:45.208409Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35b75ebd-0f4f-48b7-911c-702a8e5361f2 · outbound

This paper cites Conjectured Bounds for 2-Local Hamiltonians via Token Graphs.

Testing APS conjecture on regular graphs Conjectured Bounds for 2-Local Hamiltonians via Token Graphs

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-06T17:49:45.309355Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7895b0bb-7966-4773-9d25-9d4b883b5921 · outbound

This paper cites Monogamy of Entanglement Bounds and Improved Approximation Algorithms for Qudit Hamiltonians.

Testing APS conjecture on regular graphs Monogamy of Entanglement Bounds and Improved Approximation Algorithms for Qudit Hamiltonians

Reference 20

Resolution: verified exact; local_arxiv, observed 2026-08-06T17:49:47.296448Z

Source-reported events for the cited work

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

Observation a82a08e4-dada-488d-be21-7f68c9279c95 · outbound

This paper cites Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs.

Testing APS conjecture on regular graphs Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-06T17:49:45.534503Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 73d4837b-c3f6-4c41-b635-8440844269b9 · outbound

This paper cites Henning, Anders Yeo, 2007, Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph, Graphs and Combinatorics 23:647¨C657 (2007).

Testing APS conjecture on regular graphs Henning, Anders Yeo, 2007, Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph, Graphs and Combinatorics 23:647¨C657 (2007)

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.706397Z

Source-reported events for the cited work

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

Observation e5660389-5d92-4c93-8052-873dc2da9340 · outbound

This paper cites Improved approximation algorithms for the EPR Hamiltonian.

Testing APS conjecture on regular graphs Improved approximation algorithms for the EPR Hamiltonian

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-06T17:49:45.673404Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3abc9dfe-69e1-4f64-b8ea-997b5ba01d09 · outbound

This paper cites Tutte, 1947, The factorization of linear graphs, Journal of the London Mathematical Society , 22 (1947), 107¨C111.

Testing APS conjecture on regular graphs Tutte, 1947, The factorization of linear graphs, Journal of the London Mathematical Society , 22 (1947), 107¨C111

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.686105Z

Source-reported events for the cited work

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

Observation 98d7f5f3-8029-4f57-87e4-9ae60abb2215 · outbound

This paper cites Berge, 1958, Sur le couplage maximum d’ un graphe,Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences (Paris) Sér.

Testing APS conjecture on regular graphs Berge, 1958, Sur le couplage maximum d’ un graphe,Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences (Paris) Sér

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.666702Z

Source-reported events for the cited work

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

Observation 1907aee2-48e2-40ec-8850-8846d3060ee4 · outbound

This paper cites Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality.

Testing APS conjecture on regular graphs Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality

Reference 28

Resolution: verified exact; local_arxiv, observed 2026-08-06T17:49:47.194919Z

Source-reported events for the cited work

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

Observation 6810fc0d-e680-431e-98c9-7b866f894e01 · outbound

This paper cites 16 Appendix A: King Formulae First we repeat some definitions.

Testing APS conjecture on regular graphs 16 Appendix A: King Formulae First we repeat some definitions

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.647379Z

Source-reported events for the cited work

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

Observation fd37e7d3-14f7-45e5-b177-d65b7c8ca825 · outbound

This paper cites (A8) where K ≡ {k ∈ VG : k ∼ i, k̸= j}, L ≡ {l ∈ VG : l ∼ j, l̸= i}, (A9) and T ≡ {t ∈ VG : t ∼ i, t∼ j}.

Testing APS conjecture on regular graphs (A8) where K ≡ {k ∈ VG : k ∼ i, k̸= j}, L ≡ {l ∈ VG : l ∼ j, l̸= i}, (A9) and T ≡ {t ∈ VG : t ∼ i, t∼ j}

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.630915Z

Source-reported events for the cited work

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

Observation 376b91c9-4d87-43f8-b034-e94deb95c56b · outbound

This paper cites Thus ⟨χ|ZiZj|χ⟩ = 1 2 1 + (cos2 2θ − sin2 2θ)n−2.

Testing APS conjecture on regular graphs Thus ⟨χ|ZiZj|χ⟩ = 1 2 1 + (cos2 2θ − sin2 2θ)n−2

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.614009Z

Source-reported events for the cited work

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

Observation d08d69ea-8005-497a-96bd-3758ffb26feb · outbound

This paper cites H x,y k+1 for even k are very close to Kk+1, while H x k+2 for odd k are very close to Kk+2.

Testing APS conjecture on regular graphs H x,y k+1 for even k are very close to Kk+1, while H x k+2 for odd k are very close to Kk+2

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.594168Z

Source-reported events for the cited work

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

Observation 5cd3b916-7c27-4d87-b655-802d11e6d2ea · outbound

This paper cites An Improved Approximation Algorithm for Quantum Max-Cut.

Testing APS conjecture on regular graphs An Improved Approximation Algorithm for Quantum Max-Cut

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-06T17:49:46.654275Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2cff9f8-ecbc-4b98-85af-2d69184e41c4 · outbound

This paper cites Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings.

Testing APS conjecture on regular graphs Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-06T17:49:46.739771Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6e1d3549-37e2-4fc0-943e-38d752a66b48 · outbound

This paper cites A Refined Algorithm For the EPR model.

Testing APS conjecture on regular graphs A Refined Algorithm For the EPR model

Reference 35

Resolution: verified exact; local_arxiv, observed 2026-08-06T17:49:47.218143Z

Source-reported events for the cited work

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

Observation 45d7d6aa-ddd5-44cd-aa17-9d6510859ddf · outbound

This paper cites Henning, Anders Yeo, 2007, Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph, Graphs and Combinatorics 23:647¨C657 (2007).

Testing APS conjecture on regular graphs Henning, Anders Yeo, 2007, Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph, Graphs and Combinatorics 23:647¨C657 (2007)

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:49:47.566225Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.