{"as_of":"2026-08-08T12:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4d4009dc5e196dd87fa0e0a8a9608b109caac8336fad18c60d20d0fb2b7aec7","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:25:48.071138Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T22:05:48.278949Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1807.11027","last_updated":"2018-07-29T09:25:37Z","snapshot_observed_at":"2026-08-06T19:16:01.904495Z","submitted_at":"2018-07-29T09:25:37Z","title":"Consistent polynomial-time unseeded graph matching for Lipschitz graphons","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.11027","snapshot_observed_at":"2026-08-07T11:25:48.071138Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:48.071138Z"},"links":{"cited_paper":"/paper/1807.11027","citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:2c533afc4143e8039e5673392b32730f4319ef72b374410a3643faba7ec9247d","observation_id":"c1bd3151-13dc-4304-84da-2cb8ef3f0d2f","resolution":{"observed_at":"2026-08-07T11:25:48.071138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.11027","last_updated":"2018-07-29T09:25:37Z","snapshot_observed_at":"2026-08-06T19:16:01.904495Z","submitted_at":"2018-07-29T09:25:37Z","title":"Consistent polynomial-time unseeded graph matching for Lipschitz graphons","version":1},"cited_work":{"arxiv_id":"1807.11027","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1807.11027","snapshot_observed_at":"2026-07-04T23:00:18.216939Z","title":"Consistent polynomial-time unseeded graph matching for Lipschitz graphons.arXiv preprint arXiv:1807.11027","venue":null,"work_id":"4578c380-f9a8-4ec9-884b-3e7603b962d9","year":null},"citing_paper":{"arxiv_id":"2604.04365","last_updated":"2026-04-06T02:27:50Z","snapshot_observed_at":"2026-07-31T18:44:50.458178Z","submitted_at":"2026-04-06T02:27:50Z","title":"Attributed Network Alignment: Statistical Limits and Efficient Algorithm","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T20:16:27.446354Z"},"links":{"cited_paper":"/paper/1807.11027","citing_paper":"/paper/2604.04365"},"observation_digest":"sha256:9cc27d26199b1c319f781a5072107441804554e1da9bbfa3d021eb9b5ca8bfa7","observation_id":"933902c7-bd4a-4096-9316-11a5979eda7d","resolution":{"observed_at":"2026-07-04T23:00:18.216939Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1807.11027/citation-record","integrity":"/paper/1807.11027/integrity","json":"/paper/1807.11027/citation-record.json","paper":"/paper/1807.11027"},"outbound":[],"paper":{"arxiv_id":"1807.11027","last_updated":"2018-07-29T09:25:37Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-06T19:16:01.904495Z","submitted_at":"2018-07-29T09:25:37Z","title":"Consistent polynomial-time unseeded graph matching for Lipschitz graphons"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"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."}