{"as_of":"2026-08-15T07:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6971d5b9e5af177baae5f68068bfc9b4cbac02203c0d05aa628df3738de4477c","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-15T06:32:42.880941+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:5bc08df85641cf4bc774c2605fc24e052ba7f36027e9c2365e896ff5ccbe59ed","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:05fde30a49c17441ff968d84d4b30ad5fcbd419cb9bffd94d9ab0967b902d601","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:6ce7b17f3ff7c6dc2c496bfc66f6a31e04ca387bff0744a6f12fc4c3b9f23470","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:a63f4800971518346f6995397ccbaa54722a9fe8d60814f2bef68158f029362f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:478d0b68fc855b4605d14cd7f9ae054d5d5d87ac8daa410740111c4c02065f9f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:baa993ae2ec35839cef6ed5528e92b4f23448409c269a0e30292f8fdf65f66a0","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:5ab244626bf1fc84ea590c0671d893dc233caca73c39a9ee86b195c593569b73","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-14T11:47:06.512027Z","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:e2503e7fdc14cece191eb8ac96d231df666a1bd7522d66750b8f4644d4c5e4fd","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:80b0c91b5bf5435e664410df2985834364a7b3db73e55bcc9b23fa3be95cfa73","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:bd5ca8e7afc6f847dea17c68515b402bc8fc63edb13c99b5031d1f7d5f7279c1","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:eafe287c75008a845c7f905d2361d93a6eff3b37876e571b8e200119843dcfbd","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:015bcf06f81e65c344989a04e7d5811c3dda1ca83451ddbf7c0335ca926b990c","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:ffb09bc51520669b3708568a152b78fb6804d6e14bde6358c103f0f4865d48f0","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:a508e5783c3001a0a030f774e46bfe88b34840c65851187512645d835c71b17e","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:d98bd7a94f4ef7476d59bb1e529080b47d562092b17f8c681d524fcf6e984262","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:706592f52a249b5190f60637e1eea748ca2b8bb91441dc1e9cd52179e39e5dc2","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:85c500fffa688baf82bba45b45b2c423b703b7a329901c84be9aaa692d17ea41","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:5d4c70c39a5513b38aa40b081407c2735f12bcc453e67ff07e03915927ebb22a","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:47:14.167213Z","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:dea71ad685635296c87a71fff96077acd9a0541ccec2572a6b110bf2eca9d99e","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:e5e6d87d42ab93f85c90d41b121a1d9f555224b89101c4412c4f6dc70f9b5c43","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-13T11:42:53.644750Z","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:8c4a6c94105a457dfb468e9bef36b35a163a7af2ce9284dfdcbad478a810c244","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:a6360493092cf618299740fd89eb98478d2949ff3e7b341aac81baf351377669","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:dc79fe4a02d767c8d72167fd00d44e18c6a30cecc7ce62ab1b247359da99bdd9","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:60b0584d903185b94419d9fc222a4ddf0c3e07a28545460497bba5f6ca074f9e","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:883c971e4058a7ac5658ea8a231f4c6e62238cada26fc93ab47d980a693ae7ec","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:ac9454a0d583c310ed956b4b88510db76bf2883c36aeb793cd04c62f4bdd8d7e","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-13T05:06:48.606308Z","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:692dc2d1ef5f1befd3dbba009f1d01970753584f66159d9e4b39c85ca65183c1","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:1d6f888d44964070a2163eb7e4b23ed1cb37d63dc45f88b2d7f344344b2218df","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:e42f9dda4d682905da1c196b1a9b5183a8fc94dedacd37650b161275a4fef58e","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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:1e1d891d8a283f1cb36e5973ad72e65da2d7266683db727526b03bcf42cf0596","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2412.12185."}