Paper Citation Record · LEDGER

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems

As of 23 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2501.14554.

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

pith.paper-citation-record.v1
2501.14554 v2

Coverage vector

measured 24 of 24 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T15:12:47.531011Z

measured 24 of 24 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+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

24 of 24 outbound references displayed

verified exact0
verified fuzzy21
unresolved3
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 69a0df4e-8d24-4419-96f6-c0e9b80fa62f · outbound

This paper cites Appel, W.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Appel, W

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.995424Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation cd212cab-28dc-4936-ab1a-e1871b2488bd · outbound

This paper cites Appel, W.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Appel, W

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.966198Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation e626956c-6c51-4904-8baa-fa91fccd95ff · outbound

This paper cites Bandelt, V.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Bandelt, V

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.955657Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 35daf55b-1fbd-4529-9c1f-40d37f23ace0 · outbound

This paper cites Birkhoff, D.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Birkhoff, D

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.925587Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation dfc63b43-9add-4c52-b435-2f33bcb12e34 · outbound

This paper cites Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing 25(6) (1996), 1305–1317.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing 25(6) (1996), 1305–1317

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.913241Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 898c2c64-f40f-4eda-9a0c-4513cc2632a9 · outbound

This paper cites Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret- ical Computer Science 209(1–2) (1998), 1—45.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret- ical Computer Science 209(1–2) (1998), 1—45

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.895081Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation e38743a5-d18a-4eb5-b6c7-0f5c4c637c4d · outbound

This paper cites Dailey, Uniqueness of colorability and colorability of planar 4-regular graphs are N P-complete, Discrete Mathematics 30(3) (1980), 289—293.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Dailey, Uniqueness of colorability and colorability of planar 4-regular graphs are N P-complete, Discrete Mathematics 30(3) (1980), 289—293

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.881933Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 881819bc-ee59-471f-acb8-5c9059134dee · outbound

This paper cites Dinur, S.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Dinur, S

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.865460Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation ec69ed92-5710-4e20-939f-e7746df926f9 · outbound

This paper cites Faulkner, A Relaxed Interpretation of Three Classic Vertex Problems, MSc Thesis, Maastricht University, The Netherlands (2018).

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Faulkner, A Relaxed Interpretation of Three Classic Vertex Problems, MSc Thesis, Maastricht University, The Netherlands (2018)

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.830480Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 1293a881-d6b6-4d11-8050-846a342cccf0 · outbound

This paper cites an unresolved cited work.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Unresolved cited work

Reference 10

Resolution: unresolved; raw_fallback, observed 2026-08-10T15:12:47.812310Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 2619c5b0-96bf-4d1e-8797-a87fe04dec82 · outbound

This paper cites Grigoriev, T.A.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Grigoriev, T.A

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.796616Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation f34e2b6b-c39c-4a55-a186-c898f29859a1 · outbound

This paper cites Hartmann, Facility Location on Graphs, PhD The- sis, R WTH Aachen University, Germany (2022).

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Hartmann, Facility Location on Graphs, PhD The- sis, R WTH Aachen University, Germany (2022)

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.785435Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 76d13069-66c8-45a8-afa5-448d370d2b5f · outbound

This paper cites Hartmann, T.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Hartmann, T

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.733739Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation c91f9dcd-4778-491d-a45b-5c9e721c2c63 · outbound

This paper cites Hartmann, S.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Hartmann, S

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.709716Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 9637cd58-f63a-4f84-8d7b-df95d7dccb37 · outbound

This paper cites Hartmann, D.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Hartmann, D

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.698910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 586d4f62-9fac-4250-b699-0534d735cad1 · outbound

This paper cites Hartmann, S.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Hartmann, S

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.688274Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation d48c6bc5-c1cf-4c2e-b881-4a202d725546 · outbound

This paper cites H ˚ astad, Clique is hard to approximate withinn1−ε, Acta Mathematica 182 (1999), 105–142.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems H ˚ astad, Clique is hard to approximate withinn1−ε, Acta Mathematica 182 (1999), 105–142

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.676542Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation ab721497-139d-4997-8f0a-a2f45b7e3190 · outbound

This paper cites Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, Plenum Press, 1972.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, Plenum Press, 1972

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.662924Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 7bb162d2-3003-4f1f-9f3f-c29f078e49d9 · outbound

This paper cites an unresolved cited work.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Unresolved cited work

Reference 19

Resolution: unresolved; raw_fallback, observed 2026-08-10T15:12:47.645436Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 288e32da-7877-46b3-95a2-fc7bae34f1a3 · outbound

This paper cites Megiddo, A.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Megiddo, A

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.631575Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 597bec07-668e-4706-af65-6fab98da1246 · outbound

This paper cites What is actually a metric graph?.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems What is actually a metric graph?

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-10T15:12:47.514478Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b70d094-6289-4134-b393-810eb866ac06 · outbound

This paper cites Robertson, D.P.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Robertson, D.P

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.609620Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 02581d02-eb7f-466e-97c0-798a2f63e077 · outbound

This paper cites Seymour, R.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Seymour, R

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.598075Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Observation 52ffe264-37eb-49aa-8b00-ee428767e3c8 · outbound

This paper cites Zuckerman, Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number.

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems Zuckerman, Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:12:47.585903Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

Pith citing papers

No inbound Pith citation observations are available.