Paper Citation Record · LEDGER

A Separator-based Algorithm for the Graph Edit Distance Problem

As of 19 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2608.04583.

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

pith.paper-citation-record.v1
2608.04583 v1

Coverage vector

measured 18 of 18 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T21:47:34.990005Z

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

18 of 18 outbound references displayed

verified exact6
verified fuzzy1
unresolved5
parse uncertain0
malformed identifier3
metadata mismatch3

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 00e85cd1-4a5b-4f92-bea1-d8090b7b2423 · outbound

This paper cites A graph database repository and performance evaluation metrics for graph edit distance.

A Separator-based Algorithm for the Graph Edit Distance Problem A graph database repository and performance evaluation metrics for graph edit distance

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T21:47:37.916246Z

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 e48489d5-1838-4247-bf19-4c9fac35890d · outbound

This paper cites 3 TatsuyaAkutsu, TakeyukiTamura, DaijiFukagawa, andAtsuhiroTakasu.

A Separator-based Algorithm for the Graph Edit Distance Problem 3 TatsuyaAkutsu, TakeyukiTamura, DaijiFukagawa, andAtsuhiroTakasu

Reference 3

Resolution: verified exact; doi, observed 2026-08-06T21:47:35.706497Z

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 3fda124f-c57c-456c-9a09-b378862a726c · outbound

This paper cites 16 Marek Cygan, Fedor V.

A Separator-based Algorithm for the Graph Edit Distance Problem 16 Marek Cygan, Fedor V

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-06T21:47:34.437061Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4795a444-545c-4252-a29c-d1718b5a9c98 · outbound

This paper cites 29 Seyed Mehdi Lajevardi, Arathi Arakala, Stephen A.

A Separator-based Algorithm for the Graph Edit Distance Problem 29 Seyed Mehdi Lajevardi, Arathi Arakala, Stephen A

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-06T21:47:34.632682Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation daf67c6d-ee7a-4bb1-994f-b06158a5084d · outbound

This paper cites edges (m), and the maximum treewidth of any graph inG.

A Separator-based Algorithm for the Graph Edit Distance Problem edges (m), and the maximum treewidth of any graph inG

Reference 18

Resolution: malformed identifier; raw_fallback, observed 2026-08-06T21:47:37.156179Z

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 8c787d97-b66b-43c0-851a-99c46375cea1 · outbound

This paper cites 24 Rashid Ibragimov, Maximilian Malek, Jiong Guo, and Jan Baumbach.

A Separator-based Algorithm for the Graph Edit Distance Problem 24 Rashid Ibragimov, Maximilian Malek, Jiong Guo, and Jan Baumbach

Reference 1962

Resolution: unresolved; no resolver link, observed 2026-08-06T21:47:34.564675Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 871019da-0c3d-4df2-9a43-31107c4c3988 · outbound

This paper cites 5 Afrouz Jabal Ameli, Jesper Nederlof, and Shengzhe Wang.

A Separator-based Algorithm for the Graph Edit Distance Problem 5 Afrouz Jabal Ameli, Jesper Nederlof, and Shengzhe Wang

Reference 1990

Resolution: malformed identifier; raw_fallback, observed 2026-08-06T21:47:37.415979Z

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 c8f3355a-49b4-4c73-b575-7739d0151549 · outbound

This paper cites 33 Richard J.

A Separator-based Algorithm for the Graph Edit Distance Problem 33 Richard J

Reference 1994

Resolution: unresolved; no resolver link, observed 2026-08-06T21:47:34.701120Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b845a8e8-fbb3-49f9-93f1-1a9b689025d5 · outbound

This paper cites 36 Neil Robertson and P.D Seymour.

A Separator-based Algorithm for the Graph Edit Distance Problem 36 Neil Robertson and P.D Seymour

Reference 2007

Resolution: metadata mismatch; raw_fallback, observed 2026-08-06T21:47:36.254288Z

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 e3b736cd-103f-4e4f-9faf-6d7822562dda · outbound

This paper cites Springer, 2008.doi: 10.1007/978-3-540-89689-0\_33.

A Separator-based Algorithm for the Graph Edit Distance Problem Springer, 2008.doi: 10.1007/978-3-540-89689-0\_33

Reference 2008

Resolution: verified exact; doi, observed 2026-08-06T21:47:35.158708Z

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 9e6d0d2e-9c62-4ec3-865f-5303617a7f20 · outbound

This paper cites an unresolved cited work.

A Separator-based Algorithm for the Graph Edit Distance Problem Unresolved cited work

Reference 2013

Resolution: unresolved; no resolver link, observed 2026-08-06T21:47:34.372707Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcd0cc5f-a523-4eb8-ab88-5223fe98a874 · outbound

This paper cites 4 Noga Alon, Paul Seymour, and Robin Thomas.

A Separator-based Algorithm for the Graph Edit Distance Problem 4 Noga Alon, Paul Seymour, and Robin Thomas

Reference 2014

Resolution: malformed identifier; raw_fallback, observed 2026-08-06T21:47:37.641288Z

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 d809c8ad-2a85-458b-838c-1e08ebecda2b · outbound

This paper cites Springer, 2015.doi:10.1007/978-3-319-18224-7\_14.

A Separator-based Algorithm for the Graph Edit Distance Problem Springer, 2015.doi:10.1007/978-3-319-18224-7\_14

Reference 2015

Resolution: verified exact; doi, observed 2026-08-06T21:47:35.870459Z

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 608f282b-9da5-45fc-b15a-e5bb81fc85ca · outbound

This paper cites 39 Hisao Tamaki.

A Separator-based Algorithm for the Graph Edit Distance Problem 39 Hisao Tamaki

Reference 2017

Resolution: metadata mismatch; raw_fallback, observed 2026-08-06T21:47:36.061518Z

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 35152067-609e-4495-a2db-3ea50faa69f6 · outbound

This paper cites New Techniques for Graph Edit Distance Computation.

A Separator-based Algorithm for the Graph Edit Distance Problem New Techniques for Graph Edit Distance Computation

Reference 2019

Resolution: verified exact; local_arxiv, observed 2026-08-06T21:47:35.548099Z

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 d9672f77-2f14-4ca1-9314-d3414e6d126b · outbound

This paper cites 10 Martial Bourquin, Andy King, and Edward Robbins.

A Separator-based Algorithm for the Graph Edit Distance Problem 10 Martial Bourquin, Andy King, and Edward Robbins

Reference 2020

Resolution: verified exact; doi, observed 2026-08-06T21:47:35.359736Z

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 0dcc278c-964b-4135-92d0-9d47dde2f80d · outbound

This paper cites 19 Carlos Garcia-Hernandez, Alberto Fernández, and Francesc Serratosa.

A Separator-based Algorithm for the Graph Edit Distance Problem 19 Carlos Garcia-Hernandez, Alberto Fernández, and Francesc Serratosa

Reference 2022

Resolution: metadata mismatch; raw_fallback, observed 2026-08-06T21:47:36.535788Z

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 1e81e39d-0799-44f5-8c90-da8363ff9902 · outbound

This paper cites Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics.

A Separator-based Algorithm for the Graph Edit Distance Problem Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics

Reference 2026

Resolution: verified exact; local_arxiv, observed 2026-08-06T21:47:36.829700Z

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.

Pith citing papers

No inbound Pith citation observations are available.