{"as_of":"2026-08-12T07:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cadb92cdd9e106c740facfdf49571c78a1be68ca9603e0262eab3897cbd0f5a9","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:12:25.220808Z","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-10T01:56:07.339260Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.03092","last_updated":"2020-10-27T17:48:05Z","snapshot_observed_at":"2026-08-10T20:12:30.707276Z","submitted_at":"2020-07-06T22:06:38Z","title":"Neural Subgraph Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03092","snapshot_observed_at":"2026-08-11T20:12:25.220808Z","title":"Neural Subgraph Matching,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.05957","last_updated":"2024-12-08T14:30:21Z","snapshot_observed_at":"2026-08-11T20:07:23.528337Z","submitted_at":"2024-12-08T14:30:21Z","title":"A Two-Stage AI-Powered Motif Mining Method for Efficient Power System Topological Analysis","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T20:12:25.220808Z"},"links":{"cited_paper":"/paper/2007.03092","citing_paper":"/paper/2412.05957"},"observation_digest":"sha256:dafe31f5549f2683177845d74398b6bb2fb0b4cf7fe1fda0f0f546e1eb014b6f","observation_id":"c36024be-f041-4fd7-a219-f0178a6e6ecb","resolution":{"observed_at":"2026-08-11T20:12:25.220808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03092","last_updated":"2020-10-27T17:48:05Z","snapshot_observed_at":"2026-08-10T20:12:30.707276Z","submitted_at":"2020-07-06T22:06:38Z","title":"Neural Subgraph Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03092","snapshot_observed_at":"2026-08-11T16:33:50.516383Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-11T18:36:54.204310Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.516383Z"},"links":{"cited_paper":"/paper/2007.03092","citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:e6ee9ff53fe44e9a5af72d44b87b07835c83efeab8ce0d4511e4d461d66bd48f","observation_id":"21f7f5f3-08d3-4632-8f6f-1e898a94cc4b","resolution":{"observed_at":"2026-08-11T16:33:50.516383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03092","last_updated":"2020-10-27T17:48:05Z","snapshot_observed_at":"2026-08-10T20:12:30.707276Z","submitted_at":"2020-07-06T22:06:38Z","title":"Neural Subgraph Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03092","snapshot_observed_at":"2026-08-07T15:22:31.385715Z","title":"org/CorpusID:251018635","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.15867","last_updated":"2025-05-21T11:56:09Z","snapshot_observed_at":"2026-08-10T09:54:56.939823Z","submitted_at":"2025-05-21T11:56:09Z","title":"SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:31.385715Z"},"links":{"cited_paper":"/paper/2007.03092","citing_paper":"/paper/2505.15867"},"observation_digest":"sha256:d5ac243afc69144d8c6615c386466ccedac79748073b925ded9889828c0f1c38","observation_id":"3dbcf04b-81f2-40ab-998e-0fe534a50f99","resolution":{"observed_at":"2026-08-07T15:22:31.385715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03092","last_updated":"2020-10-27T17:48:05Z","snapshot_observed_at":"2026-08-10T20:12:30.707276Z","submitted_at":"2020-07-06T22:06:38Z","title":"Neural Subgraph Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03092","snapshot_observed_at":"2026-08-06T16:21:36.526967Z","title":"Neural subgraph matching,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.19518","last_updated":"2025-07-18T11:43:19Z","snapshot_observed_at":"2026-08-11T15:20:02.783677Z","submitted_at":"2025-07-18T11:43:19Z","title":"Target Circuit Matching in Large-Scale Netlists using GNN-Based Region Prediction","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:36.526967Z"},"links":{"cited_paper":"/paper/2007.03092","citing_paper":"/paper/2507.19518"},"observation_digest":"sha256:fadaa2c71531cdbda22c033cd5a5b02a1b438ded90bc8f420cd53d79fe1fd80f","observation_id":"02781ab1-5c50-45c0-b4b7-1a2c3dfbb0bc","resolution":{"observed_at":"2026-08-06T16:21:36.526967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03092","last_updated":"2020-10-27T17:48:05Z","snapshot_observed_at":"2026-08-10T20:12:30.707276Z","submitted_at":"2020-07-06T22:06:38Z","title":"Neural Subgraph Matching","version":2},"cited_work":{"arxiv_id":"2007.03092","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.03092","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ccf292c7-a3fa-47d5-89ab-0775276702bf","year":2020},"citing_paper":{"arxiv_id":"2604.19116","last_updated":"2026-04-21T05:53:49Z","snapshot_observed_at":"2026-08-11T07:26:05.326230Z","submitted_at":"2026-04-21T05:53:49Z","title":"LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-10T01:54:38.029472Z"},"links":{"cited_paper":"/paper/2007.03092","citing_paper":"/paper/2604.19116"},"observation_digest":"sha256:7bac77586d39bc91bd298bbcad9f3650f5bb4d441b51d8060b4bea41ab7e0cbb","observation_id":"6b904401-aa22-42d2-882b-2ccd484d9678","resolution":{"observed_at":"2026-05-10T01:56:07.340879Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03092","last_updated":"2020-10-27T17:48:05Z","snapshot_observed_at":"2026-08-10T20:12:30.707276Z","submitted_at":"2020-07-06T22:06:38Z","title":"Neural Subgraph Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03092","snapshot_observed_at":"2026-07-14T06:36:34.161979Z","title":"arXiv preprint arXiv:2007.03092 , year=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.11159","last_updated":"2026-07-13T06:51:57Z","snapshot_observed_at":"2026-07-16T23:19:13.894922Z","submitted_at":"2026-07-13T06:51:57Z","title":"NGM-RAG: Neural Graph Matching based Retrieval-Augmented Generation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-14T06:36:34.161979Z"},"links":{"cited_paper":"/paper/2007.03092","citing_paper":"/paper/2607.11159"},"observation_digest":"sha256:36ee51d73f5daead15613365811e1d1c701ae64cad2253695935d39a75f30c42","observation_id":"c8deb4af-82da-43f8-bdf0-990fd019bd4e","resolution":{"observed_at":"2026-07-14T06:36:34.161979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2007.03092/citation-record","integrity":"/paper/2007.03092/integrity","json":"/paper/2007.03092/citation-record.json","paper":"/paper/2007.03092"},"outbound":[],"paper":{"arxiv_id":"2007.03092","last_updated":"2020-10-27T17:48:05Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T20:12:30.707276Z","submitted_at":"2020-07-06T22:06:38Z","title":"Neural Subgraph Matching"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2007.03092."}