Paper Citation Record · LEDGER

Forcing Graphs to be Forcing

As of 14 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2412.12904.

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

pith.paper-citation-record.v1
2412.12904 v1

Coverage vector

measured 30 of 30 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T13:49:22.942207Z

measured 31 of 31 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-06-30T05:36:13.291635Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-06-30T14:14:45.997579Z

Reference resolution

30 of 30 outbound references displayed

verified exact1
verified fuzzy22
unresolved5
parse uncertain0
malformed identifier0
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 34f8010c-35ce-45a7-b815-c73806398009 · outbound

This paper cites Combinatorics, Probabili ty and Computing 29(1), 44–67 (2020).

Forcing Graphs to be Forcing Combinatorics, Probabili ty and Computing 29(1), 44–67 (2020)

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-11T13:49:22.724438Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0184c32b-e31f-45c1-8ced-4bea26484e71 · outbound

This paper cites Combinatorica 40(4), 455–471 (2020).

Forcing Graphs to be Forcing Combinatorica 40(4), 455–471 (2020)

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.861688Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 00c0bf7f-c43d-4e10-8a0a-8b35fabf0552 · outbound

This paper cites Combinatorica 9, 345–362 (1989) 18.

Forcing Graphs to be Forcing Combinatorica 9, 345–362 (1989) 18

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.820338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation e244acfd-ecbf-4c09-a338-6d157fa76bce · outbound

This paper cites Geo- metric and Functional Analysis 20, 1354–1366 (2010).

Forcing Graphs to be Forcing Geo- metric and Functional Analysis 20, 1354–1366 (2010)

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.779275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation cece9346-8de0-44d0-8178-286404abf56a · outbound

This paper cites Random Structures & Algorithms 40(1), 1–38 (2012).

Forcing Graphs to be Forcing Random Structures & Algorithms 40(1), 1–38 (2012)

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.754916Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation ea9ed00f-e946-45e6-99d6-05c9ad2ada3a · outbound

This paper cites Journal of the London Mathematical Society 98(3), 593–608 (2018).

Forcing Graphs to be Forcing Journal of the London Mathematical Society 98(3), 593–608 (2018)

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.741183Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation df7eccff-000c-46e9-b9ea-f8d17b011ac6 · outbound

This paper cites Advances in Mathematics 315, 130–165 (2017).

Forcing Graphs to be Forcing Advances in Mathematics 315, 130–165 (2017)

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.710059Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 80ac81b1-82fc-45c1-b770-a2871c548cd3 · outbound

This paper cites Discrete Analysis (mar 30 2021).

Forcing Graphs to be Forcing Discrete Analysis (mar 30 2021)

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-11T13:49:22.779242Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 005d8c29-1ba0-42c9-9daa-e3385656552c · outbound

This paper cites International Mathematics Research Notices 2024(13), 10285–10297 (04 2024).

Forcing Graphs to be Forcing International Mathematics Research Notices 2024(13), 10285–10297 (04 2024)

Reference 9

Resolution: verified exact; doi, observed 2026-08-11T13:49:23.004312Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation afde11a6-ce22-436d-a893-477991f56d4f · outbound

This paper cites Russian Mathematical Surveys 75(4), 627 (2020).

Forcing Graphs to be Forcing Russian Mathematical Surveys 75(4), 627 (2020)

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.674149Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 827537b2-71ed-4bdb-a549-ffd1b61d79d4 · outbound

This paper cites Non-trivial squares and Sidorenko's conjecture.

Forcing Graphs to be Forcing Non-trivial squares and Sidorenko's conjecture

Reference 11

Resolution: metadata mismatch; local_arxiv, observed 2026-08-11T13:49:23.248212Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation a0ac445b-21a6-4664-bf3c-af2ad1296bb0 · outbound

This paper cites Journal of Pure and Applied Algebra 192(1-3), 95–128 (2004).

Forcing Graphs to be Forcing Journal of Pure and Applied Algebra 192(1-3), 95–128 (2004)

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.661770Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation a31fc7ea-4983-4978-a414-0e75e531fda9 · outbound

This paper cites The American Mathematical Monthly 66(9), 778–783 (1959).

Forcing Graphs to be Forcing The American Mathematical Monthly 66(9), 778–783 (1959)

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.629486Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 6a4c0650-51ce-4c4f-adba-69984c97da82 · outbound

This paper cites Electronic Notes in Discrete Mathematics 38, 437–442 (2011).

Forcing Graphs to be Forcing Electronic Notes in Discrete Mathematics 38, 437–442 (2011)

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.585858Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 46a43c11-6cda-45b0-967b-041f9413ee17 · outbound

This paper cites Is rael Journal of Mathematics 175, 125–150 (2010).

