Pith. sign in

Paper Citation Record · LEDGER

Consistent polynomial-time unseeded graph matching for Lipschitz graphons

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

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

pith.paper-citation-record.v1
1807.11027 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-08T06:32:00.761636+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-07T11:25:48.071138Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-10T22:05:48.278949Z

Reference resolution

0 of 0 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation c1bd3151-13dc-4304-84da-2cb8ef3f0d2f · inbound

Asymptotically perfect seeded graph matching without edge correlation (and applications to inference) cites this paper.

Asymptotically perfect seeded graph matching without edge correlation (and applications to inference) Consistent polynomial-time unseeded graph matching for Lipschitz graphons

Reference 74

Resolution
unresolved
no resolver link, observed 2026-08-07T11:25:48.071138Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:25:48.071138Z digest=sha256:2c533afc4143e8039e5673392b32730f4319ef72b374410a3643faba7ec9247d

Observation 933902c7-bd4a-4096-9316-11a5979eda7d · inbound

Attributed Network Alignment: Statistical Limits and Efficient Algorithm cites this paper.

Attributed Network Alignment: Statistical Limits and Efficient Algorithm Consistent polynomial-time unseeded graph matching for Lipschitz graphons

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-07-04T23:00:18.216939Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-10T20:16:27.446354Z digest=sha256:9cc27d26199b1c319f781a5072107441804554e1da9bbfa3d021eb9b5ca8bfa7