Paper Citation Record · LEDGER

3-Regular Graphs Are 2-Reconstructible

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

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

pith.paper-citation-record.v1
1908.01258 v1

Coverage vector

measured 12 of 12 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T15:31:30.275291Z

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

12 of 12 outbound references displayed

verified exact0
verified fuzzy7
unresolved5
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation cad526d6-9568-467f-8efc-61905c81da79 · outbound

This paper cites Bollob´ as, Almost every graph has reconstruction num ber three, J.

3-Regular Graphs Are 2-Reconstructible Bollob´ as, Almost every graph has reconstruction num ber three, J

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:31:30.465020Z

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 f57a74a3-e718-41f7-84c0-5486cca56e93 · outbound

This paper cites an unresolved cited work.

3-Regular Graphs Are 2-Reconstructible Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-14T15:31:30.451508Z

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 db703108-2a60-421d-bf3c-c51710f4b05b · outbound

This paper cites Chinn, A graph with p points and enough distinct ( p−2)-order subgraphs is reconstructible, Recent Trends in Graph Theory Lecture Notes in Mathematics 186 (Springer, 1971).

3-Regular Graphs Are 2-Reconstructible Chinn, A graph with p points and enough distinct ( p−2)-order subgraphs is reconstructible, Recent Trends in Graph Theory Lecture Notes in Mathematics 186 (Springer, 1971)

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:31:30.438187Z

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 37904fab-0db5-4c60-8962-aff995b16098 · outbound

This paper cites an unresolved cited work.

3-Regular Graphs Are 2-Reconstructible Unresolved cited work

Reference 4

Resolution: unresolved; raw_fallback, observed 2026-08-14T15:31:30.424855Z

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 c748ba6a-e3cc-4a30-80fa-27ac7987a17b · outbound

This paper cites an unresolved cited work.

3-Regular Graphs Are 2-Reconstructible Unresolved cited work

Reference 5

Resolution: unresolved; raw_fallback, observed 2026-08-14T15:31:30.411989Z

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 de849ee5-f8f6-4513-91c6-8dba44747bf6 · outbound

This paper cites an unresolved cited work.

3-Regular Graphs Are 2-Reconstructible Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-14T15:31:30.398860Z

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 f8afb5db-ab3a-4ba4-abc5-b6796f0792bb · outbound

This paper cites Manvel, Some basic observations on Kelly’s conjectur e for graphs, Discrete Math.

3-Regular Graphs Are 2-Reconstructible Manvel, Some basic observations on Kelly’s conjectur e for graphs, Discrete Math

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:31:30.384460Z

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 4e6298de-94b1-4daa-9b01-5b0305aed86c · outbound

This paper cites McMullen and S.

3-Regular Graphs Are 2-Reconstructible McMullen and S

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:31:30.369053Z

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 6f1dc7d5-f75b-4a96-a4a1-ceaa953481b3 · outbound

This paper cites M¨ uller, Probabilistic reconstruction from subgrap hs, Comment.

3-Regular Graphs Are 2-Reconstructible M¨ uller, Probabilistic reconstruction from subgrap hs, Comment

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:31:30.355029Z

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 d92afa1c-34db-483a-81ce-2f207f710c9e · outbound

This paper cites Spinoza and D.

3-Regular Graphs Are 2-Reconstructible Spinoza and D

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:31:30.340186Z

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 5e56128e-10e2-4e02-b6ea-cd2e8fd75d3b · outbound

This paper cites Taylor, Reconstructing degree sequences from k-vertex-deleted subgraphs.

3-Regular Graphs Are 2-Reconstructible Taylor, Reconstructing degree sequences from k-vertex-deleted subgraphs

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:31:30.325298Z

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 66e1c4de-c7dc-43eb-8b26-20bab51dd69d · outbound

This paper cites an unresolved cited work.

3-Regular Graphs Are 2-Reconstructible Unresolved cited work

Reference 12

Resolution: unresolved; raw_fallback, observed 2026-08-14T15:31:30.310171Z

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.