{"as_of":"2026-08-18T18:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f55b56740162d1cdf3c80cbbe9d12261111c8cc3b4becf8a51a5280ee8092e9a","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T16:39:05.167947Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.09968/citation-record","integrity":"/paper/2412.09968/integrity","json":"/paper/2412.09968/citation-record.json","paper":"/paper/2412.09968"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.654393Z","title":null,"venue":null,"work_id":"df22d9f8-7aba-4c03-b84c-5e86a357de5d","year":2019},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.009430Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:49cef0af05ccb8a7f4d044f78f8163792d562baac79a3a90283c0aab864e3ca5","observation_id":"641204f5-e895-49c4-a6d7-ba4d5abaedb0","resolution":{"observed_at":"2026-08-11T16:39:05.658083Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.642979Z","title":null,"venue":null,"work_id":"74110936-ce34-4b2c-97bd-9b180c0aa387","year":2020},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.014814Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:61327077e7afa073ceff7e5b157b171f54cbebb818f23329f51e4bf9f971a92b","observation_id":"b2484378-b1e8-4f45-a712-c88ad74e34de","resolution":{"observed_at":"2026-08-11T16:39:05.646901Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.631978Z","title":"B.; and Gamper, J","venue":null,"work_id":"8a1bcaa8-3fd1-44e8-87a9-601b603af242","year":2020},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.019156Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:2666b205198d0087400545bcf98d9ebab239a41bd098982bc6c1015474b624b7","observation_id":"79781844-ce07-44d8-9824-926b2cfd9356","resolution":{"observed_at":"2026-08-11T16:39:05.635617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.621416Z","title":"M.; and Kriegel, H","venue":null,"work_id":"fa49cdcb-2650-44d4-967a-822c32bf256b","year":2007},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.023400Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:07f9c36e6d7492fd935b3c1a658579b4827076d2e3a99220bbbf56c75686b7e3","observation_id":"efd5287e-6ca0-4f6f-92c8-f8be1c97b915","resolution":{"observed_at":"2026-08-11T16:39:05.625070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1711.07553","last_updated":"2018-04-24T08:19:32Z","snapshot_observed_at":"2026-08-14T20:11:44.023605Z","submitted_at":"2017-11-20T21:28:40Z","title":"Residual Gated Graph ConvNets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-11T16:39:05.028184Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.028184Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:a35ef9073583b5521452e0b4d927ea1ab95577e9a2c15d43b52875fe4fd8832e","observation_id":"3f586a21-525a-4165-ab13-94238ab43722","resolution":{"observed_at":"2026-08-11T16:39:05.028184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.611657Z","title":null,"venue":null,"work_id":"b2986f00-c671-42c0-a8eb-c19be171e028","year":1983},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.032865Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:ab11cd90e76d7e5880d431d297841e74ea4b31786c77dab49984e9619580cc1e","observation_id":"3545a851-82e8-477e-98be-036e1664c9bc","resolution":{"observed_at":"2026-08-11T16:39:05.614795Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.601368Z","title":null,"venue":null,"work_id":"5e2a00ad-e223-43b0-8e25-ce500d1995f8","year":1998},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.037334Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:01711145d6ca8015c0d3b2a5450992f85daf410b725bf3a2c2f59c6fd2121bbe","observation_id":"c16b6c78-5a5a-433d-a910-4d72b1f3384d","resolution":{"observed_at":"2026-08-11T16:39:05.605481Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.591145Z","title":null,"venue":null,"work_id":"907f0686-861b-4a57-ab6b-bf3fd92dff8d","year":2020},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.041134Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:b326152e8019156a9ef909e32194da821c8454e84a700aad7fd2af2b10afaea9","observation_id":"f0c230a6-3c3d-4b30-ae30-33418c62ad8e","resolution":{"observed_at":"2026-08-11T16:39:05.594867Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.580495Z","title":"P.; Joshi, C","venue":null,"work_id":"215120b5-bff8-43f6-9b78-88a44ffa3556","year":2023},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.045150Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:1266aa150afc5b2b3234cacab1f698a7b242740a00f4efc9bd46938a06fd48fc","observation_id":"21832142-2ac2-4780-ae6e-08f0495d6f95","resolution":{"observed_at":"2026-08-11T16:39:05.584185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.569953Z","title":"P.; Luu, A","venue":null,"work_id":"a3d2a5af-7137-4854-b1ab-f0c3fa3a8b57","year":2022},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.048785Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:616d2f7aa495a89f8004b4b4b11799890913feb3a11333ab6318b03da452a95b","observation_id":"85e9f037-e2e3-46bf-94ba-967e659c7500","resolution":{"observed_at":"2026-08-11T16:39:05.573498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.559493Z","title":null,"venue":null,"work_id":"c06af573-8560-45d0-ac11-e10d3e8162d9","year":2011},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.052253Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:37bfd69516080742afbc042f6d6f4001df9153d993e3ad1140b2c07b0d3194f3","observation_id":"305f361b-dfe6-4483-ae60-04c8e9f76e54","resolution":{"observed_at":"2026-08-11T16:39:05.563021Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.549048Z","title":null,"venue":null,"work_id":"2d9d5e00-ae31-43ee-ae24-ddb3a15b83fe","year":1938},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.055902Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:a9ba08c5f9b384cfc9683e148a931caadca8f7392385082a831ea7dd4da86717","observation_id":"bbdcc07e-e9bd-4a9f-ae6c-f4a13e51c956","resolution":{"observed_at":"2026-08-11T16:39:05.552715Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2004.01124","last_updated":"2020-04-02T16:53:04Z","snapshot_observed_at":"2026-07-06T09:09:27.668521Z","submitted_at":"2020-04-02T16:53:04Z","title":"Nass: A New Approach to Graph Similarity Search","version":1},"cited_work":{"arxiv_id":"2004.01124","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.01124","snapshot_observed_at":"2026-08-11T16:39:05.211557Z","title":"Nass: A New Approach to Graph Similarity Search","venue":"cs.DB","work_id":"e0ae459a-c60b-4732-90fd-656e90383f70","year":2020},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.059443Z"},"links":{"cited_paper":"/paper/2004.01124","citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:c2384b46d3515463631c1c8df755c4a93548a410fd0769ad1fd4af82240f1498","observation_id":"7c8d27d5-6954-4510-ba2a-44fca7485efb","resolution":{"observed_at":"2026-08-11T16:39:05.217646Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.537773Z","title":null,"venue":null,"work_id":"667578d4-9fcf-4bc3-8d7f-19aa24b198a6","year":2019},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.063322Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:b9395fe0b8ad7ee0bba6249a333c2c95939d8893026b739175332d03b61a4731","observation_id":"75b7f834-fadc-478d-9287-12253d5c0a39","resolution":{"observed_at":"2026-08-11T16:39:05.541774Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.526399Z","title":"N.; and Welling, M","venue":null,"work_id":"e82c37c4-8612-404b-9506-ab69269331fb","year":2017},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.066961Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:bb84ccd72e6bf26d8666dbeb79de27c91e9bb6fd33e2c36911fde9dfaf6caf0a","observation_id":"9cd0c7ee-c47f-46d4-bf9e-6a796f238bb2","resolution":{"observed_at":"2026-08-11T16:39:05.530132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.515450Z","title":null,"venue":null,"work_id":"81b0a3fb-93b7-4b19-84c9-5b3427f4d483","year":2008},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.070503Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:7326e9d962ac4cf40d2dd7869a24130fa2f577f0b56c0e710066901cc302e28b","observation_id":"5039293d-fd3e-4f14-ae0c-0689d168e48e","resolution":{"observed_at":"2026-08-11T16:39:05.519071Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.503322Z","title":null,"venue":null,"work_id":"8d7a4160-315d-4d17-9ac2-19de52308f05","year":2020},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.074255Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:1ca900f1f2b1cae00750461b7f28fdd3edc79585b5003684aa3200b4a45793ee","observation_id":"63989ef0-a361-4130-8b23-31c1c061282e","resolution":{"observed_at":"2026-08-11T16:39:05.507561Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.491494Z","title":null,"venue":null,"work_id":"343a7541-7022-4cf3-861c-97a8f190388f","year":2019},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.077700Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:5fec63d639f51101c7323b2d7adc7b903719fec06421851bb0d5f32fecdd1f80","observation_id":"79de66f2-894d-45db-b906-feaa3c91acce","resolution":{"observed_at":"2026-08-11T16:39:05.495105Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.481163Z","title":"X.; Wu, C.; and Ji, S","venue":null,"work_id":"33b1f23d-6f52-4605-bf32-d91cae856423","year":2021},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.081317Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:33c6b212a99ec57418fe6f60a020e69933b9856d6748c2fd852b09b2b0482218","observation_id":"e0e677fb-c8de-4b5d-b9be-b94a7572287d","resolution":{"observed_at":"2026-08-11T16:39:05.484612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.470621Z","title":null,"venue":null,"work_id":"f18bb464-681b-4bd7-90d7-aef72733fd36","year":2020},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.084998Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:da12f78af3e2c931e01bb24ef6199673fde6628a8b6d0ad64723b357021c4b09","observation_id":"34c55605-9f79-4438-9896-863e9650d239","resolution":{"observed_at":"2026-08-11T16:39:05.474193Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.460425Z","title":null,"venue":null,"work_id":"2677268c-4328-48a8-9b66-2e4950678068","year":2017},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.088656Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:e4e46f2346a8cdc1084e2cd503195552376e27c4842280b36f4e21b3979efd9a","observation_id":"a929fa0b-4329-41fd-8164-b272b4b1faa5","resolution":{"observed_at":"2026-08-11T16:39:05.463717Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.449772Z","title":null,"venue":null,"work_id":"faa6c611-729d-48ba-9715-8d4edbfe2ce8","year":2006},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.092254Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:e38299f00f1948710981f43588082f594da5e9f39067732d2587ccd15b3f4038","observation_id":"ed5810ab-247f-4eff-9a8c-fd48f54e105b","resolution":{"observed_at":"2026-08-11T16:39:05.453585Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.095955Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.095955Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:8b9fdbf56dd385691c13bc68ce37f6f434683d64d24198a0baef2673fb60ab5f","observation_id":"82e6c3f8-cdae-4fb1-8ce5-061f42f64ca5","resolution":{"observed_at":"2026-08-11T16:39:05.095955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.430504Z","title":null,"venue":null,"work_id":"0ca7e368-c771-4972-90ed-5d11bbb60b9c","year":2021},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.099426Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:dddba079671ae6513a495508dc584230ac30185128590f3fa4f0d93ca97171c9","observation_id":"925cb0dc-4309-4bdc-a235-e418d5fc954d","resolution":{"observed_at":"2026-08-11T16:39:05.434688Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.419050Z","title":"T.; Sabharwal, Y.; and Ranu, S","venue":null,"work_id":"10c7fe58-6e76-4c45-a5cf-765558e05542","year":2022},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.103313Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:a09760dd0f2a8e7f1a49130acf64aa6f0ed474b6ed3a47511ace549bb181f27c","observation_id":"30bb4abe-4827-4784-8409-c5c35bc63725","resolution":{"observed_at":"2026-08-11T16:39:05.423120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.406950Z","title":"T.; Singh, A","venue":null,"work_id":"e7ec74e9-d74c-4287-b3bf-fc81b1f8febf","year":2011},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.107227Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:2da9262bcdce1015e6e50afa9e5356275d8b28d7cfca0a3e70f76513a44c199e","observation_id":"27473a98-6588-4489-adce-43542db5effb","resolution":{"observed_at":"2026-08-11T16:39:05.411023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.395212Z","title":null,"venue":null,"work_id":"2e95b6d1-a4c4-49d7-b6e8-192c01808500","year":2009},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.111053Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:b3d724a9a5567ad79e4c08757010f73ed38cfe6b1b7d795dc8996df8b0642ffd","observation_id":"343a8a4b-427f-44aa-90a4-b30511e634d1","resolution":{"observed_at":"2026-08-11T16:39:05.398905Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2003.04078","last_updated":"2020-10-16T05:22:01Z","snapshot_observed_at":"2026-08-13T11:34:59.154854Z","submitted_at":"2020-03-09T12:37:40Z","title":"A Survey on The Expressive Power of Graph Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.04078","snapshot_observed_at":"2026-08-11T16:39:05.115107Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.115107Z"},"links":{"cited_paper":"/paper/2003.04078","citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:52f47ee391d59722062d704830cd133e545a4574287434a0a5008c8960a5e149","observation_id":"4795439e-752e-417a-a1da-799f4a3f47bc","resolution":{"observed_at":"2026-08-11T16:39:05.115107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.383630Z","title":"D.; and Ng, A","venue":null,"work_id":"2ecbf065-fd96-43d5-b344-f5fe50d7dedd","year":2013},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.119088Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:95065c43fcdad5f65f5ec08cfaaa95595461e596aa7e49af8f17bdd2f3e71364","observation_id":"7433588b-789a-4139-a9d7-04714f156a66","resolution":{"observed_at":"2026-08-11T16:39:05.387522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.371354Z","title":null,"venue":null,"work_id":"8859c72f-4c80-4029-a5d5-472356f7c66b","year":1987},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.122802Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:f63ec7ed9680380347fbf9a93acd07051b5a25950da3794918b0456688fa419e","observation_id":"feebef3c-9d6c-4e68-a092-6d799e2c6dde","resolution":{"observed_at":"2026-08-11T16:39:05.375405Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.359919Z","title":null,"venue":null,"work_id":"b7ef002f-529d-4f49-962b-1f96aadccf77","year":2023},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.126225Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:6eee4e6efb8ceae35a0712d78b7629478b05f428f79ff06b693af03fc1ac0529","observation_id":"1471857e-c937-4153-851e-970383d3fa62","resolution":{"observed_at":"2026-08-11T16:39:05.363852Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.348538Z","title":"D.; Kramer, S.; and Helma, C","venue":null,"work_id":"5a522feb-58f5-43be-881b-58f3b09fd4eb","year":2003},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.129647Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:8ce5f1cae399f8d959f25fa6f4ea30c6960343da75a88b46698e7ba665a15e6d","observation_id":"76e828bd-fa77-42cd-9a46-a0d05d3b8c1f","resolution":{"observed_at":"2026-08-11T16:39:05.352184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.132858Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.132858Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:5d0c4946a8c0d8034d9b6bdfe7c9331e94ab5e18ca7530827f533a7c809b102f","observation_id":"c013a618-5628-46a5-b3eb-c581ca491dcc","resolution":{"observed_at":"2026-08-11T16:39:05.132858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.330944Z","title":null,"venue":null,"work_id":"8a02b309-e00e-4de2-895e-9f4249547ba1","year":2021},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.136367Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:a6428ad87ad1cb6ba70a68021e9ceaa98bec67de6cc9de44c5d234c4ba375dff","observation_id":"ef04c66e-412b-4de5-bcdd-3b2d182a3482","resolution":{"observed_at":"2026-08-11T16:39:05.334561Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.320900Z","title":null,"venue":null,"work_id":"19e44b08-69cd-4f97-9b18-9ad7c49c8774","year":2012},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.139564Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:81786bccfe70830748556548ed38c493dc1c55a499309a9546cf6082ab59afa7","observation_id":"5386bfc6-4f0a-40a1-b39c-cd4793ddc9b0","resolution":{"observed_at":"2026-08-11T16:39:05.324290Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.310082Z","title":null,"venue":null,"work_id":"e6c97b31-bed4-4af0-b36d-eed2d4c88f76","year":1968},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.143078Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:d2cbb036305a952f03796f654870113a2ae7af7d10a8b37e97112078a415bcca","observation_id":"b3e4514f-9621-4f9a-b245-9148168a1471","resolution":{"observed_at":"2026-08-11T16:39:05.314096Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.298201Z","title":null,"venue":null,"work_id":"2055302f-66e5-40fa-ad58-015f66620f95","year":2019},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.146225Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:bd7f0cd7a3dfc619d41f28bbb08b1db46a4a3c8655630ec9f2b8ec254b572e4f","observation_id":"d43a296c-988b-460f-898c-d6e1b5a34561","resolution":{"observed_at":"2026-08-11T16:39:05.302019Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.286928Z","title":null,"venue":null,"work_id":"c671f862-c24b-4803-bd9e-efd93c6ee018","year":2015},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.149478Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:706f860b5fea2ee479cf7db0bd612c48a2ab71ef18e62abe8218da948bd93656","observation_id":"9bafa13b-c07e-455b-9480-c31090649fe0","resolution":{"observed_at":"2026-08-11T16:39:05.290741Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.274123Z","title":null,"venue":null,"work_id":"87ed021b-f80b-4238-909b-c84e81693ca0","year":2009},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.152644Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:efcf26d02b7fa5cfe4231708d52c8176856915e9135aa691509d2e07cdb955ca","observation_id":"91bcebe3-7033-49b3-bd94-ce24d7a788f1","resolution":{"observed_at":"2026-08-11T16:39:05.279103Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.262432Z","title":null,"venue":null,"work_id":"2165dab3-8350-43f9-8443-1bc3b630d278","year":2021},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.156125Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:8bfb90bb11f664179292cbf7fcb6a64e09562909b94227092b9dea8d47e10a61","observation_id":"59809ca9-b198-414a-bc5b-ea70ea57d2e7","resolution":{"observed_at":"2026-08-11T16:39:05.266185Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.251452Z","title":null,"venue":null,"work_id":"2a63e01a-4fb5-422f-8c0f-c590206da42c","year":2022},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.160045Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:ba7d84477494524bf5863ac149ec6629d86440abb4f8494cf97ba5d319fed292","observation_id":"a13c553b-662f-40ef-bbf9-eb272c5dcdec","resolution":{"observed_at":"2026-08-11T16:39:05.255121Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.163696Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.163696Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:be4cd53f1956f415f087cc684933c83970b21ee0801a936dba6b21e956b4137d","observation_id":"6621abef-b8b7-460a-92ce-38efe9a50d9c","resolution":{"observed_at":"2026-08-11T16:39:05.163696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:39:05.167947Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T16:39:05.167947Z"},"links":{"citing_paper":"/paper/2412.09968"},"observation_digest":"sha256:3cc91ba48d68a910a9d678a3d10fcf7856d1672731c95d660be3f7a88f6d61c7","observation_id":"f24620d2-3dc7-4ee3-a17a-ce6304c00785","resolution":{"observed_at":"2026-08-11T16:39:05.167947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.09968","last_updated":"2024-12-13T08:55:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T15:11:23.106555Z","submitted_at":"2024-12-13T08:55:02Z","title":"GraSP: Simple yet Effective Graph Similarity Predictions"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":1,"verified_fuzzy":10},"total_outbound_references":43},"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 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2412.09968."}