Pith. sign in

Paper Citation Record · LEDGER

New Techniques for Graph Edit Distance Computation

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

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

pith.paper-citation-record.v1
1908.00265 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 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 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T01:08:47.343385Z

measured 1 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-10T05:30:23.456663Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

6
pith, observed 2026-08-10T05:30:23.456663Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 1634bd79-bef0-4c5d-b0fb-906eaf82837b · inbound

GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code cites this paper.

GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code New Techniques for Graph Edit Distance Computation

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-16T01:08:47.343385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T01:08:47.343385Z digest=sha256:2750e1c129efa1faa4d85fb37088773398437a3c4cec170bdb12899cef5997c6

Observation 35152067-609e-4495-a2db-3ea50faa69f6 · inbound

A Separator-based Algorithm for the Graph Edit Distance Problem cites this paper.

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.

source=pdf_text observed=2026-08-06T21:47:34.116116Z digest=sha256:99b212f927b2396d6968255fc2105d984e3497ce3460525006d2af3838506dad