Paper Citation Record · LEDGER

On the number of edges of restricted matchstick graphs

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

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

pith.paper-citation-record.v1
2506.01589 v1

Coverage vector

measured 11 of 11 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:53:36.180956Z

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

11 of 11 outbound references displayed

verified exact0
verified fuzzy7
unresolved4
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation eae66131-38a5-4849-908b-5b143be2635b · outbound

This paper cites an unresolved cited work.

On the number of edges of restricted matchstick graphs Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:53:39.476925Z

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 97da7298-76f3-41db-a748-1ee35467f41d · outbound

This paper cites (2017).Triangle-free penny graphs: degeneracy, choosability, and edge count.In International Symposium on Graph Drawing and Network Visualization (pp.

On the number of edges of restricted matchstick graphs (2017).Triangle-free penny graphs: degeneracy, choosability, and edge count.In International Symposium on Graph Drawing and Network Visualization (pp

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:53:39.209298Z

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 faea6bf3-4f8f-4076-9e2d-459343649553 · outbound

This paper cites (1946).On sets of distances ofnpoints.The American Mathematical Monthly, 53(5), 248–250.

On the number of edges of restricted matchstick graphs (1946).On sets of distances ofnpoints.The American Mathematical Monthly, 53(5), 248–250

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:53:38.894106Z

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 3e69579c-033b-45ac-8656-80a5e5970bb3 · outbound

This paper cites (2024).1-planar unit distance graphs.In 32nd International Sympo- sium on Graph Drawing and Network Visualization.

On the number of edges of restricted matchstick graphs (2024).1-planar unit distance graphs.In 32nd International Sympo- sium on Graph Drawing and Network Visualization

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:53:38.634808Z

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 df4b1494-0ebf-4485-9fea-df199a9ace49 · outbound

This paper cites (1974).Solution to problem 664A.Elemente der Mathematik, 29, 14–15.

On the number of edges of restricted matchstick graphs (1974).Solution to problem 664A.Elemente der Mathematik, 29, 14–15

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:53:38.222333Z

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 cf019548-75ff-4d6d-aa9e-630942b5415a · outbound

This paper cites an unresolved cited work.

On the number of edges of restricted matchstick graphs Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:53:37.792265Z

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 0caf185f-5a56-4953-9408-c54ed125c38c · outbound

This paper cites (1994).Match sticks in the plane.In The Lighter Side of Mathematics.

On the number of edges of restricted matchstick graphs (1994).Match sticks in the plane.In The Lighter Side of Mathematics

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:53:37.471802Z

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 4037dca4-739a-47a2-81f3-d5219819aee3 · outbound

This paper cites (1992).Tiling polygons with parallelograms.Discrete and Com- putational Geometry, 7(2), 175–188.

On the number of edges of restricted matchstick graphs (1992).Tiling polygons with parallelograms.Discrete and Com- putational Geometry, 7(2), 175–188

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:53:37.206276Z

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 ddb07efb-79f1-4808-af9d-4c6226ae6cfb · outbound

This paper cites (1993).Tiling a polygon with parallelograms.Algorithmica, 9, 382–397.

On the number of edges of restricted matchstick graphs (1993).Tiling a polygon with parallelograms.Algorithmica, 9, 382–397

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:53:36.964184Z

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 f9d8906e-859f-47c2-91f3-f6ee637636c2 · outbound

This paper cites an unresolved cited work.

On the number of edges of restricted matchstick graphs Unresolved cited work

Reference 10

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:53:36.679278Z

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 1cc9b507-eeb2-44e2-8a51-ac916bb7a045 · outbound

This paper cites an unresolved cited work.

On the number of edges of restricted matchstick graphs Unresolved cited work

Reference 11

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:53:36.377522Z

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.