{"as_of":"2026-08-11T14:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de4d87878c0b8e2b99d67acc1e42a088de28bb0abb762017241b5c11846998d8","coverage":[{"denominator":79,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":79,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:30:36.942472Z","state":"measured"},{"denominator":79,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":79,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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.18857/citation-record","integrity":"/paper/2412.18857/integrity","json":"/paper/2412.18857/citation-record.json","paper":"/paper/2412.18857"},"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-11T04:30:37.830793Z","title":null,"venue":null,"work_id":"649f0e91-0400-4c10-93a5-cb7dc3d7a4ab","year":2021},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.639058Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:df9165d8cf0eadfaf5e4ee21634debc188bbc4bc70a9194a468292c3b8c82b92","observation_id":"bd946dcc-ca78-4101-89e3-36c43001ad4a","resolution":{"observed_at":"2026-08-11T04:30:37.834527Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.819349Z","title":null,"venue":null,"work_id":"852fd45d-1bf6-4fa7-9d63-370907727931","year":2019},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.644262Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:ffd897ba4bc498481a8966167df587d148ea502d73a68530298a7f9ab46e8bea","observation_id":"3fe5d27b-11a2-4874-9506-dbb4f851540b","resolution":{"observed_at":"2026-08-11T04:30:37.823253Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.806176Z","title":null,"venue":null,"work_id":"ce93514e-eddb-459c-9820-3d3c8a1b9c24","year":2020},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.648596Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:9b498a3fc1978d6e5da5f6003308e7a62aa40fb8bca038d5f5e3a6579a3b26ed","observation_id":"9acace28-c572-40d8-b319-3d9531a7a305","resolution":{"observed_at":"2026-08-11T04:30:37.810300Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:36.653138Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.653138Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:ca0acbeb888961df9aac060544bdc98b0a5898b33eb51c7f82e6661fc714bdc1","observation_id":"4a717f6d-79e9-4288-9932-d608eae6ff7c","resolution":{"observed_at":"2026-08-11T04:30:36.653138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14103","last_updated":"2025-08-01T13:28:50Z","snapshot_observed_at":"2026-08-10T00:47:54.799223Z","submitted_at":"2022-11-25T13:36:11Z","title":"Conditional Gradient Methods","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14103","snapshot_observed_at":"2026-08-11T04:30:36.658186Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.658186Z"},"links":{"cited_paper":"/paper/2211.14103","citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:2d62dd18e0a23fc45270eedd2d94753aa34c6a8c3bb4279912c6e0a28b893999","observation_id":"a3061496-352c-4503-b10d-ae4102612f21","resolution":{"observed_at":"2026-08-11T04:30:36.658186Z","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-11T04:30:37.787717Z","title":null,"venue":null,"work_id":"e78b6804-c6c5-4ff0-b55a-7a9ddfa8a251","year":1983},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.662404Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:3c62c29dacc4569fd0ae812475284d94d0f3c74d458d29bc36bb1231e96ed92a","observation_id":"552e7f7f-f20a-416b-8760-de677a5d8a31","resolution":{"observed_at":"2026-08-11T04:30:37.791530Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.777584Z","title":null,"venue":null,"work_id":"f4966aab-ff9d-4130-a854-e2bd25e288c8","year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.666525Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:b0e4df6833df6326109e887bf3dc6f5400f1976c42caa32edd2547744ffb4b8b","observation_id":"cdf78bc8-29c7-4979-838c-828b304aa6ac","resolution":{"observed_at":"2026-08-11T04:30:37.780509Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.758633Z","title":null,"venue":null,"work_id":"8639d008-eb6d-4bc4-97c3-b74653d4ae5f","year":2022},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.672948Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:f644182dedacc064c6f5cf8ccc971ede2439396185e3af10479121325242bb9d","observation_id":"2b750723-259f-49d2-8ffb-9e0677bb5899","resolution":{"observed_at":"2026-08-11T04:30:37.762682Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.748457Z","title":null,"venue":null,"work_id":"5f85fdc9-c269-4fab-b960-098b377c30eb","year":2020},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.676008Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:080f99b441146e51ed89126b1156aef8ff18939eb8a57456f8ac1095355bbe02","observation_id":"311a4d71-c430-41ea-a577-2c80758b1f80","resolution":{"observed_at":"2026-08-11T04:30:37.752024Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.737735Z","title":null,"venue":null,"work_id":"444b2b70-e11c-4fd7-a63f-84a70cc3d644","year":1987},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.680349Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:c0b10e083f9284ec5289ffc03ca178c358fa024c4d5ae20b9ce753d7be546d6a","observation_id":"f3e0fb79-89b2-445d-aa6e-8cd341244632","resolution":{"observed_at":"2026-08-11T04:30:37.741719Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.726712Z","title":null,"venue":null,"work_id":"dbf8fcf8-8830-42c5-8164-1c868d131332","year":2022},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.684363Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:27ad77a2ce606e7c03c89e03dfb79b5d3e5203cb73f889594df92008717ec40a","observation_id":"c35d49a5-4bb8-4bd7-a942-282b7293fe91","resolution":{"observed_at":"2026-08-11T04:30:37.730267Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.715602Z","title":null,"venue":null,"work_id":"2e1e11bf-6e4e-47df-acbf-9c4f4a80782a","year":2016},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.688374Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:42aa1b8136c0ee69435ad2212a0cbf4b753cf74a91b845acab6104f05578763c","observation_id":"160a7410-69b7-499d-9db9-6a7ee6429648","resolution":{"observed_at":"2026-08-11T04:30:37.719679Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.704748Z","title":null,"venue":null,"work_id":"fe9da045-6c13-46b1-bba2-7453d92adfa1","year":2013},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.692527Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:ac21615261683fec5ea8daf8d093876d3d41d2ea12aad84c8e1d82d22ee93728","observation_id":"46164ef6-6c4b-4095-bce3-1af03710b196","resolution":{"observed_at":"2026-08-11T04:30:37.708527Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.693495Z","title":null,"venue":null,"work_id":"f00fd63f-6ad8-40c8-b306-435f5c8d3ee2","year":2020},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.696173Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:20cbcc53174dd37f17aea589a7bd18efb374454aeba4474e99ffd78483a372ae","observation_id":"c228b8c1-d365-4ceb-8ada-0674e60afed6","resolution":{"observed_at":"2026-08-11T04:30:37.697145Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.683169Z","title":null,"venue":null,"work_id":"bfb2f66b-1445-417a-81c5-46a769dc4dc2","year":2011},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.700142Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:fbffed3679978272920e961b24cd5b235a55ec5614af181037105b2cc52fe5f9","observation_id":"b420c5ae-3c84-4523-86c7-3ca63a8ed459","resolution":{"observed_at":"2026-08-11T04:30:37.686630Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.671899Z","title":"Suen, Volkmar Frinken, Kaspar Riesen, and Horst Bunke","venue":null,"work_id":"67d70b88-874a-48c5-a9af-17854c7d0979","year":2013},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.704236Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:aad64a0cdc69d9586fe07a0883909fff8004955ae8a9404257f43e75019454ab","observation_id":"d7bd58de-5c0d-4dcb-9888-7de5fd8d783e","resolution":{"observed_at":"2026-08-11T04:30:37.676390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.659741Z","title":null,"venue":null,"work_id":"af4abd09-78bb-4081-9bef-f56df59ff14a","year":2015},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.708200Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:f827628404990e378ffd2cd08d7272c1c5d8e91bdd42dedcad1916137a5c24fe","observation_id":"ebc72b40-d2d8-41cd-940c-a41532eb3697","resolution":{"observed_at":"2026-08-11T04:30:37.664061Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.644603Z","title":null,"venue":null,"work_id":"6fd34372-b642-4fd4-b653-b51526f02dc8","year":2016},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.711606Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:68972906ed1b898d1bb057502f9d2bd050bb1b028f9e138dd2b092f7d5d9361e","observation_id":"dd8917ae-04c9-4d90-bbdf-ddcb00d217c0","resolution":{"observed_at":"2026-08-11T04:30:37.649103Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12265","last_updated":"2020-02-18T19:49:48Z","snapshot_observed_at":"2026-08-04T16:33:25.229105Z","submitted_at":"2019-05-29T08:11:52Z","title":"Strategies for Pre-training Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12265","snapshot_observed_at":"2026-08-11T04:30:36.715540Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.715540Z"},"links":{"cited_paper":"/paper/1905.12265","citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:1f46dc38ec4865c7af52782a5aa2239881d279966498a96457f66770e3c47340","observation_id":"5fb2de38-baca-4b94-a26f-72e2d4fbe866","resolution":{"observed_at":"2026-08-11T04:30:36.715540Z","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-11T04:30:37.632829Z","title":null,"venue":null,"work_id":"55aa1f6e-8486-4a82-8a0d-f4cd418eb977","year":2006},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.720331Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:ce99dcc4ddf05bd949c6e27eb0cb6f05ff5f8a93f583a1d809ffde3705c52abd","observation_id":"751014b4-c2d3-4177-bd03-68aacf71fbd0","resolution":{"observed_at":"2026-08-11T04:30:37.636291Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.621569Z","title":null,"venue":null,"work_id":"d9cc8826-d6ed-4c8f-8da5-3abb76bfbae4","year":2021},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.724000Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:f11d524a8efd60ba050105da3d6798de472e5254b9f23d1ce274fea3264f9478","observation_id":"10fb556a-6d14-4970-a270-bf4c6ae1a44b","resolution":{"observed_at":"2026-08-11T04:30:37.625334Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.608956Z","title":null,"venue":null,"work_id":"928da541-e9ce-4d15-908d-7839217e15b0","year":2019},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.727745Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:f545e048ce27a88827238d3dd04ce5f3e8859f39a532a1dcf5c4799562f798ce","observation_id":"54957257-75f8-49e2-8401-38c78a3b5265","resolution":{"observed_at":"2026-08-11T04:30:37.613301Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.595540Z","title":null,"venue":null,"work_id":"2d127491-3c8f-4c19-ae1b-a4c435557d6f","year":2017},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.732072Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:f871e9b5ed1e16c3b0613ca48db22c7d02e4f804919f150c576d29bc75198724","observation_id":"5c1b6137-c00e-4415-81c3-146512d49a3a","resolution":{"observed_at":"2026-08-11T04:30:37.599432Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:36.736106Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.736106Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:56c53831553d96d47edbc33ee9cfeb36d13e8e0d5566a86e0bddbbf1198ffff4","observation_id":"539361be-e2f8-46b9-9e57-63c252ef5dcb","resolution":{"observed_at":"2026-08-11T04:30:36.736106Z","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-11T04:30:37.568165Z","title":null,"venue":null,"work_id":"753cbef9-1084-420d-be64-c145062f019b","year":2019},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.744347Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:c5d85c631c8473e19372ee2a4e1ec59c1d64cc07b6cb72921ae86544839e8572","observation_id":"cfae19e5-f470-4d26-8dff-64848045dcda","resolution":{"observed_at":"2026-08-11T04:30:37.571618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.558447Z","title":null,"venue":null,"work_id":"623b73c8-347a-4291-8ee3-7d9f6c572cf8","year":2017},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.747846Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:0201ff05cb80a86d915db05d4e203f157354610802c3b71b4ecaeabbdb502a2b","observation_id":"ce67694f-c09e-4af0-a2a6-234519041e08","resolution":{"observed_at":"2026-08-11T04:30:37.561847Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.547401Z","title":null,"venue":null,"work_id":"2b013459-f6c2-47c9-bf1e-ca7f38b61326","year":2017},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.752591Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:0554fe3cee1a2e3b8392d40a275e907538950be7d718f106fe9a77eb837ec61e","observation_id":"86f4b833-8308-452b-b7f1-06770c6513fc","resolution":{"observed_at":"2026-08-11T04:30:37.551157Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.536685Z","title":null,"venue":null,"work_id":"eb9b42ae-b938-4ec9-92ce-98c1a85b1ca9","year":2023},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.756492Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:8bb450d7118b0f301f1a909156e60569a529fff62b4bb358c4e16e8fc30bc030","observation_id":"9ace637a-7935-42c8-82c4-7bbc24ac69a5","resolution":{"observed_at":"2026-08-11T04:30:37.540760Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.526533Z","title":null,"venue":null,"work_id":"f2a673ea-5f1d-4853-9670-c4a654ae7d6e","year":2011},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.760462Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:e223af60a1a36c8059b9127b4932cf43d1df47f73da5b72b3c516b7b59d59225","observation_id":"f59600a9-7b71-429b-be51-3664c510ba50","resolution":{"observed_at":"2026-08-11T04:30:37.530085Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.516122Z","title":null,"venue":null,"work_id":"58b737f2-850f-4c7d-bea1-906a44c212b9","year":1957},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.764477Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:f824f5a41556e232787a4f8f3d847e6d1c94522b17041fc1ec5d6154cf7d2b10","observation_id":"ea1f52ac-2a90-4464-921a-8ba21e5f62ba","resolution":{"observed_at":"2026-08-11T04:30:37.519842Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.505519Z","title":null,"venue":null,"work_id":"51855a06-7b4e-445c-b1ef-173579219047","year":2006},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.769119Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:5dab93531324094730441429f7ea8c54239d8a4ef094bd5321f29074fffb81cd","observation_id":"cedc895c-337c-42f4-bb7a-73134ff179a3","resolution":{"observed_at":"2026-08-11T04:30:37.509195Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.495968Z","title":null,"venue":null,"work_id":"07e4f866-5952-49a7-9004-e3173dca6e16","year":2019},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.773098Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:0f9104af4256db7829a93df690729fd4465ec3895041fa1b28028984cb08a64d","observation_id":"fa64edc7-6700-4c99-8391-81f315f38ed1","resolution":{"observed_at":"2026-08-11T04:30:37.499565Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.486847Z","title":null,"venue":null,"work_id":"a82ba229-e669-44f3-a257-b26930f12cfe","year":2019},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.777642Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:66e74fc90b3d752c0815056f9234e3dc8ec33b24f27b7bbab2a0e24c662ad2ab","observation_id":"96038e1f-8fcf-4700-82db-333347b47f6e","resolution":{"observed_at":"2026-08-11T04:30:37.489962Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.476854Z","title":null,"venue":null,"work_id":"5238e0ca-942d-45e4-b2b4-8ca34805808f","year":2016},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.781740Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:ee021107b55c93a82ddb2dcaca8baf7630cdd9b407210ab406dc762ad6acb6f2","observation_id":"f30baa50-7f40-4e39-a1a5-5141b464131f","resolution":{"observed_at":"2026-08-11T04:30:37.480102Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.466645Z","title":null,"venue":null,"work_id":"cb9d3ad4-1566-462e-8e99-7de96bd7540c","year":2023},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.785067Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:d97dac77c44cdbc61edf6e3078d6f23ba35149c2882312cdf915ee22e5d85fc6","observation_id":"1432fd2a-ca88-4019-bcf4-0b32c227f4d9","resolution":{"observed_at":"2026-08-11T04:30:37.470402Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.455922Z","title":null,"venue":null,"work_id":"df90d04a-3d8b-452e-90b8-a870509416e7","year":2023},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.788781Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:d975f4c155b27bf65eb48e229a86d3b70cf3b8c619d3c078407eb0f1fd4d06c6","observation_id":"b2955154-2757-44b1-a13d-bd4b38ed696b","resolution":{"observed_at":"2026-08-11T04:30:37.459521Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.445776Z","title":null,"venue":null,"work_id":"1d9710e8-e805-4750-8b0a-1b5a306f97f3","year":2022},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.791821Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:7c956df7c196cf263605a260e12e6609dba4648e71f520ab35916abe21249cf6","observation_id":"270ca983-9b1c-422a-9bf8-0de9c0548ecc","resolution":{"observed_at":"2026-08-11T04:30:37.449308Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.434997Z","title":null,"venue":null,"work_id":"37ffaeea-4110-40bd-8de1-48609187fa32","year":2008},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.794923Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:32ceab0c646116230ce710299c5c1820c60616da66d4bba12a22bb8076620658","observation_id":"f9fb2b8a-e1ad-4c3d-b1d2-1cbdb5a275c0","resolution":{"observed_at":"2026-08-11T04:30:37.438802Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.425098Z","title":null,"venue":null,"work_id":"9d896127-598f-45f7-8a27-7725bda7dfec","year":2009},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.799238Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:3e46a890d3711b79b17aee78346d14be66eff8e2079ec4f473dc0003a2a8f94e","observation_id":"385280b0-95cf-4ed3-94b6-f9579cbbf715","resolution":{"observed_at":"2026-08-11T04:30:37.428674Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.414573Z","title":null,"venue":null,"work_id":"24d35428-9da7-494a-b1c7-50eddb71ce61","year":2013},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.803765Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:72df32a3ab60b610fbd687f01cd205940286955a23f7cf940b4dbf718f398c3a","observation_id":"b985b78c-18e9-4b4a-a8c9-01d1ccd579cc","resolution":{"observed_at":"2026-08-11T04:30:37.418572Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10993","last_updated":"2023-03-20T10:21:29Z","snapshot_observed_at":"2026-08-10T02:14:11.377359Z","submitted_at":"2023-03-20T10:21:29Z","title":"A Survey on Oversmoothing in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.10993","snapshot_observed_at":"2026-08-11T04:30:36.807105Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.807105Z"},"links":{"cited_paper":"/paper/2303.10993","citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:f9a69b9be19f981fcc4888d1e303213e2ae59f419280f8fc301a08df30e00a2d","observation_id":"00fadb79-cb7a-4b6d-997d-44d40873204c","resolution":{"observed_at":"2026-08-11T04:30:36.807105Z","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-11T04:30:37.404176Z","title":null,"venue":null,"work_id":"7db4403c-2a62-4253-b5ff-dfe414c23f7a","year":2011},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.810990Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:574523eec6ac7e2883b5684d2dc1ba1d67352cae0e80ef658af8d67766ff1643","observation_id":"498825fe-b56c-4102-9c09-9a730b278bf0","resolution":{"observed_at":"2026-08-11T04:30:37.407650Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.393155Z","title":null,"venue":null,"work_id":"3970f67e-f9a2-4c69-8580-36fa4d928949","year":2024},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.814774Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:ecb45552536fb1659ccefa4af5b7fc3127ea5bafbcd479a7d81abba15efe9aea","observation_id":"a2c79f96-5c8f-4950-bf33-3d0b25ee17a6","resolution":{"observed_at":"2026-08-11T04:30:37.397012Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.379789Z","title":null,"venue":null,"work_id":"25230c50-7c97-43d0-9eee-574b066224fc","year":2024},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.818516Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:f6d905b525e0e3f1cbfaf0d1ddd24c013360b2318ca7deca94b2aada92e291d5","observation_id":"706aa1b4-984f-45e2-a60c-aa54835672e0","resolution":{"observed_at":"2026-08-11T04:30:37.383530Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.367881Z","title":null,"venue":null,"work_id":"aea6560c-d4de-4b17-98ac-059760041e4d","year":2023},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.822119Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:75b55efbea06a5418ed2ced965f0232276d089e1dcc0061bf9311d3b5b332612","observation_id":"ffcefed4-fe11-4b4b-a6e8-d2691f62b2ad","resolution":{"observed_at":"2026-08-11T04:30:37.372366Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.357264Z","title":null,"venue":null,"work_id":"f71b04fb-0ffb-4f89-87c7-db1b1e5e0c42","year":2020},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.825665Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:80555b854771fc6bf9de1bc0dd7ed0740a38608787e807c34bff4c40b70ef50c","observation_id":"b8a2f298-ffe7-43f4-a8e3-77985e665568","resolution":{"observed_at":"2026-08-11T04:30:37.360768Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.346443Z","title":null,"venue":null,"work_id":"3e957356-d496-4866-8d68-4f24e33b2cf0","year":2019},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.829568Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:0f4faafbdaad152733e36198e673f9264d794b597afe8f6fbc4c0184b1213358","observation_id":"46f3fa37-068d-46e6-a4e7-d8d2d0fa9c52","resolution":{"observed_at":"2026-08-11T04:30:37.350024Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.335358Z","title":null,"venue":null,"work_id":"80f3a42b-ba05-49c3-acf9-058de42d8e07","year":2020},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.832883Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:74c12d281773c8b436355cbc9357c975888482b354aa7767e3f7c549fdd3d5b6","observation_id":"8f0ee190-cd6e-4746-844d-2c6e797c30c9","resolution":{"observed_at":"2026-08-11T04:30:37.339789Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.323553Z","title":null,"venue":null,"work_id":"1d2a0dce-65bb-4b7f-9ef4-18392e957893","year":2019},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.836077Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:d4ff9f0c724d57e49fd0b7c3ec3c5f7e15e0105367772934c2b38f69a13c3d63","observation_id":"c0232e21-1be3-413f-a68e-d79137b7bcfc","resolution":{"observed_at":"2026-08-11T04:30:37.328426Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.311082Z","title":null,"venue":null,"work_id":"6c085112-a322-4ca6-9068-0cd3654eefdd","year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.839650Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:4f6d04b732cfe5a9fd5775e0cc32ccd2fb45f9d38a6f7647d42c072d422cc4c1","observation_id":"6ed7b178-86ff-418c-a471-c742d9b280d7","resolution":{"observed_at":"2026-08-11T04:30:37.315469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.299302Z","title":null,"venue":null,"work_id":"de76c350-25a0-4183-9899-ebafe53d994d","year":2021},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.843985Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:23370ce63090a8e5808af64d503ec4886a2427bb8e5452bfba758d4d6c50f1b9","observation_id":"e23983a9-3633-4046-8210-ff8c0eb00703","resolution":{"observed_at":"2026-08-11T04:30:37.303205Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:36.847650Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.847650Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:f13cc15f3dd331881ab2495e02f7237b975380f49733fe9413ff76d2761d226b","observation_id":"7987c384-781c-4292-b453-880653df4ceb","resolution":{"observed_at":"2026-08-11T04:30:36.847650Z","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-11T04:30:37.271672Z","title":null,"venue":null,"work_id":"ba360bd9-bc6f-4868-beca-0c75d33ff83e","year":2024},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.855293Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:7303049bb018a22a4750f7a7d785c2cb7cd918dcf0b531c3e6807a4c00dbb4be","observation_id":"6f3fbf98-488d-4173-9763-ce6fdb64c630","resolution":{"observed_at":"2026-08-11T04:30:37.275082Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.259407Z","title":null,"venue":null,"work_id":"ef3c3735-413d-4f3a-a5f8-e9be3366d34e","year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.859223Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:1595f1aa9391a10db7ff46388cce9eb3e7f33e4f5c326eaed0fe5fa345c0c5af","observation_id":"0883bfe5-02d3-4673-80d3-619440be9d67","resolution":{"observed_at":"2026-08-11T04:30:37.264190Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.237972Z","title":null,"venue":null,"work_id":"a8d9f750-9e6e-452d-bb41-4114d3012c81","year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.867155Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:8ebe385e69668f9c3dff9b531d2ba0b13d4c209071a8410421a428f773a87b87","observation_id":"13741cf9-88c5-4452-a45d-e8bd335b865a","resolution":{"observed_at":"2026-08-11T04:30:37.242617Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.214472Z","title":null,"venue":null,"work_id":"8403ebe5-742c-4b89-b2b9-8df0c5819202","year":1969},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.874587Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:27b8a16b3976aa36614a6979790eff11de8bd60291c58552a201e8d641c07490","observation_id":"e76b8b21-2953-4c3c-9bbc-743ddffc7e64","resolution":{"observed_at":"2026-08-11T04:30:37.218270Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.203827Z","title":null,"venue":null,"work_id":"fdd7bacf-f8d2-47f9-8f8a-a003ba95bf30","year":2008},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.878516Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:6b86076671f9a0ac0ed6a1a8438e4894728184599e948bb585013bb933f3260e","observation_id":"6a27e27c-13cf-4e7f-adff-60c0456924aa","resolution":{"observed_at":"2026-08-11T04:30:37.207578Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.194765Z","title":null,"venue":null,"work_id":"fe70c658-fa33-4865-b123-fe166f81a2ef","year":2022},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.882929Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:6cf68a36a782283b15974826ba68779a6fed79bab68ad26755b8511ca125468c","observation_id":"00f9f479-d4af-41c2-8432-6eeb718ebdf0","resolution":{"observed_at":"2026-08-11T04:30:37.197664Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.185425Z","title":null,"venue":null,"work_id":"b3aab70a-ac6e-4e20-ae59-064a839ab2a6","year":2019},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.886611Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:4deb260c263d709581c8eb6401cf553b6e0e04a0377375548977c8f597ec3201","observation_id":"49edf7df-1ed9-4ed7-a696-b50989bfe0ce","resolution":{"observed_at":"2026-08-11T04:30:37.188899Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.174555Z","title":null,"venue":null,"work_id":"b84dae2c-0385-4548-b706-57334022d8c2","year":2021},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.891049Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:7f20040cf061a585a800dfe658dc4b43ec57f4b0c8449d27bdb8519527f82caf","observation_id":"e7a21681-60fd-4054-969f-6e48feea1818","resolution":{"observed_at":"2026-08-11T04:30:37.178350Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-07-06T07:05:24.565760Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-11T04:30:36.894729Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.894729Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:59ae290abac74a3ac33b570f5b68d24874873a2a2d2442acd6ac8fa6deedec53","observation_id":"3928e7ef-3cb2-48a2-a5cf-662833556709","resolution":{"observed_at":"2026-08-11T04:30:36.894729Z","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-11T04:30:37.162943Z","title":null,"venue":null,"work_id":"926a798a-bcba-449e-9f43-7766a6a0600a","year":2021},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.898880Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:5f1bc6c04743a3421e5aae2e16b052629e9eecf65fcc3c75816ee83538c91393","observation_id":"54dcb19b-b05f-40e8-87ef-ac70882d4e2b","resolution":{"observed_at":"2026-08-11T04:30:37.166575Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.151310Z","title":null,"venue":null,"work_id":"3486b3a4-88a4-4024-bdf0-2a92effc1f0b","year":2022},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.902352Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:d6ae1de24fddc43249bccb5eafc64a75b8868b168914a7c340e75113114b96ec","observation_id":"06df0311-1fa1-4506-aaf2-b5ec05c4a781","resolution":{"observed_at":"2026-08-11T04:30:37.156219Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.140410Z","title":null,"venue":null,"work_id":"86997828-c2c9-4df4-8c67-a6c85dffeaac","year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.905864Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:79483e6931723d2cc1d4b6a428c60fd1f8f5076084deccaea2386fb485c6752c","observation_id":"415869be-5bd3-4267-9287-e1ecaba473cd","resolution":{"observed_at":"2026-08-11T04:30:37.143989Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.120492Z","title":null,"venue":null,"work_id":"cec50752-c323-47b2-b4cf-01afb9202db8","year":2022},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.912715Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:fd1ddfab20fdf31e02e8a736efaf8f9c1c38eb8dd90dc7a4c1c100faebf94563","observation_id":"5e364317-4f3b-4cf7-b780-725535cf3aec","resolution":{"observed_at":"2026-08-11T04:30:37.123619Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.111107Z","title":null,"venue":null,"work_id":"68e7ecfb-3904-4b8c-a3b5-8f723f772d5a","year":2018},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.916463Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:6090ef9402a3dfc14c75ca214c9e6d38b79dc3476e2c86adbaeee631240a4633","observation_id":"fe838262-d060-482f-9915-847b6c7b5fea","resolution":{"observed_at":"2026-08-11T04:30:37.114548Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.099718Z","title":null,"venue":null,"work_id":"4de45eda-6052-4461-94c8-c71cded30593","year":2024},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.920241Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:58830fb7f321d1310927e5cc313fcf94b42d517141776af6d52d4cd03b004667","observation_id":"29852fb5-7a89-4556-8407-af2a2a08b6fd","resolution":{"observed_at":"2026-08-11T04:30:37.103624Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.084190Z","title":null,"venue":null,"work_id":"d35c8a1c-5467-449b-bd1f-0d9d9ad4c88e","year":2021},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.923338Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:4f38497630f2cdfd0af3bcfe98b4e421ef672edc89880464d25b86fe4644ca94","observation_id":"76395424-f287-422e-8903-70d44186d00d","resolution":{"observed_at":"2026-08-11T04:30:37.088188Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.071098Z","title":null,"venue":null,"work_id":"f839c3bf-e683-4de1-a538-2467d114331a","year":2013},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.926997Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:e970f7bbca7802ab44db91b508aafbc394f4ffc35586683e61204d025127159f","observation_id":"edc970e8-f4f5-447f-886e-71f36a757cce","resolution":{"observed_at":"2026-08-11T04:30:37.075154Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.059110Z","title":null,"venue":null,"work_id":"dd404e70-a9f3-4b48-92eb-0d1f2b6b8778","year":2012},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.930767Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:5edc15befa3559f5daa2dd297928661dfec9bfdcc5763619e57c773c62a8f1cf","observation_id":"b3f6b1f1-da5e-4341-9994-0b02e5e4bbca","resolution":{"observed_at":"2026-08-11T04:30:37.063233Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.046797Z","title":null,"venue":null,"work_id":"429e1974-08d3-4c38-a090-590905d72af3","year":2018},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.935060Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:0cd71acf555d53320fa8fbc74b18fc27c68e0ddf191fd11d5b305401d283077c","observation_id":"ff075b28-6f9a-4895-b3b0-f0cd42aa19f8","resolution":{"observed_at":"2026-08-11T04:30:37.050860Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.036763Z","title":null,"venue":null,"work_id":"7922298c-340a-489a-ab8b-e095ea97e32e","year":2013},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.938736Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:10fe0e1cabc9779ef4e469bfc2cb5789afe6ee434f00c78a83456393bbe3d061","observation_id":"8a11345e-c47b-4972-b5a0-80f93f5c15cc","resolution":{"observed_at":"2026-08-11T04:30:37.040260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.024963Z","title":null,"venue":null,"work_id":"0fa54b9b-81e4-4931-bae3-c19c10bd629a","year":2020},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.942472Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:976afc3621f747d60e0bf74de29961a9cbd7cf4141bdd7c6c3478304ca7215cb","observation_id":"265ecd81-dcd5-4157-8f8e-fd8b526983b8","resolution":{"observed_at":"2026-08-11T04:30:37.029311Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.130222Z","title":"PVLDB 2, 1 (2009), 25–36","venue":null,"work_id":"32c864ad-d1f2-4807-8933-49ca2d773813","year":2009},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.909263Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:54e9eb142402e004a2533d71716e2d95ce3a9144b453474acf3041e9b7f16286","observation_id":"7a1de034-98ce-44ad-a1cb-640b83bf41d0","resolution":{"observed_at":"2026-08-11T04:30:37.133598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.226334Z","title":null,"venue":null,"work_id":"d4874e3c-fa20-42c0-acc6-de0af136cec1","year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.870733Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:d4c518a514944286cac3492678c6efa87202d9b1583c75afce4487e4c3692d22","observation_id":"ab37de7a-5790-4948-afae-79b42c9aaab9","resolution":{"observed_at":"2026-08-11T04:30:37.231000Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.768739Z","title":null,"venue":null,"work_id":"af0f5fb9-d830-4248-9ada-497e1fa46e56","year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.669805Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:7a2b130c173b5c8171ad08207cd42ffa9e1ea2e7e9b789d0ee71feffe12d0d4e","observation_id":"97761b15-96b6-46a6-b003-9e0f95cb4916","resolution":{"observed_at":"2026-08-11T04:30:37.771666Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.248872Z","title":null,"venue":null,"work_id":"d2c49d60-4e3e-403b-a4a3-e962a0757cc1","year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.863486Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:9b529caee2b76731c54ee9b64639303efe56a39e7a5931f58de9e346bf735427","observation_id":"11ca5ab3-bcdd-4c2e-b24b-5f3e4273be29","resolution":{"observed_at":"2026-08-11T04:30:37.252598Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.282261Z","title":"In SIGMOD","venue":null,"work_id":"4743df41-6f60-407d-b927-6ba11f347e5d","year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.851460Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:7578c8c7b2ffa2d9399748d9e68213967270562a530ce891b543ba4496c1db60","observation_id":"1f92833c-6793-4483-bed3-541186e04ece","resolution":{"observed_at":"2026-08-11T04:30:37.285774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T04:30:37.577827Z","title":null,"venue":null,"work_id":"43381de0-7aa7-4efe-a170-2f85511a4bc9","year":null},"citing_paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T04:30:36.740451Z"},"links":{"citing_paper":"/paper/2412.18857"},"observation_digest":"sha256:238fd428c53786a61211099f428b96a1d45d91dc81bddc37234d6ebd0d2f773f","observation_id":"9f4f683d-f10c-43cf-80f0-2b88e43d4b3d","resolution":{"observed_at":"2026-08-11T04:30:37.581861Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.18857","last_updated":"2024-12-25T09:55:14Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T04:22:23.475199Z","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport"},"reference_resolution":{"displayed":79,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":76,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":79},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 79 of 79 outbound references and 0 inbound Pith citation observations for arXiv:2412.18857."}