{"as_of":"2026-08-12T23:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:50cfe9b81d31c2ec8082971f2291a8495ccc5c49b34d7b1b9f8a770048a495fc","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T16:33:50.595967Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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.12185/citation-record","integrity":"/paper/2412.12185/integrity","json":"/paper/2412.12185/citation-record.json","paper":"/paper/2412.12185"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:51.111781Z","title":"Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern recognition letters 18 (8) (1997) 689–694","venue":null,"work_id":"21ec8e3f-b807-4609-95fc-e93b347054e0","year":1997},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.436857Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:db5678746ecfa2557ee9ba084e7c7dfd507e916c9c3e09a41413556a8ef14b5e","observation_id":"9071d8e8-05b7-4619-8b4c-21b35d5d5141","resolution":{"observed_at":"2026-08-11T16:33:51.116100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:51.096692Z","title":"Neuhaus, K","venue":null,"work_id":"697d73d5-999a-4456-a763-7117edcb3946","year":2006},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.442458Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:def87e18819c981f36e7435cd1b2a525036f10824a4479981a1455177193e967","observation_id":"15272b0a-81c9-4948-9c54-b77f4d7d5ad3","resolution":{"observed_at":"2026-08-11T16:33:51.101022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:51.084198Z","title":null,"venue":null,"work_id":"cf3fc7f1-7bea-486c-b62a-e178a7f86e44","year":2009},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.449005Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:3775a08892aab771349e5e232185d85d9a7e7dbd84a26c7c0cf39f8b39bf1df7","observation_id":"68c14135-a25b-4563-ac7e-9b3cd0833322","resolution":{"observed_at":"2026-08-11T16:33:51.088133Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:51.069115Z","title":"Fankhauser, K","venue":null,"work_id":"0f1e70d2-e6ab-4323-a597-4020b48478e7","year":2011},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.454494Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:f7c6f78b12d14a52868fe23720c73e81a2ea32e577018c9833dd2b4c75cff4c4","observation_id":"37fd828d-bb34-483b-85e0-621282787115","resolution":{"observed_at":"2026-08-11T16:33:51.073617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:51.055086Z","title":null,"venue":null,"work_id":"a7d9d8e5-37b4-48c3-8007-81e3af2531d4","year":2023},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.460059Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:d8d44c266765cf5b3fdfd6823225d261f19ee341926d27f7908cb58f39c57320","observation_id":"3b5f3e11-fc6e-4020-81b6-6aebb3c13286","resolution":{"observed_at":"2026-08-11T16:33:51.059825Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:51.041003Z","title":"35, 2021, pp","venue":null,"work_id":"83417612-7eca-40de-963f-b2cec936ef54","year":2021},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.465370Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:e37906a650b74d62fc0e46154d347c97471c4007a2ceb1aba664e45511127c34","observation_id":"59785091-4853-498c-8000-22f9fd73f6e9","resolution":{"observed_at":"2026-08-11T16:33:51.046122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:51.024627Z","title":null,"venue":null,"work_id":"ca3bfec5-903d-4bff-ac0f-2b5374affb8c","year":2021},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.470607Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:28a9476074e5d011c245d8e2d9910a2cb1c60f4e436878e1bcaab14e4f4741b9","observation_id":"18db6a0f-804b-412b-9564-ded93402648a","resolution":{"observed_at":"2026-08-11T16:33:51.029692Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.09621","last_updated":"2020-01-27T08:05:57Z","snapshot_observed_at":"2026-07-06T08:52:52.033697Z","submitted_at":"2020-01-27T08:05:57Z","title":"Deep Graph Matching Consensus","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.09621","snapshot_observed_at":"2026-08-11T16:33:50.475336Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.475336Z"},"links":{"cited_paper":"/paper/2001.09621","citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:15e5a05427dd2f1d0f99048e724a0d0224afecfa26159338010b5060b4692834","observation_id":"ed481c39-f75e-44b3-8b89-a33b615b5ac1","resolution":{"observed_at":"2026-08-11T16:33:50.475336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:51.007332Z","title":null,"venue":null,"work_id":"46462aa8-dbe0-42f3-94a5-96fda59bcce6","year":2022},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.485573Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:ffabcb9fff45a5893308152682b9fed9bfbb387570186544e0406cf5694a5925","observation_id":"3077d13c-c461-4c39-bd49-0241d689bf04","resolution":{"observed_at":"2026-08-11T16:33:51.014047Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.986878Z","title":null,"venue":null,"work_id":"79e4b7c9-a98f-440e-83b5-4f3ba0d58fa3","year":2021},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.499462Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:99d56ed9f07eb064a528374b28eaccd841a7e53e172192c3aecb61fa9379a2d0","observation_id":"3972d2c9-a59d-48d5-a928-fd4a7129b521","resolution":{"observed_at":"2026-08-11T16:33:50.993566Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.972831Z","title":null,"venue":null,"work_id":"23bcdd6c-5583-4896-abaa-ced8ea832878","year":2020},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.503542Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:fbb9e82a419cf70e37cae7d3cc743c02af0446e16ebd007c332347888aa920b1","observation_id":"5798ee7b-9e70-429e-ae04-89d89aa6b3e1","resolution":{"observed_at":"2026-08-11T16:33:50.977813Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.960576Z","title":"Petric Maretic, M","venue":null,"work_id":"008ea5ca-2383-4448-8a20-d0157ebfe6d8","year":2019},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.508557Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:dbd79e5a58c2509223720822d77b9167651e9bd8b934e0de188be57cc84c2974","observation_id":"b4aacea2-7bd1-42ca-a169-a6e80baf9269","resolution":{"observed_at":"2026-08-11T16:33:50.964597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.947938Z","title":null,"venue":null,"work_id":"11dce51c-8f79-4bfb-bd67-6bdb93f54ed9","year":1988},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.512410Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:5c54120bdad6b72851fa5716dbae5d07e4c2e5a234c05ef18fabd066d9451da1","observation_id":"dabc1d8c-9f76-4055-a91b-eee7deae640f","resolution":{"observed_at":"2026-08-11T16:33:50.951778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03092","last_updated":"2020-10-27T17:48:05Z","snapshot_observed_at":"2026-08-12T11:32:52.945542Z","submitted_at":"2020-07-06T22:06:38Z","title":"Neural Subgraph Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03092","snapshot_observed_at":"2026-08-11T16:33:50.516383Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.516383Z"},"links":{"cited_paper":"/paper/2007.03092","citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:b6c2ac79a2f60ac3bb77d564de769f0ba358e1bd3fdf75995462aab94267bae0","observation_id":"21f7f5f3-08d3-4632-8f6f-1e898a94cc4b","resolution":{"observed_at":"2026-08-11T16:33:50.516383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.932355Z","title":null,"venue":null,"work_id":"9d8d876b-370d-4745-81c2-3c88ec3073c2","year":2016},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.520341Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:c9d4264bba89be42731a15d7994c3dd299ba2ab53e3b43b6e07d851093e254e0","observation_id":"ece4e0ed-c8c4-4197-a530-0d80aea47ccf","resolution":{"observed_at":"2026-08-11T16:33:50.938463Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.917196Z","title":"Perozzi, R","venue":null,"work_id":"a6ba8a67-367b-434a-9fd3-762bd4f9a664","year":2014},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.524621Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:1419b5dc48e7996f31d17517626498c865d64432ffc628710611f36f4dfeca3e","observation_id":"ea9384b4-8470-46be-bf27-ef859171fac3","resolution":{"observed_at":"2026-08-11T16:33:50.921078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.903420Z","title":null,"venue":null,"work_id":"a2777f91-0760-4bcf-a9af-05027b8c3ec1","year":2019},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.528770Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:6629b3fbd1bc24c74ec6b052f9c8150b8bf9fa08c814a215ddf125497ab440cf","observation_id":"a836eab2-c0fa-49f9-b969-680843c2e007","resolution":{"observed_at":"2026-08-11T16:33:50.907571Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.889034Z","title":null,"venue":null,"work_id":"468c5498-a555-43d9-9b84-1f4eff5c81a6","year":2020},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.532351Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:73730c40aa583ac337cf2553b320ad253db244fd4fe3ab9170aae6e2779ecd53","observation_id":"4352bff0-7025-4920-ba83-ea194c075037","resolution":{"observed_at":"2026-08-11T16:33:50.893750Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.867851Z","title":"3835–3845","venue":null,"work_id":"1f8e687b-a288-43a6-9d41-a9808e6660bd","year":2019},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.535694Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:5e4565a339a7b15288c4ca1a27593e2b9d901766baf22d9ebcc5377bc22aa5ef","observation_id":"40bcd9cc-54b0-40c7-9d60-0e49b7ad5b1a","resolution":{"observed_at":"2026-08-11T16:33:50.872602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00981","last_updated":"2024-08-08T02:15:53Z","snapshot_observed_at":"2026-08-12T23:09:51.968663Z","submitted_at":"2024-08-02T02:31:54Z","title":"Cross-domain Named Entity Recognition via Graph Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00981","snapshot_observed_at":"2026-08-11T16:33:50.539256Z","title":"Zheng, H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.539256Z"},"links":{"cited_paper":"/paper/2408.00981","citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:54a73fc154db336dc98d37232754c9c45084c7aba887cca184923d0973a84cd1","observation_id":"a5ef5ac9-5031-4710-ac59-c14b8d939183","resolution":{"observed_at":"2026-08-11T16:33:50.539256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.846687Z","title":null,"venue":null,"work_id":"d6617890-e78a-4a8c-82cf-aad32c2d7884","year":2020},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.543902Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:bb7490369756bdc630275b6cd324005810b9cb3465f94f129857478b176fe730","observation_id":"8241bd13-7f55-468b-8385-69d036c7ff5f","resolution":{"observed_at":"2026-08-11T16:33:50.851391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.08316","last_updated":"2023-05-15T03:06:44Z","snapshot_observed_at":"2026-08-07T20:54:30.102491Z","submitted_at":"2023-05-15T03:06:44Z","title":"SemiGNN-PPI: Self-Ensembling Multi-Graph Neural Network for Efficient and Generalizable Protein-Protein Interaction Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.08316","snapshot_observed_at":"2026-08-11T16:33:50.548059Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.548059Z"},"links":{"cited_paper":"/paper/2305.08316","citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:0741d814e84a32d192e04561ff8548e53b9073f6e20e494654f2cc05742ae081","observation_id":"22220840-9ddc-4264-83bf-b8f7606a6f60","resolution":{"observed_at":"2026-08-11T16:33:50.548059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.832375Z","title":null,"venue":null,"work_id":"6147dc81-1252-4fbf-a8f7-da8e000f1d50","year":2023},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.552712Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:6294c80c2646f276a5f900d196597e11d2b91d611ab3b6bacec2798edf51def7","observation_id":"6c3c71f7-dd49-432e-bcae-8d4586623253","resolution":{"observed_at":"2026-08-11T16:33:50.836915Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.819702Z","title":null,"venue":null,"work_id":"bfa6ae1a-cb49-4d33-b28c-ca4d3c0780ff","year":2024},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.556713Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:25ece9d1a8fd1677395e456796c65013870e9ae5c7feb3582a0cfe35859b4c53","observation_id":"f3ce1aef-ccad-4791-81d8-2ec859adc6e6","resolution":{"observed_at":"2026-08-11T16:33:50.823167Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.806806Z","title":null,"venue":null,"work_id":"09733ed0-9572-48ca-8c5c-b3a9d5ca069b","year":2022},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.561164Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:73a4361b662f81c9308ce1dc8e5cbd28bbf6533f0e5bd35be9ae6b1b9b97edf8","observation_id":"bfd6afc9-80ba-43f1-a6c8-f064f1ea299e","resolution":{"observed_at":"2026-08-11T16:33:50.810934Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.790550Z","title":null,"venue":null,"work_id":"f08fc67f-9a94-46f1-a274-f2d1814c9d22","year":2021},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.565782Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:09f9534ba4c0a6f2654f8025d9af918671166e5fff3305bfa9dcee71e1823a15","observation_id":"47f11042-9a55-42d7-83cd-5f772ae482dc","resolution":{"observed_at":"2026-08-11T16:33:50.796257Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.771699Z","title":"Raveaux, J.-C","venue":null,"work_id":"87d0266b-8302-4477-ae5a-9ba564294a48","year":2010},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.570175Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:2fde6e92fbaac1eaef8e8d4de95222ddf51d022a55cbf3a0fc7568e5bcb7b69c","observation_id":"d01abaa3-2ce8-483a-bfd9-7cd46ec3bc70","resolution":{"observed_at":"2026-08-11T16:33:50.776647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-11T16:33:50.577599Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.577599Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:52e732a16e84e14fcc38f0f2e433fe68475051bb52ea33d458a79e5b969c9d2d","observation_id":"9a6abb95-0f1e-4216-a76d-22d83f7fc398","resolution":{"observed_at":"2026-08-11T16:33:50.577599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.582414Z","title":"Hamilton, Z","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.582414Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:82c6815f0dbc78929f4a33eea1e008e592cd5331036eb172e763c77d088b4210","observation_id":"9f0ae9d1-686b-4c3c-b130-87d3799f69e9","resolution":{"observed_at":"2026-08-11T16:33:50.582414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.737503Z","title":null,"venue":null,"work_id":"aedbdc57-5af6-49bd-bf9f-320ecd1e05c1","year":2022},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.586886Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:fbbc9fc0f72ab640d04d5c28b09b85e70a9c8ce05493d97670d5cd737de0ae16","observation_id":"243885fd-2445-41c8-9364-93e740a10516","resolution":{"observed_at":"2026-08-11T16:33:50.741883Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.724177Z","title":null,"venue":null,"work_id":"7ee44989-0663-48bd-84a6-77b8de27add3","year":2021},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.591166Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:656daa87065aec5bc01d4d6871bf4aed833489aa7c47045bbac4a7f030911666","observation_id":"f49ae55f-ddc5-4a38-92e7-61bf1204e870","resolution":{"observed_at":"2026-08-11T16:33:50.728219Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T16:33:50.709387Z","title":null,"venue":null,"work_id":"9b92a965-a045-4509-94bd-f324cf780f4c","year":2021},"citing_paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T16:33:50.595967Z"},"links":{"citing_paper":"/paper/2412.12185"},"observation_digest":"sha256:46bf05c8b3f7af26e4ebf3bedc1e90000481eaf21b26558d37e97235db76e4dc","observation_id":"98af6c57-90fa-49d8-bfb2-23caec933bac","resolution":{"observed_at":"2026-08-11T16:33:50.714799Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.12185","last_updated":"2024-12-13T10:23:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T11:33:53.177656Z","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":8},"total_outbound_references":32},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2412.12185."}