{"as_of":"2026-08-20T08:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:412872f888f109b46079b27c1bf492bf7cf4f1241662666c69bfaa15eaff519e","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:12:09.205461Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.10789/citation-record","integrity":"/paper/2505.10789/integrity","json":"/paper/2505.10789/citation-record.json","paper":"/paper/2505.10789"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.917417Z","title":"Goodrich, Pedro Matias, and Martha C","venue":null,"work_id":"84243374-295b-4e81-a795-e7db88193db7","year":2022},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.122188Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:4adcef5f793a311ffc2eaddedfc9b9f75fafd8ff6f1051d82a354661241b9f31","observation_id":"ec35299e-c3ef-40f9-bde8-94f61eead32e","resolution":{"observed_at":"2026-08-15T21:12:09.921177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.sea.2022.9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.322329Z","title":"ISSN: 1868-8969","venue":null,"work_id":"c7fcc5a9-b80c-49e0-ae73-b9d444d53cac","year":2022},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.130539Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:b8f256d26148e3d9eb9e014c9381598cf40bf1d3de860fcaa076ee374fb5d5bb","observation_id":"7d518587-c77b-49aa-9fe1-657de6c84fac","resolution":{"observed_at":"2026-08-15T21:12:09.326579Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.906721Z","title":"Cuthill and J","venue":null,"work_id":"f3ec69bb-33e4-41c1-a7c9-e0aafe17d3cb","year":1969},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.156356Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:2d2a5c18f516dcf646a4dae28cb6e7e8314ea4d9ef2ceba6a78bdb023c205660","observation_id":"99424ea0-9073-4787-9680-6895bbf72bbe","resolution":{"observed_at":"2026-08-15T21:12:09.910654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2000.1118","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.540932Z","title":"24 Anupam Gupta","venue":null,"work_id":"22cfab34-54ce-4371-a2ee-d87c3a927d1a","year":2012},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.168725Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:e98d2879aa85b173a3384f5f8ad0579f4f8223e5cda392e4d05659d3a6e24c29","observation_id":"bc0f78ee-2a34-46ba-9d79-5c149093ef17","resolution":{"observed_at":"2026-08-15T21:12:09.546603Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2021.68","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.232992Z","title":"ISSN: 1868-8969","venue":null,"work_id":"71ce9f93-d3fd-4dd5-9d78-b916d23062d3","year":2021},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.193063Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:243f935a6db4334a283ebcdd892e2212000bf1857e3c5f846a78fe190ebba169","observation_id":"994b851a-3d45-4df5-97cc-f7c3d8d78ca4","resolution":{"observed_at":"2026-08-15T21:12:09.237554Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11731","last_updated":"2021-05-17T12:07:54Z","snapshot_observed_at":"2026-08-06T00:16:31.129364Z","submitted_at":"2020-02-26T19:00:01Z","title":"Novel approach to neutron electric dipole moment search using weak measurement","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11731","snapshot_observed_at":"2026-08-15T21:12:09.205461Z","title":"doi:10.1109/INFVIS.2002.1173155","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.205461Z"},"links":{"cited_paper":"/paper/2002.11731","citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:b5a1956280d03d571da7921640038182982fedad44b51a4460b3ed7379f96e3e","observation_id":"834e492b-e292-4edd-80e2-582134d3ea1f","resolution":{"observed_at":"2026-08-15T21:12:09.205461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.161173Z","title":"14 Alberto Debiasi, Bruno Simoes, and Raffaele De Amicis","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":1969,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.161173Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:39fdcb849bebbe93df074f60cc2095b24fced831d7699eae7ab443e6f763a768","observation_id":"86d6c638-f0ff-4cc5-a7dd-e991d15479cf","resolution":{"observed_at":"2026-08-15T21:12:09.161173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0012-365x(73)90067-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.274373Z","title":"27 Sampath Kannan, Claire Mathieu, and Hang Zhou","venue":null,"work_id":"8c5e26ba-f7e8-4ccb-811a-ec3c2a6d0006","year":2018},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":1973,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.177306Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:5fb55ace7a3408c8994989b05da4aad725cc0f2461a760e056b5fb2dc6ec5c03","observation_id":"bf53fb30-9cf0-4986-afde-3ae0c8124fbc","resolution":{"observed_at":"2026-08-15T21:12:09.279998Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.172965Z","title":"26 Frank Harary and Allen J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":1984,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.172965Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:ec55482eb01562290253fc13ecf0d9df29523f898e6986ee1883771cd69006a0","observation_id":"fd69794a-5f24-4e1a-9b9d-26c781159b2d","resolution":{"observed_at":"2026-08-15T21:12:09.172965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.189513Z","title":"32 Claire Mathieu and Hang Zhou","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.189513Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:d0b042e6cc4f6989fad7d8a6cc29c31b471d4042bc6196ece2a590b1362b8e1f","observation_id":"fab83814-6cad-47e2-a2a6-01148ab524b8","resolution":{"observed_at":"2026-08-15T21:12:09.189513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.181263Z","title":"30 Ales Komarek, Jakub Pavlik, and Vladimir Sobeslav","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.181263Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:790d30ce601a4f33ee18e5e318e8f5067edbcd4ebfb663f8e6e0370e9346c400","observation_id":"5b2cde34-fb38-4cdf-ad42-c7d5f36fe06f","resolution":{"observed_at":"2026-08-15T21:12:09.181263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1995.1009","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.863820Z","title":"7 Hans L","venue":null,"work_id":"6e2316d8-d193-4f02-9c5c-9a5c18346b42","year":1995},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.143671Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:030814d53c2873e07abdc49c5074f81e5c0be0adf6517f9042e43392a8f76f6a","observation_id":"53564014-2d6f-4007-8142-5b07d13c4693","resolution":{"observed_at":"2026-08-15T21:12:09.869541Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.148401Z","title":"1996.0049","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.148401Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:9db1bea56588e9939328e675d3d459b627d3cad5882c91904e91a4e98d64a060","observation_id":"8a97bc36-d72f-4dd4-b607-c86447516c12","resolution":{"observed_at":"2026-08-15T21:12:09.148401Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.196897Z","title":"34 Ilya Safro, Dorit Ron, and Achi Brandt","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.196897Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:c6f6a0dccab1c416ca854342dce6da8a622c220b1d87cf7ec14556498bce7f05","observation_id":"740cbf41-6c0a-4a6d-8d21-a89918b8bcab","resolution":{"observed_at":"2026-08-15T21:12:09.196897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.165042Z","title":"sentenceCase:1.doi:10.1007/3-540-44666-4_26","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.165042Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:537e407a0eb069735f1d52ef87c7e4d589f4004a758ceba293b51a0a2cc938ba","observation_id":"983f3677-d271-4e87-a225-9e8d13067954","resolution":{"observed_at":"2026-08-15T21:12:09.165042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.894854Z","title":null,"venue":null,"work_id":"4cfc92f0-7776-4437-99f7-ecf1b6ef5d8f","year":2002},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.201842Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:fead4dc8e45ac984c7db4cff1d40ac05389cdcbb5b4daa19cc56d99842278698","observation_id":"df2b18f8-4cd7-49e2-b4e6-34048207da77","resolution":{"observed_at":"2026-08-15T21:12:09.899020Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0806.0840","last_updated":"2012-12-17T14:03:58Z","snapshot_observed_at":"2026-08-15T10:13:56.444642Z","submitted_at":"2008-06-04T19:18:45Z","title":"A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth","version":2},"cited_work":{"arxiv_id":"0806.0840","doi":null,"metadata_source":"pith","pith_arxiv_id":"0806.0840","snapshot_observed_at":"2026-08-15T21:12:09.883039Z","title":"A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth","venue":"cs.DS","work_id":"14efb663-36a1-447c-8b04-ef31e1ddfecf","year":2008},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.134724Z"},"links":{"cited_paper":"/paper/0806.0840","citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:96716df5c7cd5f6344267b8e4c6a74643b1c75ecd75533be7c1abcbe06dc3981","observation_id":"83efe5a6-102e-4e32-9be4-a6951e1e1859","resolution":{"observed_at":"2026-08-15T21:12:09.887569Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-24306-1_27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":null,"venue":"Lecture notes in computer science","work_id":"92026ba0-e373-4a87-a408-bf02dcc7dbd4","year":null},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.185773Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:f66ccae70d954a6a83dfc810de024e0c21495b43b6bb6c2df006d109eae65b06","observation_id":"e6c46d7d-441c-4090-a7ea-78bbc329dc8c","resolution":{"observed_at":"2026-08-15T21:12:09.257430Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1186/s42492-021-00088-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.295882Z","title":"10 JuliaBöttcher, KlaasP.Pruessmann, AnuschTaraz, andAndreasWürfl","venue":null,"work_id":"b432f23e-726b-40b7-a96d-dcba2553734e","year":null},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.152305Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:2ee4c56fee82e262cf74daf3c48d501663504dc561ba3f8d3a5fe06532e8db7b","observation_id":"6ae8fe81-84c5-4fbd-af4f-2b77765e29ec","resolution":{"observed_at":"2026-08-15T21:12:09.301248Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2022.4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:12:09.334665Z","title":"ISSN: 1868-8969","venue":null,"work_id":"0b937bf4-07cb-4058-a1de-951a30fab2d3","year":2022},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.126484Z"},"links":{"citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:f05b168b933018a8c84d45ba2c42c0416303ab129568f751e2a4265ed3125880","observation_id":"44883ee2-5261-4e3b-b462-68a150f962a6","resolution":{"observed_at":"2026-08-15T21:12:09.338543Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05979","last_updated":"2024-10-16T14:25:09Z","snapshot_observed_at":"2026-08-16T15:25:07.250205Z","submitted_at":"2023-06-09T15:46:35Z","title":"Optimal distance query reconstruction for graphs without long induced cycles","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05979","snapshot_observed_at":"2026-08-15T21:12:09.139118Z","title":"URL: http://arxiv.org/abs/2306","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.139118Z"},"links":{"cited_paper":"/paper/2306.05979","citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:107e232a31110850e5ae8b8597b0a1fe1722d62533760b86bd93b0e111cc60d6","observation_id":"43088184-9088-4720-acb5-3bb07d7be862","resolution":{"observed_at":"2026-08-15T21:12:09.139118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":9,"verified_exact":8,"verified_fuzzy":2},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"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."}