Pith. sign in

Paper Citation Record · LEDGER

Characterizing graphs with high inducibility

As of 13 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 3 inbound Pith citation observations for arXiv:2411.17362.

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

pith.paper-citation-record.v1
2411.17362 v1

Coverage vector

measured 13 of 13 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T12:20:50.793015Z

measured 16 of 16 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 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-01T07:34:20.851377Z

measured 1 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

13 of 13 outbound references displayed

  • verified exact5
  • verified fuzzy1
  • unresolved6
  • parse uncertain0
  • malformed identifier1
  • metadata mismatch0

External citation measurements

1
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

Observation 9eca67c5-ee4c-42c9-bdad-a2863a587f7e · outbound

This paper cites an unresolved cited work.

Characterizing graphs with high inducibility Unresolved cited work

Reference 1

Resolution
verified exact
doi, observed 2026-08-12T12:20:51.380216Z

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.

source=pdf_text observed=2026-08-12T12:20:50.660438Z digest=sha256:c2d5e06ce7f44d24e44c3b5e7d63008a2ffcdc7c9fd6d5cf57812e1a9f72ada4

Observation 3f713ea9-562b-4015-b84b-8c8ab8f4786a · outbound

This paper cites Balogh, P.

Characterizing graphs with high inducibility Balogh, P

Reference 2

Resolution
verified exact
doi, observed 2026-08-12T12:20:51.338022Z

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.

source=pdf_text observed=2026-08-12T12:20:50.668854Z digest=sha256:14ade0b4bb026de3be052e1be361e03ce00512751026904a6491040ca572752f

Observation 2a94f9af-3446-4ae8-a734-713f968b2f15 · outbound

This paper cites Fox and L.

Characterizing graphs with high inducibility Fox and L

Reference 3

Resolution
verified exact
doi, observed 2026-08-12T12:20:51.308139Z

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.

source=pdf_text observed=2026-08-12T12:20:50.676856Z digest=sha256:423b84ae0a060851e3dfe6a4fe817ec8bea6317c57ce5b57ba0f3a98fd8efd2b

Observation 85347cfa-5050-492e-9d8b-4373f5c52b3c · outbound

This paper cites Hefetz and M.

Characterizing graphs with high inducibility Hefetz and M

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-12T12:20:50.685315Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T12:20:50.685315Z digest=sha256:e6e07251a03da4084b717ba4dedde7822ca433aa8fa76c408f54da0d12189a69

Observation 3a961c78-5797-4f2e-8252-581abccaf8f9 · outbound

This paper cites Janson, T.

Characterizing graphs with high inducibility Janson, T

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-12T12:20:50.691870Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T12:20:50.691870Z digest=sha256:1d37304ff1dc12409197fcd47cc99af82a556c88151ec58a7f41b5069f918247

Observation 58eb2b30-2091-4d5f-8549-8d5a8069f7da · outbound

This paper cites Král’, S.

Characterizing graphs with high inducibility Král’, S

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-12T12:20:50.705636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T12:20:50.705636Z digest=sha256:0d0877708a3bd79487f72eac1ac0ca4ee022e3811fe3c47d9ac4f8aa34611049

Observation 9120eefe-be07-4042-a9d6-63aa27e5aed1 · outbound

This paper cites an unresolved cited work.

Characterizing graphs with high inducibility Unresolved cited work

Reference 7

Resolution
verified exact
doi, observed 2026-08-12T12:20:51.195681Z

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.

source=pdf_text observed=2026-08-12T12:20:50.723714Z digest=sha256:3035674a3c70db4fcb4ba1eb3adef5b1c8a9db7d441afb1b24bceebdc254b789

Observation 6f724f7b-cb01-4cc1-a313-af6879e7e32e · outbound

This paper cites Martinsson, F.

Characterizing graphs with high inducibility Martinsson, F

Reference 8

Resolution
verified exact
doi, observed 2026-08-12T12:20:51.168104Z

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.

source=pdf_text observed=2026-08-12T12:20:50.733148Z digest=sha256:158c609c62274b39eda77c53d48a985578b8d5c4ed3fcde4d6f6cfc2507a677c

