{"as_of":"2026-08-14T18:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0dd215f67c5c73d8bae24c74e15247e90fdc30c86398eb81f0d6eac2d88a3d1d","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T01:42:21.631764Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2604.24325/citation-record","integrity":"/paper/2604.24325/integrity","json":"/paper/2604.24325/citation-record.json","paper":"/paper/2604.24325"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0196-6774(91)90006-k","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Easy problems for tree-decomposable graphs","venue":"Journal of Algorithms","work_id":"ee29c3f2-e74d-4fad-be21-ea7c559ba693","year":1991},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:eb4de4d768c4b4be307d113d574ffbd3dce1b78d00e8adc5f8381f2ed295e788","observation_id":"92a02044-bc7b-4052-99e0-4070a29c4a21","resolution":{"observed_at":"2026-05-09T01:19:31.353632Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"The complexity of surjective homomorphism problems - a survey.Discrete Applied Mathematics, 160:1680–1690","venue":null,"work_id":"46a6f656-e9f8-4df0-9b96-4552d8455474","year":2012},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:180af6d28629fafe8815b9181bf41b0764605e369b75fbe3222376ca4b11c808","observation_id":"078ad853-fed5-4217-bb8d-0536ca12ac86","resolution":{"observed_at":"2026-05-27T00:08:28.328013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Brouwer and Henk Jan Veldman","venue":null,"work_id":"9144e860-aad4-4fd6-aa7f-413ffde18b66","year":1987},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:a76ad76824e6a658ed66ae14f971bcf45f9b107a2e19718e3c3beb1be3c4eeab","observation_id":"e7dced54-6c7d-41d9-a1a9-1b28df9d8c4a","resolution":{"observed_at":"2026-05-27T00:08:28.332884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11821069","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Improvedparameterizedupperboundsforvertexcover","venue":null,"work_id":"ac91bf24-f56a-43f5-862a-c6524677dd01","year":2006},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:dc0b5369d7dae50b6bee7cac2439db0ae19825673da53fb67af93c93b7427a4c","observation_id":"bbfbad41-9f8c-46dc-bd90-23810253dd24","resolution":{"observed_at":"2026-05-09T01:19:31.348351Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0890-5401(90)90043-h","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T23:39:02.514566Z","title":"The monadic second-order logic of graphs","venue":"Information and Computation","work_id":"69e8ab4c-158e-499e-8f23-ebc09d518761","year":1990},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:d23e7bd46b3a981ea24d9a197392d692a65877f6fe584f72b7c92f696d80eacf","observation_id":"5aab3e8f-639a-43d9-8820-d84cd42c591f","resolution":{"observed_at":"2026-05-09T01:19:31.337789Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms","venue":null,"work_id":"d2735efe-d1f5-4fc2-8ccf-63d03d0b9c06","year":2015},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:e70956d613cc17321818de01883429dae0ee31fcb84c9d4d4209e98d2559336d","observation_id":"77ce5868-f4b8-443a-a5c8-e4a4852efda3","resolution":{"observed_at":"2026-05-27T00:08:28.330728Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ipl.2013.01.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Information Processing Letters","work_id":"89f45f58-6d04-42c6-b750-ffdef38c9854","year":2013},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:d637d4cbe45c224d69beaa459e22c9388d902f6a90023b19408b6f7fe26397b4","observation_id":"42f6838b-abe0-47dd-8b5f-4037305900ab","resolution":{"observed_at":"2026-05-09T01:19:31.323222Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"On rigid circuit graphs.Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 25:71–76","venue":null,"work_id":"cec7066a-b7ad-4f89-8c99-377c089a923f","year":1961},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:cd5077f981cc30e1998a00c10297b1787867f05d772aba2b4acedc6fc5c3e2de","observation_id":"71bdaa1b-35e4-4587-9754-f874dd07fd65","resolution":{"observed_at":"2026-05-27T00:08:28.320602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Incompressibility through colors and ids","venue":null,"work_id":"c4276196-00d2-4d26-884c-d2a080944cf0","year":2009},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:c06d1f69f2784025b11487066224f8b0c9daa2a9e1a0013110e1379b87c78282","observation_id":"fd9ab109-b5ab-4242-bb79-536332a5fd27","resolution":{"observed_at":"2026-05-27T00:08:28.310403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Downey and Michael R","venue":null,"work_id":"62ab0667-4783-4bf6-bb52-ae3c9ad49fa9","year":1995},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:7ee2af11d5b0d3c281d318e426b356262a5d31864d0928b659cf0f803a562402","observation_id":"9445d7f5-bf8e-4c6a-88ef-e02e37dc0f36","resolution":{"observed_at":"2026-05-27T00:08:28.288989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4471-5559-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T17:29:38.305504Z","title":"8 David Eppstein","venue":"Texts in Computer Science","work_id":"5d1c0ef8-d7a6-4a4e-8704-1521531a9f7e","year":2013},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:0461a3de9d901b4d32cbd81ed1d77822c52b918d97b5902549044b71c601aa83","observation_id":"eccea34b-862f-410f-aceb-acf2442f298f","resolution":{"observed_at":"2026-05-09T01:19:31.277348Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-02T18:08:14.199159+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-02T18:08:14.199159+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2c0eb96e-6346-4e0b-9c39-e68bf943f90d","year":1979},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:2fd8f6579fce194d6238914c2a96f65a333272c017e040f2d7aca0fd67af0c16","observation_id":"6882558d-8719-4540-9c2b-4f87d2cc6966","resolution":{"observed_at":"2026-05-27T00:08:28.315005Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Golovach, Daniël Paulusma, and Iain A","venue":null,"work_id":"686b2553-f50c-4ed5-8d58-521b31d3cc49","year":2017},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:ebce55b3e0962e12f53a6a3d3fbc43bcb35d0680272ad91a969375797a7e99b6","observation_id":"0c78ffcf-1e8b-42b3-8ba4-7c14d2643aac","resolution":{"observed_at":"2026-05-27T00:08:28.325477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Golovach, Pim van ’t Hof, and Daniël Paulusma","venue":null,"work_id":"5690417a-ace8-4283-b8fa-2980ca153a2c","year":2013},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:3d22d34d0e7f2a035de296fa5cbd2eca1da5a58c4b1dde635bc4bef7719ef140","observation_id":"51d28bfd-9c6b-4482-a8bd-3bbc41a896e8","resolution":{"observed_at":"2026-05-27T00:08:28.300350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.01882","last_updated":"2026-06-28T18:37:03Z","snapshot_observed_at":"2026-08-14T16:46:41.713438Z","submitted_at":"2026-02-02T09:54:21Z","title":"The price of homogeneity is polynomial","version":3},"cited_work":{"arxiv_id":"2602.01882","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.01882","snapshot_observed_at":"2026-06-30T02:16:14.002104Z","title":"The price of homogeneity is polynomial","venue":null,"work_id":"a51eddd4-7ccf-4ce9-99d2-2b438fbfdc68","year":2026},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"cited_paper":"/paper/2602.01882","citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:e2aaa79c8571c3ee7ed331aecdca65467cbd6d5ec7d295cc1d648d575c866e1f","observation_id":"924d4d01-da4a-4034-8f03-ed189ec537f0","resolution":{"observed_at":"2026-06-30T02:16:14.002104Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"A faster FPT algorithm for bipartite contraction.Information Processing Letters, 113:906–912","venue":null,"work_id":"549d3c6c-c0cd-4420-beca-34c852118f8d","year":2013},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:d5dda892b16b776ace897520f83fa7064f4197686e2d028fcc78ac48f4888ee9","observation_id":"bb0e34aa-817d-4a6d-9f1a-767ff0e340bf","resolution":{"observed_at":"2026-05-27T00:08:28.302830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Con- tracting graphs to paths and trees.Algorithmica, 68:109–132","venue":null,"work_id":"e3e7c9e2-4a98-4eca-a3d2-b884c372e269","year":2014},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:8522a8f4b92d0b97a236cfbafd4d649dae95f4d3cd9889ab5bd3443aaf9e42bd","observation_id":"c217132f-2eb2-4be3-a3ed-6126fa3d0519","resolution":{"observed_at":"2026-05-27T00:08:28.312874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Obtaining a bipartite graph by contracting few edges.SIAM Journal Discrete Mathematics, 27:2143–2156","venue":null,"work_id":"cda3f03c-bab1-48cb-9c95-724cfa804385","year":2013},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:8738ea03a82ada91342d5a6a3490e1f64c8a71ffa4a94f689684cdc1dece66af","observation_id":"2342531b-2848-4512-b749-d1ef1219c196","resolution":{"observed_at":"2026-05-27T00:08:28.307696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2012.04","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bin packing with fixed number of bins revisited.J","venue":null,"work_id":"97c4e49e-13ad-4afe-9afe-9342a06c4fec","year":2013},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:4e27d0045e2fd2026e38a1ea47d8cf4c97fb73435f8f7cb5fd862b43a33e37f0","observation_id":"e641e608-f7d5-412b-b20a-5098bf6b83e5","resolution":{"observed_at":"2026-05-09T01:19:31.330072Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs61266.2024.00078","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Improved Distance (Sensitivity) Oracles with Subquadratic Space","venue":null,"work_id":"7feff75a-a0ce-4a6b-a569-db67b0bbcdc0","year":2024},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:05055987854c9ae15f5772d37b9e3e942e4b96a6fdc5e6884902dfaf9d50e489","observation_id":"34ad8ebb-160f-495f-9482-7a89d28100f7","resolution":{"observed_at":"2026-05-09T01:19:31.248003Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Woeginger","venue":null,"work_id":"03b41ed0-5b1b-4929-b1c6-b0157ab76d03","year":2008},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:7fc5050b488f7ead6dda7e841023d2dbdd1c720057b61a66fe0c4d5f6acf8670","observation_id":"6dc39ce5-8a82-465d-acd7-84bec8e186a9","resolution":{"observed_at":"2026-05-27T00:08:28.297709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Woeginger","venue":null,"work_id":"a8f1cd3c-6f4b-4682-9f41-d9f51995a837","year":2008},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:c17e2f42ea278d71fefbf8cd224cee79a5f9de4bbfbdce2b7c67139b720dc6b9","observation_id":"40042130-f896-4222-a8c4-04326e711391","resolution":{"observed_at":"2026-05-27T00:08:28.317749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2025.7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thilikos","venue":"ArXiv.org","work_id":"272e945c-f705-4666-bf8f-9a484bad67f2","year":2025},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:d12b4e7c721acfa593f9a469159338a2db1e80f4d30a09e416e37401bd4d5123","observation_id":"54a4c3c2-8771-42f8-9eb1-00e095386383","resolution":{"observed_at":"2026-05-09T01:19:31.318776Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.disc.2025.114699","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thilikos","venue":"Discrete Mathematics","work_id":"63024125-c30c-4e51-bb03-ef047812575f","year":2026},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:fe62b2bdc1bc2f05e00bd9e6cbe445376c553186348a8132f64ef155d89c453c","observation_id":"b6e3e269-af82-4855-a530-26b974a2c947","resolution":{"observed_at":"2026-05-09T01:19:31.254023Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3d860202-d60a-4460-b696-09502ce8a33a","year":1995},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:63b24dbf26511b29fbde97ad3d22719271acb1f896e9d720342829d14f073c3f","observation_id":"00921780-8cb4-4bf7-9abe-a8e819cbc504","resolution":{"observed_at":"2026-05-27T00:08:28.334938Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2004.08.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Combinatorial Theory, Series B , volume =","venue":"Journal of Combinatorial Theory Series B","work_id":"09bc0356-b092-430f-baf7-b23b7a05927a","year":2004},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:2f1e0d84ecc0243062686de46c2b45a68a29392e910ea61284fe5508b8d1e41e","observation_id":"a895a3e1-2111-43c7-8053-85d8337838ae","resolution":{"observed_at":"2026-05-09T01:19:31.258970Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-20T18:52:00.097693+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T18:52:00.097693+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Thilikos","venue":null,"work_id":"11c3fa50-e6db-42a8-976f-a88dd9dc229a","year":2012},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:8709252ad73ccf0a42d8997b414713fbb29fa34ed04eb810de2d0e8c9740ddbc","observation_id":"68eb7508-ea39-4cee-8e8f-53ad20f4ab11","resolution":{"observed_at":"2026-05-27T00:08:28.305000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Computational complexity of compaction to reflexive cycles.SIAM Journal on Computing, 32(1):253–280","venue":null,"work_id":"321c6246-755e-4f88-928c-2a8fa97b2f89","year":2002},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:b2493d90d2dcb0ca958a0c81aef1067b4c038e97423c0995c8ca1b07853f17ad","observation_id":"1c3c8798-8581-4782-a8c4-2a7e3fe90e90","resolution":{"observed_at":"2026-05-27T00:08:28.295149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Compaction, retraction, and constraint satisfaction.SIAM Journal on Computing, 33(4):761–782","venue":null,"work_id":"9f549c43-f589-41b4-bcc2-45bd3bc50cd2","year":2004},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:bc8e47542842e07ad0bd14b3b19e1e753f3db98b5ff221af066aef39fd821da3","observation_id":"02aeecee-9508-4b75-b23d-da73ac7d5f5b","resolution":{"observed_at":"2026-05-27T00:08:28.292588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-05T21:23:00.469572Z","title":"Algorithms for partition of some class of graphs under compaction and vertex-compaction","venue":null,"work_id":"271b53df-f5f9-4f1f-bfe0-55e672361933","year":2013},"citing_paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-08T01:42:21.631764Z"},"links":{"citing_paper":"/paper/2604.24325"},"observation_digest":"sha256:6992cc9d27e186864284262e6a45cb7a44e5142ce77540be0475107375c49a02","observation_id":"284ef41a-4b5a-42c4-ab65-83915fe1a8f4","resolution":{"observed_at":"2026-05-27T00:08:28.323151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.24325","last_updated":"2026-04-27T11:17:47Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T17:34:55.639495Z","submitted_at":"2026-04-27T11:17:47Z","title":"Identification to Subclasses of Chordal Graphs"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":2,"verified_exact":9,"verified_fuzzy":16},"total_outbound_references":30},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2604.24325."}