{"as_of":"2026-08-17T15:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:999131a1e9edd50921c3443ba9837fee256abbde0c09a50cfcdc7da78232f757","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T01:08:48.267493Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T04:51:26.880090Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-25T04:55:23.867731Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"cited_work":{"arxiv_id":"2505.02124","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.02124","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2505.02124 , year=","venue":null,"work_id":"382c23c0-e29c-4a0c-b7d7-a7d65540d743","year":2025},"citing_paper":{"arxiv_id":"2604.05929","last_updated":"2026-04-07T14:31:19Z","snapshot_observed_at":"2026-08-14T03:28:13.925097Z","submitted_at":"2026-04-07T14:31:19Z","title":"ReLU Networks for Exact Generation of Similar Graphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-10T18:38:54.623816Z"},"links":{"cited_paper":"/paper/2505.02124","citing_paper":"/paper/2604.05929"},"observation_digest":"sha256:3fef159f22650992bfaf171e18aec737899d94fd085e9e5d90ce76eaa44c4e09","observation_id":"2c325099-8455-4470-9180-6716a8dd0f25","resolution":{"observed_at":"2026-05-11T00:15:51.132054Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"cited_work":{"arxiv_id":"2505.02124","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.02124","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2505.02124 , year=","venue":null,"work_id":"382c23c0-e29c-4a0c-b7d7-a7d65540d743","year":2025},"citing_paper":{"arxiv_id":"2605.23754","last_updated":"2026-05-22T15:27:09Z","snapshot_observed_at":"2026-08-13T00:36:55.676484Z","submitted_at":"2026-05-22T15:27:09Z","title":"LLM-driven design of physics-constrained constitutive models: two agents are better than one","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-25T04:51:26.880090Z"},"links":{"cited_paper":"/paper/2505.02124","citing_paper":"/paper/2605.23754"},"observation_digest":"sha256:bcd7e43d8cc7cc287d9d6249a398b4a9899d2a71c600c938c6228e7972beebce","observation_id":"81561526-9eac-4fa6-a024-cd7b9d8ef9e6","resolution":{"observed_at":"2026-05-25T04:55:23.870988Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.02124/citation-record","integrity":"/paper/2505.02124/integrity","json":"/paper/2505.02124/citation-record.json","paper":"/paper/2505.02124"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T01:08:47.235467Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.235467Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:1fa46ebe2c072ccbfa32cb59a24c6e074f2c7864636dbd05b8397224d12f9f71","observation_id":"4d2f6109-1864-4d9b-87b9-9adbb2a686c0","resolution":{"observed_at":"2026-08-16T01:08:47.235467Z","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-16T01:08:47.258202Z","title":"and Zhao, P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.258202Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:ff22a22ed3652d09cd4f013c9debc813d3f95f9fe77ce611e32c961947ef8c4e","observation_id":"4667af61-d923-4e17-bb53-f2e56640dceb","resolution":{"observed_at":"2026-08-16T01:08:47.258202Z","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-16T01:08:50.943133Z","title":"Simgnn: A neural network approach to fast graph similarity computation","venue":null,"work_id":"c4fe1ac7-91f6-4b27-b49c-72ab762e43b4","year":2019},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.264959Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:1fe3d8b97f0c25e0ce70f8ee6afc2fd93783b3ba6eb8e8c58342596556625b0d","observation_id":"a31335a1-1d51-4140-90e1-5c501340700f","resolution":{"observed_at":"2026-08-16T01:08:50.949879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.922914Z","title":"Learning-based efficient graph similarity computation via multi-scale convolutional set matching","venue":null,"work_id":"d1684210-5a40-4c5b-8370-f7bd71e6a8dc","year":2020},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.271756Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:3ae8f46c82a18362892b897a487a9d47244460f8a1949b7f2c29f7f2673edf10","observation_id":"711ae2f2-317c-4c3a-8fba-f6e18d3de099","resolution":{"observed_at":"2026-08-16T01:08:50.929425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.00265","last_updated":"2019-08-01T08:33:48Z","snapshot_observed_at":"2026-08-17T14:04:12.261915Z","submitted_at":"2019-08-01T08:33:48Z","title":"New Techniques for Graph Edit Distance Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.00265","snapshot_observed_at":"2026-08-16T01:08:47.343385Z","title":null,"venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.343385Z"},"links":{"cited_paper":"/paper/1908.00265","citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:76e6b1683df8904302eaf935caf6d683a477c62dc91dc2bea9679743c609c459","observation_id":"1634bd79-bef0-4c5d-b0fb-906eaf82837b","resolution":{"observed_at":"2026-08-16T01:08:47.343385Z","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-16T01:08:47.431959Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.431959Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:1073bafa455e27ec596d7746e76651ed2ee4e4287fa7e109f1920e6be67087c6","observation_id":"633ba8c9-3ab1-4abb-8bb1-93f81b068ef8","resolution":{"observed_at":"2026-08-16T01:08:47.431959Z","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-16T01:08:47.437899Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.437899Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:757adae608eeca1e7ff064328cbb265a445c14e3835765c9b486fe1d2d054a04","observation_id":"0c5773c7-a1ab-4d63-82f8-d8c1dc91eaaf","resolution":{"observed_at":"2026-08-16T01:08:47.437899Z","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-16T01:08:50.809217Z","title":"B., Boria, N., Gamper, J., Bougleux, S., and Brun, L","venue":null,"work_id":"447ecc33-2fe2-4763-8112-d2a4045edf40","year":2020},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.446820Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:31cb63248ef79f2b229cf3d6ba16b35add4d2e9620f71823df7ab3fb4f049047","observation_id":"b980a1e6-98a4-452c-8ceb-889a4ee1f511","resolution":{"observed_at":"2026-08-16T01:08:50.815277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:47.520675Z","title":"R., Ranu, S., and Karras, P","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.520675Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:c36c6326d1591c0a9ed5d667dbebf6242b3169ec755615d701839444e441c6ab","observation_id":"84b3f772-1a85-40dd-acb1-404841cabc85","resolution":{"observed_at":"2026-08-16T01:08:47.520675Z","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-16T01:08:50.761062Z","title":"R., Skitsas, K., Ranu, S., Mottin, D., and Karras, P","venue":null,"work_id":"e9fe05c5-4f3e-4a53-861a-df7d57d500b9","year":2024},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.577675Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:7439999863b01eec8b774073700a1375b11743af72a705ba1437878a7934f721","observation_id":"10eea933-a962-4f94-b2da-36933fd34a2a","resolution":{"observed_at":"2026-08-16T01:08:50.795307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.600650Z","title":"Hogmmnc: a higher order graph matching with multiple network constraints model for gene--drug regulatory modules identification","venue":null,"work_id":"bd881562-ad64-4f27-a68e-cf41f52b8600","year":2019},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.645438Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:64edfc69bb9dc5cb5eac08c8d0b97f0b9c6e78ce50addbfc3f40d0e7ed6f5e1f","observation_id":"37fb5bd6-f0fe-4795-9cdd-ce5edd02a1b2","resolution":{"observed_at":"2026-08-16T01:08:50.663295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.581181Z","title":"Graph matching applications in pattern recognition and image processing","venue":null,"work_id":"d1a89e37-e76f-48dd-9e2c-c2c297ae77f7","year":2003},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.652016Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:2e881f69cee6f2b96a3b918d734ea8c7ee01709e78b174108c4f66858728cda9","observation_id":"7ae86e23-d286-4d48-a436-f2e9ab968007","resolution":{"observed_at":"2026-08-16T01:08:50.588577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.558473Z","title":"H., Leiserson, C","venue":null,"work_id":"3868da52-8bb5-4065-ae74-06575dfe9f8f","year":2009},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.658653Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:abfd03b256609a5ef9247afde4e079ba7c4cd671450de9b4207a57dc15aae5e7","observation_id":"19d242c7-9a0b-4e62-b9ea-350de4f3f81e","resolution":{"observed_at":"2026-08-16T01:08:50.565783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.385259Z","title":"D., Manchanda, S., Mahapatra, S., and Reddy, C","venue":null,"work_id":"96a9935b-5aab-40b6-9e34-03896a54fd8c","year":2021},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.664212Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:89fb349a046383621e1e7b185da0c464dcec3c591062ccbdc81bbb6360464f0d","observation_id":"09c2944e-7408-44c3-bd7d-6a7c9e2aace4","resolution":{"observed_at":"2026-08-16T01:08:50.468981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.365552Z","title":"Spectral graph matching and regularized quadratic relaxations: Algorithm and theory","venue":null,"work_id":"b9ec3684-2cf2-438d-bc56-4d83fdf06a54","year":2020},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.669848Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:7875e0bfc824c3f18d3f92f21746b4b8e7cfdc5677561aeaebdd53c983298af0","observation_id":"aa5b224c-e666-4ddd-8133-e2fcb1fbf4a3","resolution":{"observed_at":"2026-08-16T01:08:50.372180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.313464Z","title":"D., Rusch, T","venue":null,"work_id":"bed654aa-f127-45c8-9fb3-85713e10e3b2","year":2024},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.675258Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:7153c70222d014d1727766610bbc9e6b080f27e3126af8087bfe24946a5e4631","observation_id":"389a6efc-b73f-4ae7-ac91-7bb6c89af58a","resolution":{"observed_at":"2026-08-16T01:08:50.351707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.252743Z","title":null,"venue":null,"work_id":"b174e5b6-e733-4c1a-acaf-2ad2621cd2ee","year":1993},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.680012Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:02c87bc6a3d9fed56e498297e185539ea2e5d5f915fdbdedb4b4663312f9fcca","observation_id":"586fb8eb-669f-4448-92c0-52669ec78623","resolution":{"observed_at":"2026-08-16T01:08:50.258244Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icde.2006.37","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T01:08:48.388879Z","title":"and Singh, A","venue":null,"work_id":"21541d5d-9b8f-4f60-8ccf-f90a3516098c","year":2006},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.757215Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:45a9b8228cd87a2ab759553c53fc81ee86230a914a0971bbf7e566fef2a4f2bd","observation_id":"06a1cd24-feb2-4655-a86b-37317d4a591c","resolution":{"observed_at":"2026-08-16T01:08:48.459956Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.234399Z","title":null,"venue":null,"work_id":"90b6bb2b-f9c1-43e4-9024-7958393c428a","year":1973},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.797407Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:78a6647c3c9842f11ac2c96dcad22f1b175e15281b5d4a7f55246926e6972ff2","observation_id":"5dfd80e4-1884-421f-90a0-3c13366e4fcc","resolution":{"observed_at":"2026-08-16T01:08:50.239609Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.147981Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":"ad1fec4b-edec-400a-b0ac-beb3c063a602","year":2020},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.802934Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:e944f534fc6e604331535aea20573cafffd7d7f00b710906bf3134724e7b5321","observation_id":"d8e67857-385c-4ace-b3e0-26b501870f97","resolution":{"observed_at":"2026-08-16T01:08:50.220340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00687","last_updated":"2021-02-25T02:06:27Z","snapshot_observed_at":"2026-08-16T13:28:09.232356Z","submitted_at":"2020-05-02T03:09:50Z","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00687","snapshot_observed_at":"2026-08-16T01:08:47.809212Z","title":"Open graph benchmark: Datasets for machine learning on graphs, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.809212Z"},"links":{"cited_paper":"/paper/2005.00687","citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:72aaa70fc6e61c38057e985cfe5a0bf33b3fe4346967b3f8bbc0cffe3cbf029a","observation_id":"6c97110a-06b5-41ec-ab7c-01f2d63578c2","resolution":{"observed_at":"2026-08-16T01:08:47.809212Z","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-16T01:08:50.053798Z","title":"Graph edit distance with general costs using neural set divergence","venue":null,"work_id":"469d163d-eeb3-47dc-96c2-ce4a283d010b","year":2024},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.814872Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:3fed805cdfba5758ba3dc0d4fe96a232ea1dcf8c07b06e22f3f926e251044ed5","observation_id":"5e313310-3923-4831-9430-dce0824c1958","resolution":{"observed_at":"2026-08-16T01:08:50.060475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tpami.2006.152","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T01:08:48.372184Z","title":"and Hero, A","venue":null,"work_id":"8ad60eb6-dd96-4898-b238-85b594686a32","year":2006},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.821013Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:919b2460a8009767399e13286d0cec4c242196e23db261ad57fbf9a16422c54e","observation_id":"8e357164-4fa1-42cf-8a38-2bb1b9ea4ad3","resolution":{"observed_at":"2026-08-16T01:08:48.377467Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:50.033822Z","title":null,"venue":null,"work_id":"7de89a92-109e-444e-abd3-180bf8888430","year":1955},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.883688Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:cd7aeafe89948c37f25598b1be6926e1e9ce9769ef64d079167b631604a2c01b","observation_id":"5a8d7ba9-211b-4c93-8aaa-d957a0a4c527","resolution":{"observed_at":"2026-08-16T01:08:50.040262Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:49.929565Z","title":"An integer projected fixed point method for graph matching and map inference","venue":null,"work_id":"f6f9098b-c561-4c5a-8e05-08041b6b9640","year":2009},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.985078Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:9cf1544be570e51aa018da87a5a018343042afeb0a52407482b3fd2c3cda2a1e","observation_id":"0dbee0b3-3184-45ed-a13c-67ec687c31f9","resolution":{"observed_at":"2026-08-16T01:08:50.021473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:49.909381Z","title":"New binary linear programming formulation to compute the graph edit distance","venue":null,"work_id":"11bb129b-52f5-41f5-afcf-61c28ff5968d","year":2017},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.991865Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:cb4f8ebab94c6445aee873b24362932f9f5d1d607aa42af6a74f381db2c4149b","observation_id":"f210fe48-f55f-47ee-9022-281eb20895a5","resolution":{"observed_at":"2026-08-16T01:08:49.915153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.patcog.2017.07.029","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T01:08:48.318017Z","title":"New binary linear programming formulation to compute the graph edit distance","venue":null,"work_id":"99a837db-29a7-49a4-9f51-96bb64029bcf","year":2017},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.997688Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:ad3342c17cf2d2b4c0b3d4c1a6bd26bd915a0f7bd5ca32fe82272a10aed5c3bc","observation_id":"22edf9d9-9003-4513-b346-24b6a24e5869","resolution":{"observed_at":"2026-08-16T01:08:48.360008Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:49.838646Z","title":"Graph matching networks for learning the similarity of graph structured objects","venue":null,"work_id":"2d6ac90a-0a66-446b-a086-f1297c398ba9","year":2019},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.004922Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:d3b61108e00d0106ed0cb341a03579d319cc11a7e2521ff96fa4d41e8118c95e","observation_id":"3933abbd-86bd-4d69-b886-ef246f99e3eb","resolution":{"observed_at":"2026-08-16T01:08:49.897619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.08663","last_updated":"2020-07-16T21:46:33Z","snapshot_observed_at":"2026-08-13T19:42:12.787378Z","submitted_at":"2020-07-16T21:46:33Z","title":"TUDataset: A collection of benchmark datasets for learning with graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.08663","snapshot_observed_at":"2026-08-16T01:08:48.010624Z","title":"M., Bause, F., Kersting, K., Mutzel, P., and Neumann, M","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.010624Z"},"links":{"cited_paper":"/paper/2007.08663","citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:9a61dad6a07eabb5c8b31db265d01478d995e10607380dfbea2978e80c385508","observation_id":"bede4ec3-3a93-444b-91f7-3232deb66d0e","resolution":{"observed_at":"2026-08-16T01:08:48.010624Z","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-16T01:08:49.718040Z","title":"Computing graph edit distance via neural graph matching","venue":null,"work_id":"e696758e-3def-4741-80a7-435cddbb3c4c","year":2023},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.017671Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:57dbff842554444de70dd5b625671337a006d0cc7c3dac01cc1598f736e37ca9","observation_id":"2fcecaec-1dfd-42a2-90c0-105e49f186fc","resolution":{"observed_at":"2026-08-16T01:08:49.738925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:49.697098Z","title":"Greed: A neural framework for learning graph distance functions","venue":null,"work_id":"f471c66d-e672-475f-94ef-9ac84384a832","year":2022},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.023898Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:dca872620ee3aece568d14a678f632e3a40025190b4afabefc08c3666bbbe51c","observation_id":"ea5ed543-bb13-4117-892e-7b59874769a2","resolution":{"observed_at":"2026-08-16T01:08:49.704660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:49.619408Z","title":"Answering top-k representative queries on graph databases","venue":null,"work_id":"d191b8b6-0ea2-43ca-bf8c-4d24c2d51606","year":2014},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.029587Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:1c8c4800f8a296d1a62ecee789c1226337cd4ffa84edaeee03fa99c3325cf30e","observation_id":"44df63bf-cc0a-4e90-95f4-5ee3eae1ec7f","resolution":{"observed_at":"2026-08-16T01:08:49.683714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:48.034563Z","title":"P., Dupont, E., Ruiz, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.034563Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:c40d33580aa36addcc987d3f718957485f906bc295eb72ec864ba28d7dc2e47e","observation_id":"09f3f0fc-8a65-4a4e-854d-89fd97f59a74","resolution":{"observed_at":"2026-08-16T01:08:48.034563Z","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-16T01:08:48.088669Z","title":"Global alignment of multiple protein interaction networks with application to functional orthology detection","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.088669Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:2528450dd24bfb88668f9c0de55b21d521f962ad24ac1cbf15b1cd8b2b8446a3","observation_id":"91fd5c79-c75c-4fec-b358-0594bdf5ca88","resolution":{"observed_at":"2026-08-16T01:08:48.088669Z","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-16T01:08:49.508432Z","title":"L., Lyon, D., Junge, A., Wyder, S., Huerta-Cepas, J., Simonovic, M., Doncheva, N","venue":null,"work_id":"e7a21e9d-e737-4467-a753-57ac78ec7574","year":2019},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.147722Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:af046990b6c3faada78de015e121cb5698b9f7d96df6e56f00027481111085b8","observation_id":"a94334bf-caab-43a1-b2a0-9ce49f956b7b","resolution":{"observed_at":"2026-08-16T01:08:49.514221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:49.490579Z","title":"Combinatorial learning of graph edit distance via dynamic embedding","venue":null,"work_id":"8d787e66-c830-4c90-84a8-e02c0fb83bd3","year":2021},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.154338Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:0f1206ba47d9410c9d9c243327c8dbfdb36a26350e99eb13a38705f1411eaa64","observation_id":"1693516f-7a90-4918-99e1-8fe56955e9d4","resolution":{"observed_at":"2026-08-16T01:08:49.496511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:49.387658Z","title":null,"venue":null,"work_id":"702b451c-f8b0-40a6-b116-bd18288bb2e4","year":2012},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.161341Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:0689aa3f7c6d1534f955bbf2c9e1b8586a89c5cf9fd2c89bef08c9d1d7ca37a9","observation_id":"9f89e431-31e0-4b30-b551-974b62210a5b","resolution":{"observed_at":"2026-08-16T01:08:49.394738Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:48.167685Z","title":"N., Gomes, J., Geniesse, C., Pappu, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.167685Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:a168a4654912d2c8c5921f6bd0352085fccc5c2c233e32186cc813fc24ca8838","observation_id":"80f45489-9bb1-424e-a856-ba3955998ffc","resolution":{"observed_at":"2026-08-16T01:08:48.167685Z","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-16T01:08:49.234452Z","title":"and Vishwanathan, S","venue":null,"work_id":"0fa19f53-3bc5-4d2e-8c01-cd9364f2de9b","year":2015},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.172794Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:beec8a94346f9338d66aff1b1eb64298d27f24296a2bf5893bf8a2e6c0a3b0f0","observation_id":"8cc840f3-392b-4eb3-b8e5-553ba4c5819c","resolution":{"observed_at":"2026-08-16T01:08:49.363626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:48.254487Z","title":"H2mn: Graph similarity learning with hierarchical hypergraph matching networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.254487Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:b17c39bf15bf3e6ae5fc70f19328215f012ee27c2d2aaa92c4c475a02d54a729","observation_id":"7442895f-1201-45a4-84ce-379b9af3e3f4","resolution":{"observed_at":"2026-08-16T01:08:48.254487Z","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-16T01:08:49.092069Z","title":"and Tan, G","venue":null,"work_id":"42cb969e-0314-4324-9338-5497e1561699","year":2022},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.261346Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:300c31ac4d63846b39c766f68763152c24ea92d675f6b275cc9fc19e199606ae","observation_id":"f36d855e-f529-44f7-8b6f-096a7a8f9516","resolution":{"observed_at":"2026-08-16T01:08:49.144273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T01:08:49.065593Z","title":"W., and et al., J","venue":null,"work_id":"d0986b39-7f13-4d92-8027-50508ae54fd4","year":2019},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:48.267493Z"},"links":{"citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:14fb1b3eae336acb8b7e3cfd902bc5898e7e422bb84b39d78dbcbb7a09df0c4d","observation_id":"9e4a2b81-9674-41aa-b92a-6e07c30609a2","resolution":{"observed_at":"2026-08-16T01:08:49.079548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T00:58:27.785464Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":3,"verified_fuzzy":23},"total_outbound_references":42},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 2 inbound Pith citation observations for arXiv:2505.02124."}