Paper Citation Record · LEDGER

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing

As of 20 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2505.10789.

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

pith.paper-citation-record.v1
2505.10789 v3

Coverage vector

measured 21 of 21 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T21:12:09.205461Z

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+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

21 of 21 outbound references displayed

verified exact8
verified fuzzy2
unresolved9
parse uncertain0
malformed identifier1
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ec35299e-c3ef-40f9-bde8-94f61eead32e · outbound

This paper cites Goodrich, Pedro Matias, and Martha C.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing Goodrich, Pedro Matias, and Martha C

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T21:12:09.921177Z

Source-reported events for the cited work

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

Observation 7d518587-c77b-49aa-9fe1-657de6c84fac · outbound

This paper cites ISSN: 1868-8969.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing ISSN: 1868-8969

Reference 3

Resolution: verified exact; doi, observed 2026-08-15T21:12:09.326579Z

Source-reported events for the cited work

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

Observation 99424ea0-9073-4787-9680-6895bbf72bbe · outbound

This paper cites Cuthill and J.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing Cuthill and J

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T21:12:09.910654Z

Source-reported events for the cited work

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

Observation bc0f78ee-2a34-46ba-9d79-5c149093ef17 · outbound

This paper cites 24 Anupam Gupta.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing 24 Anupam Gupta

Reference 12

Resolution: verified exact; raw_fallback, observed 2026-08-15T21:12:09.546603Z

Source-reported events for the cited work

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

Observation 994b851a-3d45-4df5-97cc-f7c3d8d78ca4 · outbound

This paper cites ISSN: 1868-8969.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing ISSN: 1868-8969

Reference 18

Resolution: verified exact; doi, observed 2026-08-15T21:12:09.237554Z

Source-reported events for the cited work

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

Observation 834e492b-e292-4edd-80e2-582134d3ea1f · outbound

This paper cites Novel approach to neutron electric dipole moment search using weak measurement.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing Novel approach to neutron electric dipole moment search using weak measurement

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-15T21:12:09.205461Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 86d6c638-f0ff-4cc5-a7dd-e991d15479cf · outbound

This paper cites 14 Alberto Debiasi, Bruno Simoes, and Raffaele De Amicis.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing 14 Alberto Debiasi, Bruno Simoes, and Raffaele De Amicis

Reference 1969

Resolution: unresolved; no resolver link, observed 2026-08-15T21:12:09.161173Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf53fb30-9cf0-4986-afde-3ae0c8124fbc · outbound

This paper cites 27 Sampath Kannan, Claire Mathieu, and Hang Zhou.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing 27 Sampath Kannan, Claire Mathieu, and Hang Zhou

Reference 1973

Resolution: verified exact; doi, observed 2026-08-15T21:12:09.279998Z

Source-reported events for the cited work

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

Observation fd69794a-5f24-4e1a-9b9d-26c781159b2d · outbound

This paper cites 26 Frank Harary and Allen J.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing 26 Frank Harary and Allen J

Reference 1984

Resolution: unresolved; no resolver link, observed 2026-08-15T21:12:09.172965Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fab83814-6cad-47e2-a2a6-01148ab524b8 · outbound

This paper cites 32 Claire Mathieu and Hang Zhou.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing 32 Claire Mathieu and Hang Zhou

Reference 1990

Resolution: unresolved; no resolver link, observed 2026-08-15T21:12:09.189513Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b2cde34-fb38-4cdf-ad42-c7d5f36fe06f · outbound

This paper cites 30 Ales Komarek, Jakub Pavlik, and Vladimir Sobeslav.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing 30 Ales Komarek, Jakub Pavlik, and Vladimir Sobeslav

Reference 1993

Resolution: unresolved; no resolver link, observed 2026-08-15T21:12:09.181263Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53564014-2d6f-4007-8142-5b07d13c4693 · outbound

This paper cites 7 Hans L.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing 7 Hans L

Reference 1995

Resolution: verified exact; raw_fallback, observed 2026-08-15T21:12:09.869541Z

Source-reported events for the cited work

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

Observation 8a97bc36-d72f-4dd4-b607-c86447516c12 · outbound

This paper cites 1996.0049.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing 1996.0049

Reference 1996

Resolution: malformed identifier; no resolver link, observed 2026-08-15T21:12:09.148401Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 740cbf41-6c0a-4a6d-8d21-a89918b8bcab · outbound

This paper cites 34 Ilya Safro, Dorit Ron, and Achi Brandt.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing 34 Ilya Safro, Dorit Ron, and Achi Brandt

Reference 1999

Resolution: unresolved; no resolver link, observed 2026-08-15T21:12:09.196897Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 983f3677-d271-4e87-a225-9e8d13067954 · outbound

This paper cites sentenceCase:1.doi:10.1007/3-540-44666-4_26.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing sentenceCase:1.doi:10.1007/3-540-44666-4_26

Reference 2001

Resolution: unresolved; no resolver link, observed 2026-08-15T21:12:09.165042Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df2b18f8-4cd7-49e2-b4e6-34048207da77 · outbound

This paper cites an unresolved cited work.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing Unresolved cited work

Reference 2002

Resolution: unresolved; raw_fallback, observed 2026-08-15T21:12:09.899020Z

Source-reported events for the cited work

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

Observation 83efe5a6-102e-4e32-9be4-a6951e1e1859 · outbound

This paper cites A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth

Reference 2012

Resolution: metadata mismatch; local_arxiv, observed 2026-08-15T21:12:09.887569Z

Source-reported events for the cited work

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

Observation e6c46d7d-441c-4090-a7ea-78bbc329dc8c · outbound

This paper cites an unresolved cited work.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing Unresolved cited work

Reference 2015

Resolution: verified exact; doi, observed 2026-08-15T21:12:09.257430Z

Source-reported events for the cited work

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

Observation 6ae8fe81-84c5-4fbd-af4f-2b77765e29ec · outbound

This paper cites 10 JuliaBöttcher, KlaasP.Pruessmann, AnuschTaraz, andAndreasWürfl.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing 10 JuliaBöttcher, KlaasP.Pruessmann, AnuschTaraz, andAndreasWürfl

Reference 2021

Resolution: verified exact; doi, observed 2026-08-15T21:12:09.301248Z

Source-reported events for the cited work

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

Observation 44883ee2-5261-4e3b-b462-68a150f962a6 · outbound

This paper cites ISSN: 1868-8969.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing ISSN: 1868-8969

Reference 2022

Resolution: verified exact; doi, observed 2026-08-15T21:12:09.338543Z

Source-reported events for the cited work

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

Observation 43088184-9088-4720-acb5-3bb07d7be862 · outbound

This paper cites Optimal distance query reconstruction for graphs without long induced cycles.

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing Optimal distance query reconstruction for graphs without long induced cycles

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-15T21:12:09.139118Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.