{"as_of":"2026-08-07T16:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e1c867c008537e8246592bb65fdfa2d3cdc9c98a535df58ce37469d5cafd53a","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-07T06:34:17.273281+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-05-13T02:39:29.411021Z","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-13T02:39:29.521222Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1512.07494","last_updated":"2015-12-23T14:33:47Z","snapshot_observed_at":"2026-07-06T04:40:55.466773Z","submitted_at":"2015-12-23T14:33:47Z","title":"A Quadratic Assignment Formulation of the Graph Edit Distance","version":1},"cited_work":{"arxiv_id":"1512.07494","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1512.07494","snapshot_observed_at":"2026-07-04T20:44:33.063278Z","title":"Learning shape correspondence with anisotropic convolutional neural networks","venue":null,"work_id":"78694660-b4e2-438c-80c7-8f5a43aa0756","year":2015},"citing_paper":{"arxiv_id":"2104.13478","last_updated":"2021-05-02T16:16:03Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-04-27T21:09:51Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-13T02:39:29.411021Z"},"links":{"cited_paper":"/paper/1512.07494","citing_paper":"/paper/2104.13478"},"observation_digest":"sha256:43f99dde78c0d1056cfa99eed50e7dbbfcde4b3799758c0ce3860e8152eaaca8","observation_id":"6d317395-31d6-4d19-aef0-a12e828e3f29","resolution":{"observed_at":"2026-07-04T20:44:33.063278Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1512.07494","last_updated":"2015-12-23T14:33:47Z","snapshot_observed_at":"2026-07-06T04:40:55.466773Z","submitted_at":"2015-12-23T14:33:47Z","title":"A Quadratic Assignment Formulation of the Graph Edit Distance","version":1},"cited_work":{"arxiv_id":"1512.07494","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1512.07494","snapshot_observed_at":"2026-07-04T20:44:33.063278Z","title":"Learning shape correspondence with anisotropic convolutional neural networks","venue":null,"work_id":"78694660-b4e2-438c-80c7-8f5a43aa0756","year":2015},"citing_paper":{"arxiv_id":"2604.05929","last_updated":"2026-04-07T14:31:19Z","snapshot_observed_at":"2026-07-06T22:54:30.567988Z","submitted_at":"2026-04-07T14:31:19Z","title":"ReLU Networks for Exact Generation of Similar Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T18:38:54.623816Z"},"links":{"cited_paper":"/paper/1512.07494","citing_paper":"/paper/2604.05929"},"observation_digest":"sha256:fe0fc9aa7a34a2cf84d0471270351e2496e809dc6fdf468e7e07e1ad11706170","observation_id":"2690a4a1-c576-48c6-9c1d-b5cc9b134ea5","resolution":{"observed_at":"2026-07-04T20:44:33.063278Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1512.07494/citation-record","integrity":"/paper/1512.07494/integrity","json":"/paper/1512.07494/citation-record.json","paper":"/paper/1512.07494"},"outbound":[],"paper":{"arxiv_id":"1512.07494","last_updated":"2015-12-23T14:33:47Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T04:40:55.466773Z","submitted_at":"2015-12-23T14:33:47Z","title":"A Quadratic Assignment Formulation of the Graph Edit Distance"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1512.07494."}