{"as_of":"2026-08-18T20:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:22e141e0bd8cad8cc69a2c765ffc02410d005a8189838dcddd49d14513ef3bf4","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:20:29.639066Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T10:19:23.532364Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.12787","last_updated":"2019-05-12T22:15:33Z","snapshot_observed_at":"2026-08-14T16:39:55.628795Z","submitted_at":"2019-04-29T15:59:04Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.12787","snapshot_observed_at":"2026-08-14T05:20:29.639066Z","title":"Graph Matching Networks for Learning the Similarity of Graph Struc- tured Objects","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1909.01587","last_updated":"2019-09-15T08:03:58Z","snapshot_observed_at":"2026-08-17T05:32:12.701175Z","submitted_at":"2019-09-04T07:26:52Z","title":"Topological Coding and Topological Matrices Toward Network Overall Security","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T05:20:29.639066Z"},"links":{"cited_paper":"/paper/1904.12787","citing_paper":"/paper/1909.01587"},"observation_digest":"sha256:e2e69d0746589c90323f8abb288e06308ccbaa527e38fa4a8fa64c20c56f5cb3","observation_id":"516fba72-062d-4554-b963-5bec01f1287b","resolution":{"observed_at":"2026-08-14T05:20:29.639066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12787","last_updated":"2019-05-12T22:15:33Z","snapshot_observed_at":"2026-08-14T16:39:55.628795Z","submitted_at":"2019-04-29T15:59:04Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.12787","snapshot_observed_at":"2026-08-12T14:52:57.067633Z","title":"Graph matching networks for learning the similarity of graph structured objects, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14832","last_updated":"2024-11-22T10:10:53Z","snapshot_observed_at":"2026-08-16T12:34:15.820992Z","submitted_at":"2024-11-22T10:10:53Z","title":"VisGraphVar: A Benchmark Generator for Assessing Variability in Graph Analysis Using Large Vision-Language Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:52:57.067633Z"},"links":{"cited_paper":"/paper/1904.12787","citing_paper":"/paper/2411.14832"},"observation_digest":"sha256:a1df1910f4484d1c22fb9bdf6c4f8eebff551a0189aaf1c6447bf6f530b1ceab","observation_id":"9b7f85c3-c101-4e7e-932f-cb96a4a8bde0","resolution":{"observed_at":"2026-08-12T14:52:57.067633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12787","last_updated":"2019-05-12T22:15:33Z","snapshot_observed_at":"2026-08-14T16:39:55.628795Z","submitted_at":"2019-04-29T15:59:04Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.12787","snapshot_observed_at":"2026-08-05T10:50:13.522749Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.03737","last_updated":"2025-09-03T21:56:16Z","snapshot_observed_at":"2026-08-05T10:50:11.702959Z","submitted_at":"2025-09-03T21:56:16Z","title":"LayoutGKN: Graph Similarity Learning of Floor Plans","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T10:50:13.522749Z"},"links":{"cited_paper":"/paper/1904.12787","citing_paper":"/paper/2509.03737"},"observation_digest":"sha256:278d3f7a58c165f61e379beb8f8944a6e94559cf85b712caa23a10cfc88132ab","observation_id":"f70dfa7c-de39-4a7e-86cd-b04d4fb734a2","resolution":{"observed_at":"2026-08-05T10:50:13.522749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12787","last_updated":"2019-05-12T22:15:33Z","snapshot_observed_at":"2026-08-14T16:39:55.628795Z","submitted_at":"2019-04-29T15:59:04Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.12787","snapshot_observed_at":"2026-08-04T18:52:17.498386Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2509.09637","last_updated":"2025-09-11T17:23:47Z","snapshot_observed_at":"2026-08-16T02:25:38.650151Z","submitted_at":"2025-09-11T17:23:47Z","title":"A neural drift-plus-penalty algorithm for network power allocation and routing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T18:52:17.498386Z"},"links":{"cited_paper":"/paper/1904.12787","citing_paper":"/paper/2509.09637"},"observation_digest":"sha256:0c3e45d00da0e7c03cdd06cdb15535c96b15c7d399bf95b6da9251d7c2a137e4","observation_id":"d4d033ee-b090-4cb3-8d90-0816af9592b4","resolution":{"observed_at":"2026-08-04T18:52:17.498386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12787","last_updated":"2019-05-12T22:15:33Z","snapshot_observed_at":"2026-08-14T16:39:55.628795Z","submitted_at":"2019-04-29T15:59:04Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","version":2},"cited_work":{"arxiv_id":"1904.12787","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.12787","snapshot_observed_at":"2026-08-05T10:19:23.532364Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects","venue":"cs.LG","work_id":"cfe13c58-d5ac-4f8f-a5c6-7777ca4e4a75","year":2019},"citing_paper":{"arxiv_id":"2509.10526","last_updated":"2025-09-04T15:05:05Z","snapshot_observed_at":"2026-08-15T03:17:01.695044Z","submitted_at":"2025-09-04T15:05:05Z","title":"Resource-Aware Neural Network Pruning Using Graph-based Reinforcement Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T10:19:22.798980Z"},"links":{"cited_paper":"/paper/1904.12787","citing_paper":"/paper/2509.10526"},"observation_digest":"sha256:0b76e941cb92a8ed347ef61eb1fa1d5e244ef7121e0a0140260504d4308cd8cd","observation_id":"9963b6c0-228d-4bda-89d3-b4cd87e29780","resolution":{"observed_at":"2026-08-05T10:19:23.538205Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.12787/citation-record","integrity":"/paper/1904.12787/integrity","json":"/paper/1904.12787/citation-record.json","paper":"/paper/1904.12787"},"outbound":[],"paper":{"arxiv_id":"1904.12787","last_updated":"2019-05-12T22:15:33Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T16:39:55.628795Z","submitted_at":"2019-04-29T15:59:04Z","title":"Graph Matching Networks for Learning the Similarity of Graph Structured Objects"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1904.12787."}