{"as_of":"2026-08-19T06:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8cbe6192b2c4f06b1601910a334bba7fab1db162469c42dd27bcbbebfaf3f0de","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:47:34.990005Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2608.04583/citation-record","integrity":"/paper/2608.04583/integrity","json":"/paper/2608.04583/citation-record.json","paper":"/paper/2608.04583"},"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-06T21:47:37.819818Z","title":"A graph database repository and performance evaluation metrics for graph edit distance","venue":null,"work_id":"4e2e694b-2b1d-46ed-959d-185cb2e92715","year":2015},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:33.367384Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:e7794dbfb0dab1612243954adf7cc16fcbd7039bf58e09e521bf29cb5676c744","observation_id":"00e85cd1-4a5b-4f92-bea1-d8090b7b2423","resolution":{"observed_at":"2026-08-06T21:47:37.916246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5220/0005209202710278","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"3 TatsuyaAkutsu, TakeyukiTamura, DaijiFukagawa, andAtsuhiroTakasu","venue":null,"work_id":"516dd714-6ea2-4128-8719-585179938701","year":null},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:33.645288Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:b65a78bbda1cbbafad32d919d554f6fd97e89895eee1ba7fb62fef1f12d6836c","observation_id":"e48489d5-1838-4247-bf19-4c9fac35890d","resolution":{"observed_at":"2026-08-06T21:47:35.706497Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T21:47:34.437061Z","title":"16 Marek Cygan, Fedor V","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.437061Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:b5a86da12752850abe59956b75e222012974a92ab23606c50c1693a08b9ed8fe","observation_id":"3fda124f-c57c-456c-9a09-b378862a726c","resolution":{"observed_at":"2026-08-06T21:47:34.437061Z","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-06T21:47:34.632682Z","title":"29 Seyed Mehdi Lajevardi, Arathi Arakala, Stephen A","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.632682Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:054df6ac2434ae2e51a895d2d8c387f0e1030aaadc86978022ec655ddd0aeaf4","observation_id":"4795a444-545c-4252-a29c-d1718b5a9c98","resolution":{"observed_at":"2026-08-06T21:47:34.632682Z","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-06T21:47:37.022696Z","title":"edges (m), and the maximum treewidth of any graph inG","venue":null,"work_id":"d3654213-af99-4aeb-9808-f912f731aaaf","year":2000},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.990005Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:1bbba39194548febc3cbd75d0ded712028660495ac96b2b9827e829b770f36bd","observation_id":"daf67c6d-ee7a-4bb1-994f-b06158a5084d","resolution":{"observed_at":"2026-08-06T21:47:37.156179Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T21:47:34.564675Z","title":"24 Rashid Ibragimov, Maximilian Malek, Jiong Guo, and Jan Baumbach","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":1962,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.564675Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:1ec70460ddfc93b78e3783a985de349dfe9d53f26a22631936452cc975bc3e8d","observation_id":"8c787d97-b66b-43c0-851a-99c46375cea1","resolution":{"observed_at":"2026-08-06T21:47:34.564675Z","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-06T21:47:37.276394Z","title":"5 Afrouz Jabal Ameli, Jesper Nederlof, and Shengzhe Wang","venue":null,"work_id":"70eb53ca-ccd6-4c37-9230-13b9b93574e6","year":1990},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:33.865043Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:afb4c7806152d9c4fcb92d5e69a1ac5df17bcedd08bc940bf65166f0929591d3","observation_id":"871019da-0c3d-4df2-9a43-31107c4c3988","resolution":{"observed_at":"2026-08-06T21:47:37.415979Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T21:47:34.701120Z","title":"33 Richard J","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.701120Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:ca28eebf1b742e5f4cbc7d724db17d5fdc8275aa79f7bb1bcb398982b21c2773","observation_id":"c8f3355a-49b4-4c73-b575-7739d0151549","resolution":{"observed_at":"2026-08-06T21:47:34.701120Z","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":"1983.63131","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:47:36.187619Z","title":"36 Neil Robertson and P.D Seymour","venue":null,"work_id":"9d181356-d66c-4a36-9925-be67f49b65b3","year":1986},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.801066Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:7b387e48b4b963beb5b719df5c575a069168fc20796651e8e88df8d94e711251","observation_id":"b845a8e8-fbb3-49f9-93f1-1a9b689025d5","resolution":{"observed_at":"2026-08-06T21:47:36.254288Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-89689-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Springer, 2008.doi: 10.1007/978-3-540-89689-0\\_33","venue":"Lecture notes in computer science","work_id":"b954bc0e-51db-469c-8cd7-38dd55b1a750","year":2008},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.766319Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:a5d3a03d186ee5c131697d01e01c3e04c92b1096fd851da3f21b2aa443ec5142","observation_id":"e3b736cd-103f-4e4f-9faf-6d7822562dda","resolution":{"observed_at":"2026-08-06T21:47:35.158708Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T21:47:34.372707Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.372707Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:9698b15ea4d52b39b1fec08d266695749fe0a3feeac67ecc3695e618ea573cda","observation_id":"9e6d0d2e-9c62-4ec3-865f-5303617a7f20","resolution":{"observed_at":"2026-08-06T21:47:34.372707Z","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-06T21:47:37.542951Z","title":"4 Noga Alon, Paul Seymour, and Robin Thomas","venue":null,"work_id":"fb2b4098-7bc4-4fdd-94a6-d2a39b17ffb6","year":2013},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:33.763042Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:8162f77e304a94b10b2aadb7322e226f2b9470e3c06266ac48f4bf47b3e76247","observation_id":"fcd0cc5f-a523-4eb8-ab88-5223fe98a874","resolution":{"observed_at":"2026-08-06T21:47:37.641288Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-18224-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Springer, 2015.doi:10.1007/978-3-319-18224-7\\_14","venue":"Lecture notes in computer science","work_id":"7529dd9a-b970-435a-914a-8eb1c3a184d3","year":2015},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:33.482501Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:26b6162ee8b0625cf3d683e314de030cc05bd4cd14b69bfa43e22c1c37586402","observation_id":"d809c8ad-2a85-458b-838c-1e08ebecda2b","resolution":{"observed_at":"2026-08-06T21:47:35.870459Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7627.16876","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:47:36.018534Z","title":"39 Hisao Tamaki","venue":null,"work_id":"5e510594-04de-457e-bc05-10654805a04e","year":2019},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.891358Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:9cf6285c47298df037eebd2edbd6b2d262ae8b55aeb77be502f54ea5a18fd8f1","observation_id":"608f282b-9da5-45fc-b15a-e5bb81fc85ca","resolution":{"observed_at":"2026-08-06T21:47:36.061518Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"1908.00265","doi":"10.48550/arxiv.1908.00265","metadata_source":"pith","pith_arxiv_id":"1908.00265","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"New Techniques for Graph Edit Distance Computation","venue":"cs.DS","work_id":"6ae6012d-552c-44a0-88ab-eed1c053c6e8","year":2019},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.116116Z"},"links":{"cited_paper":"/paper/1908.00265","citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:99b212f927b2396d6968255fc2105d984e3497ce3460525006d2af3838506dad","observation_id":"35152067-609e-4495-a2db-3ea50faa69f6","resolution":{"observed_at":"2026-08-06T21:47:35.548099Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.patrec.2018.05.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"10 Martial Bourquin, Andy King, and Edward Robbins","venue":"Pattern Recognition Letters","work_id":"5e605e12-886e-49f7-9146-6a5d6258e920","year":2018},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.290593Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:78a2a6f7a0446491805b53f9265b1a5611ee8007c3969c491fa17bb40365b68f","observation_id":"d9672f77-2f14-4ca1-9314-d3414e6d126b","resolution":{"observed_at":"2026-08-06T21:47:35.359736Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2016.74982","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:47:36.469059Z","title":"19 Carlos Garcia-Hernandez, Alberto Fernández, and Francesc Serratosa","venue":null,"work_id":"b84c1c0f-c4f5-43ed-8eea-a8b1bf10fd17","year":null},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.502554Z"},"links":{"citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:656c9730a10653c0cc29ca5caceda386bc7c9c16b1de7dacd49b8fe7227e704c","observation_id":"0dcc278c-964b-4135-92d0-9d47dde2f80d","resolution":{"observed_at":"2026-08-06T21:47:36.535788Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.05661","last_updated":"2026-07-10T16:46:39Z","snapshot_observed_at":"2026-08-16T08:21:39.156254Z","submitted_at":"2026-04-07T10:03:55Z","title":"Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics","version":2},"cited_work":{"arxiv_id":"2604.05661","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.05661","snapshot_observed_at":"2026-08-06T21:47:36.767058Z","title":"Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics","venue":"cs.DS","work_id":"2cedd8c0-ca06-43bb-a7b5-8b36024a1218","year":2026},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:33.994397Z"},"links":{"cited_paper":"/paper/2604.05661","citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:a52050c38ada3d137abc1022505277b5e52df77fa0eaf6e26ace81d26ebad1af","observation_id":"1e81e39d-0799-44f5-8c90-da8363ff9902","resolution":{"observed_at":"2026-08-06T21:47:36.829700Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":3,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":5,"verified_exact":6,"verified_fuzzy":1},"total_outbound_references":18},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2608.04583."}