Forcing Graphs to be Forcing Is rael Journal of Mathematics 175, 125–150 (2010)

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.561444Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 711a4645-44f5-4aa1-a291-7fd12bdc5fb3 · outbound

This paper cites Sidorenko's conjecture for subdivisions and theta substitutions.

Forcing Graphs to be Forcing Sidorenko's conjecture for subdivisions and theta substitutions

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-11T13:49:22.842105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dcb48385-f38f-4141-9793-2bcd8176ffd6 · outbound

This paper cites In: Proceedings of Discrete Mathematics Days (2024).

Forcing Graphs to be Forcing In: Proceedings of Discrete Mathematics Days (2024)

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.536836Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 0b561347-a31f-45de-a803-a8b1c8238494 · outbound

This paper cites Transactions of the American Mathematical Society 368(7), 5057–5074 (2016).

Forcing Graphs to be Forcing Transactions of the American Mathematical Society 368(7), 5057–5074 (2016)

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.514461Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 3f207e1a-a71f-4051-a907-a0353bf25267 · outbound

This paper cites Journal of Combinatorial Theory, Series B 100(2), 151–160 (2010) 19.

Forcing Graphs to be Forcing Journal of Combinatorial Theory, Series B 100(2), 151–160 (2010) 19

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.482318Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation ca08c45f-e04b-4f89-9632-a60aa0151815 · outbound

This paper cites On the logarithimic calculus and Sidorenko's conjecture.

Forcing Graphs to be Forcing On the logarithimic calculus and Sidorenko's conjecture

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-11T13:49:22.873963Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation baf985d1-b679-40fe-bb98-1520ea8a57d6 · outbound

This paper cites Journal of Combinatorial Theory, Series B 96(6), 933–957 (2006).

Forcing Graphs to be Forcing Journal of Combinatorial Theory, Series B 96(6), 933–957 (2006)

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.453427Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 80aff30f-4d95-4227-bdb8-423157803b4c · outbound

This paper cites Sidorenko Hypergraphs and Random Tur\'an Numbers.

Forcing Graphs to be Forcing Sidorenko Hypergraphs and Random Tur\'an Numbers

Reference 22

Resolution: metadata mismatch; local_arxiv, observed 2026-08-11T13:49:23.132333Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation fbfc5c61-9bbd-4f1a-96f7-ee534df51c88 · outbound

This paper cites Algebraic Combinatorics 1(2), 249–274 (2018).

Forcing Graphs to be Forcing Algebraic Combinatorics 1(2), 249–274 (2018)

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.428459Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 9e5bc784-893c-4666-93ee-7d37a9f1ca42 · outbound

This paper cites The Journal of Symbolic Logic 72(4), 1239–1282 (2007).

Forcing Graphs to be Forcing The Journal of Symbolic Logic 72(4), 1239–1282 (2007)

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.409250Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 30548642-73f3-4215-ab52-95b7fd3c333f · outbound

This paper cites In: Forum of Mathemat- ics, Sigma.

Forcing Graphs to be Forcing In: Forum of Mathemat- ics, Sigma

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.385167Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 108619f3-e9eb-43dc-9d18-48b52eedc37a · outbound

This paper cites Graphs and Combinatorics 9(2), 201–204 (1993).

Forcing Graphs to be Forcing Graphs and Combinatorics 9(2), 201–204 (1993)

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.361322Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 272e42df-5416-44dc-b34f-3e824148947f · outbound

This paper cites Progress in graph theory (Waterloo, Ont., 198 2) pp.

Forcing Graphs to be Forcing Progress in graph theory (Waterloo, Ont., 198 2) pp

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.333143Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 6ad8ce19-d766-4c46-9bc0-f3b6245bf6a0 · outbound

This paper cites Graphs and Combina- torics 20, 255–262 (2004).

Forcing Graphs to be Forcing Graphs and Combina- torics 20, 255–262 (2004)

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.305988Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 3225c6ae-ce35-47eb-9203-89e74d0836db · outbound

This paper cites An information theoretic approach to Sidorenko's conjecture.

Forcing Graphs to be Forcing An information theoretic approach to Sidorenko's conjecture

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-11T13:49:22.935622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1978523e-45d9-489c-b0be-58cd86676c97 · outbound

This paper cites math.tau.ac.il/~yuvalwig/math/expository/HypergraphSidorenko.pdf 20.

Forcing Graphs to be Forcing math.tau.ac.il/~yuvalwig/math/expository/HypergraphSidorenko.pdf 20

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T13:49:23.278897Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Pith citing papers

Observation d48820ba-2347-41ee-ab10-07b3a97f7465 · inbound

$L^p$-form of the KNRS conjecture cites this paper.

$L^p$-form of the KNRS conjecture Forcing Graphs to be Forcing

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-06-30T14:14:45.999247Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.