Observation 82776b2d-c8b6-4e60-8f7c-89573d565fcf · outbound

This paper cites Pippenger and M.

Characterizing graphs with high inducibility Pippenger and M

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-12T12:20:50.743001Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T12:20:50.743001Z digest=sha256:00049dc899bebff083e6fc267c75eab95ff12a47230a33e3c3a870a6d31f0837

Observation 0b0243ee-4bc9-4793-a091-84693d006c96 · outbound

This paper cites Robbins.A remark on Stirling’s formula.

Characterizing graphs with high inducibility Robbins.A remark on Stirling’s formula

Reference 10

Resolution
malformed identifier
raw_fallback, observed 2026-08-12T12:20:51.501517Z

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.

source=pdf_text observed=2026-08-12T12:20:50.751546Z digest=sha256:8d3941c185aa3a8d9249147acd2f965e4a731bed09e297f3279bd3913948686b

Observation 91269cf1-ede3-4760-9c65-dd854acfc320 · outbound

This paper cites an unresolved cited work.

Characterizing graphs with high inducibility Unresolved cited work

Reference 11

Resolution
unresolved
raw_fallback, observed 2026-08-12T12:20:51.460942Z

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.

source=pdf_text observed=2026-08-12T12:20:50.776264Z digest=sha256:8fd86066b696e6d304b8256b765b31515fcd43982e1b45135feeb0bd69c3618d

Observation 2ea7a530-6aac-4bcd-b005-571bc77db079 · outbound

This paper cites Yuster.On the exact maximum induced density of almost all graphs and their inducibility.

Characterizing graphs with high inducibility Yuster.On the exact maximum induced density of almost all graphs and their inducibility

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-12T12:20:50.785340Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T12:20:50.785340Z digest=sha256:04c48b6c908444f5cf1e4dec3050f41231d0956b805786b5b49b7bc3a512ce74

Observation d652bc23-3cfc-447b-be6c-495ee05c5591 · outbound

This paper cites If P[Zf = s] = 0, the claim is trivial.

Characterizing graphs with high inducibility If P[Zf = s] = 0, the claim is trivial

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T12:20:51.425766Z

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.

source=pdf_text observed=2026-08-12T12:20:50.793015Z digest=sha256:70b965615b435a44025d30cc3213faecc5d477641ca4c737d80c14fb4edd685f

Pith citing papers

Observation e391024a-3508-4339-81a4-a3df900afeb7 · inbound

The inducibility of 6-vertex graphs cites this paper.

The inducibility of 6-vertex graphs Characterizing graphs with high inducibility

Reference 53

Resolution
verified exact
arxiv_id, observed 2026-06-28T22:22:42.847012Z

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.

source=pdf_text observed=2026-06-28T21:44:05.246033Z digest=sha256:5f1abff2a09adbfb4ba703b00da3a869df3018005032fe1c4433ea792285f00e

Observation 10af7838-6a6c-4c25-8fd5-036a7c1f6dd7 · inbound

The inducibility of 6-vertex graphs cites this paper.

The inducibility of 6-vertex graphs Characterizing graphs with high inducibility

Reference 53

Resolution
verified exact
arxiv_id, observed 2026-07-01T07:35:28.173092Z

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.

source=pdf_text observed=2026-07-01T07:34:20.851377Z digest=sha256:4dfc7a2372ea53129ac845e960dd70f0dc6e971b5231e1c73f6a8cbc22330205

Observation f9fc7b8d-5ed3-4b68-8818-40812dacf519 · inbound

Exact extremal constructions for the inducibility of blowup graphs cites this paper.

Exact extremal constructions for the inducibility of blowup graphs Characterizing graphs with high inducibility

Reference 18

Resolution
verified exact
arxiv_id, observed 2026-07-02T14:17:03.071224Z

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.

source=pdf_text observed=2026-06-28T00:34:56.072813Z digest=sha256:9b119f4556a2ddb49a9f5ea23c83ae8b66f3a0711ced120c4d65a9e793d371ae