{"as_of":"2026-08-08T06:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c786148cb4fb5c538a298d87ed9ab53d51bb4e9fdb787078b0c7599ce73fe800","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:49:40.066119Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:30:34.962167Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T13:30:37.951829Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"cited_work":{"arxiv_id":"2505.17993","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.17993","snapshot_observed_at":"2026-08-07T13:30:37.951829Z","title":"Finding d-Cuts in Claw-free Graphs","venue":"math.CO","work_id":"47119abb-5986-4b05-ba6f-771e60a67f9f","year":2025},"citing_paper":{"arxiv_id":"2505.22351","last_updated":"2025-05-28T13:32:59Z","snapshot_observed_at":"2026-08-07T13:06:58.374818Z","submitted_at":"2025-05-28T13:32:59Z","title":"Finding $d$-Cuts in Probe $H$-Free Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:34.962167Z"},"links":{"cited_paper":"/paper/2505.17993","citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:f2bc2b6676efbde5f00b4da47bd3813c725d29f0d81f1e75955baffa46196b6a","observation_id":"f237e18b-697a-4380-8e00-a3df0df7ad7d","resolution":{"observed_at":"2026-08-07T13:30:38.037439Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.17993/citation-record","integrity":"/paper/2505.17993/integrity","json":"/paper/2505.17993/citation-record.json","paper":"/paper/2505.17993"},"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-07T14:49:46.116948Z","title":null,"venue":null,"work_id":"425bc336-81a8-42f7-aac2-582593f881bf","year":2022},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:37.781670Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:db69b12b7f225007681f90531aad0ff299c4ceaabbd4833c3360553acd3afc33","observation_id":"c7d16be4-d83e-475c-b6db-d03e937251e0","resolution":{"observed_at":"2026-08-07T14:49:46.248950Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:45.823536Z","title":null,"venue":null,"work_id":"9e2bcb9c-35a2-428b-b95b-e05f1eb0a9d2","year":2021},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:37.833579Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:cffefeec03e829b484b7e38ae89d77b9394a8a91c1e0ad7b0b3152ad2efe02b0","observation_id":"aecf9b02-e62c-44d6-9c37-cfd6c6b80cc6","resolution":{"observed_at":"2026-08-07T14:49:45.952821Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:45.552744Z","title":"Internal partitions of regular graphs","venue":null,"work_id":"50694f3b-e72f-40d3-a435-60b9882e7b40","year":2016},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:37.908171Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:eacbdb8c4b6887d24cc93c95c5311d3ca9ebca42f11b80871efb3fd237e77ea2","observation_id":"ffbe5e0e-d45b-4bdb-943a-64d95e356e72","resolution":{"observed_at":"2026-08-07T14:49:45.700179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:45.321033Z","title":"Cutting B arnette graphs perfectly is hard","venue":null,"work_id":"fe006d26-6362-4f1d-8309-685384f91139","year":2023},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:37.984828Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:40cfc3fd1525fbb398614a357355bef1742789c7403543e35020d6ef82646c67","observation_id":"cfb18af0-ffdb-440b-b78d-bf8fd5a81264","resolution":{"observed_at":"2026-08-07T14:49:45.421309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:45.047422Z","title":null,"venue":null,"work_id":"ce084300-c2ba-4241-8f84-6f0add26eb30","year":2009},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.060462Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:86aeae7b94425ecc843bc3a683351cccfdcf15277de54178024f1b7f5b5ca948","observation_id":"25204af1-f68a-451d-842b-7610dcf803e9","resolution":{"observed_at":"2026-08-07T14:49:45.193123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:44.841580Z","title":"The complexity of the P erfect M atching- C ut problem","venue":null,"work_id":"cc2589db-28c3-4002-b4c4-e35051c8ee76","year":2025},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.125207Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:e653b3012b2663523d715891a6485f53b8ebac903f09809e3b798542a2ef4b26","observation_id":"ab7b323d-02b6-4caf-9090-bec84adb8819","resolution":{"observed_at":"2026-08-07T14:49:44.933526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:43.993479Z","title":"Matching C ut in graphs with large minimum degree","venue":null,"work_id":"f02f1520-018f-42a0-9e8d-1aeb22b0198a","year":2021},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.190695Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:046ddd44cd63239707532bfae0625a17d931e70403532a18880096dade2ca1ea","observation_id":"35341025-366e-4793-bfff-1be0f063e432","resolution":{"observed_at":"2026-08-07T14:49:44.672477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:43.687562Z","title":"Recognizing decomposable graphs","venue":null,"work_id":"49018e7b-d8a0-4ca1-85ed-bb3639c011a2","year":1984},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.246387Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:307949e5b2da4b5e6d7767b4fcb7a9f15ec8a9013e76208c7c2efea052242d47","observation_id":"2aba5cb9-f036-47fd-bc5d-7de5e6e2c9c8","resolution":{"observed_at":"2026-08-07T14:49:43.818492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.07769","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:49:40.746656Z","title":"A forbidden subgraph study for cut problems on graphs permitting loops and multiedges","venue":null,"work_id":"602d47a7-761d-4f44-bcd5-054573ae94c0","year":2025},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.301769Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:795eb3d0d9ea52509d22df9a99baf7cbf45017a67932377d1e79f9feb0a524b5","observation_id":"ad30ed50-d384-44e6-ad86-c09617048102","resolution":{"observed_at":"2026-08-07T14:49:40.886509Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:43.449462Z","title":"Matching cuts in graphs of high girth and H -free graphs","venue":null,"work_id":"4edc0951-a952-413a-a06c-71f4f7588dd0","year":2023},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.380087Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:24e1068035d74e98322ece6ab56c0f114245b1390de6dc3ed6ea6aa6aee589c0","observation_id":"93152327-1c0f-4041-9fe5-8fc32b5ff9f9","resolution":{"observed_at":"2026-08-07T14:49:43.568569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:43.151168Z","title":"Golovach, Christian Komusiewicz, Dieter Kratsch, and Van Bang Le","venue":null,"work_id":"50ec0b32-d14d-446a-bb54-30000eb85439","year":2022},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.451448Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:fd671800f234bfe339ea61c7812c8d698347f545de76f70fe03d117bb627b365","observation_id":"4fba6d8a-da39-4016-b3af-4e5a9cd82775","resolution":{"observed_at":"2026-08-07T14:49:43.295638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:42.957638Z","title":"Finding cuts of bounded degree: complexity, F P T and exact algorithms, and kernelization","venue":null,"work_id":"92a6ea39-74ce-4d18-a86d-73d009731755","year":2021},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.549863Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:45f7682fbf24f0bab6e0c41a2bd3ac91cc0f6546d216470b1fb0f061dc2fcc39","observation_id":"e38fb892-c1ed-4d78-bacc-0d5a2c6ea07e","resolution":{"observed_at":"2026-08-07T14:49:43.052776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:42.780943Z","title":null,"venue":null,"work_id":"b56a0cf2-f441-4e54-9ae8-d4a63f5e64f1","year":2024},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.656018Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:20750ae71121803d85ffa1f9d586733aa2242930b43a383c7970b608cccab193","observation_id":"d960aee7-da43-455b-83ca-7abbbbc5ef92","resolution":{"observed_at":"2026-08-07T14:49:42.869450Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:42.632868Z","title":"Partitioning graphs into generalized dominating sets","venue":null,"work_id":"642d8761-b006-4649-a492-2a825e688c99","year":1998},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.726279Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:f62a6fa718cdab55b0bb5b6620933f823f5dd73f1c4b35ea57f28b9a3a364711","observation_id":"0231ac2d-3dad-4ed8-aec1-d7b9477e4d12","resolution":{"observed_at":"2026-08-07T14:49:42.701692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:42.484615Z","title":"Matching C ut: Kernelization, single-exponential time FPT , and exact exponential algorithms","venue":null,"work_id":"abeef4b5-7385-46eb-87b3-416bd21cb393","year":2020},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.853132Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:2f4bb1e320cbb4647fdb7d5eca6d98956940a1fa51d8cf3a2acc9e3e84997d69","observation_id":"e460c046-79ee-4cea-ae3f-0d788ea87fc3","resolution":{"observed_at":"2026-08-07T14:49:42.567641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:42.298995Z","title":"Algorithms solving the M atching C ut problem","venue":null,"work_id":"83d14836-716e-4bb3-a516-4719043e731b","year":2016},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:38.987945Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:edb7108b20f4cc9606e88d96f1abed5e5a0c5e7ee6c8ce09386b091d3275437f","observation_id":"73c9779b-90b2-4755-b410-d67135cd6d20","resolution":{"observed_at":"2026-08-07T14:49:42.389839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:42.189085Z","title":"Complexity results for matching cut problems in graphs without long induced paths","venue":null,"work_id":"1d1c19b0-9810-4dc1-afad-ba95c0469f2f","year":2023},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:39.118718Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:23018206121ca7c24a777cdfdcef198335a4da40ef13ed56a7b14384ad4a829e","observation_id":"92ca1991-64fc-410d-b9ea-a9996d81172a","resolution":{"observed_at":"2026-08-07T14:49:42.230327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:41.941059Z","title":"The P erfect M atching C ut problem revisited","venue":null,"work_id":"c8600fb2-a0f7-4b39-a380-30bb3078077f","year":2022},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:39.267376Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:53a424901ec7f7cf15a487286e6644aa082aec2d0fc0b978cfdcded219b1ef0b","observation_id":"4720f32d-7d48-4d61-957f-24a5ddb58605","resolution":{"observed_at":"2026-08-07T14:49:42.058509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:39.431825Z","title":"Finding minimum matching cuts in H -free graphs and graphs of bounded radius and diameter","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:39.431825Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:87fca521ffbb011251f88c514cab6a329ca87e271d1e1ff2302e528a2b6f891a","observation_id":"05d27cc2-41de-43f5-9391-9e1ec705dec3","resolution":{"observed_at":"2026-08-07T14:49:39.431825Z","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":"2404.11389","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:49:40.361764Z","title":"Finding d -cuts in graphs of bounded diameter, graphs of bounded radius and H -free graphs","venue":null,"work_id":"ffc85d8f-b4bf-482e-9125-d140095cd841","year":2024},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:39.498549Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:2f9e268da82b136887703a8d4cad443183c5dd1f5830d5c20475981d0576fab8","observation_id":"1cb17970-d220-461e-8037-3e6591dddc14","resolution":{"observed_at":"2026-08-07T14:49:40.474419Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:41.699235Z","title":"On the complexity of M atching C ut for graphs of bounded radius and H -free graphs","venue":null,"work_id":"e2c3b000-0744-4b83-b5ad-83b6bc1f1f34","year":2022},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:39.598377Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:c379772a6a176deba7bb3ae28225c6b5a9f02fd96d46e858c96a29e7351ce844","observation_id":"c429903a-c922-4ece-8c55-33b74d692447","resolution":{"observed_at":"2026-08-07T14:49:41.801547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:41.594218Z","title":"Finding matching cuts in H -free graphs","venue":null,"work_id":"2fbafb63-646f-4585-8005-4338f6b52dfa","year":2023},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:39.688330Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:032ed1477a9c06f5cb5316919054c4424cef0bcf9d892b74964c1013fd41b0c1","observation_id":"79393ffe-27d5-4a15-b124-a331d2104356","resolution":{"observed_at":"2026-08-07T14:49:41.630342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:41.466443Z","title":"Dichotomies for maximum matching cut: H -freeness, bounded diameter, bounded radius","venue":null,"work_id":"c0e69520-aebd-44db-b857-fd8ff630a662","year":2024},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:39.812409Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:6ba111b7149970c1413c0e8deb6179b0840b9f33ab6548462a70b4e3f944ced2","observation_id":"fea0b27a-bda3-4e30-8521-13f6aebba40f","resolution":{"observed_at":"2026-08-07T14:49:41.530553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:49:41.307548Z","title":null,"venue":null,"work_id":"d51a8fbe-bd5d-471c-bb0b-bd1d3ec22886","year":1989},"citing_paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:40.066119Z"},"links":{"citing_paper":"/paper/2505.17993"},"observation_digest":"sha256:4787abf264a8e78d98f4b905afe2216cc08801321b2dbb5a879976a0ad184473","observation_id":"f8bc0056-a18e-49bd-83c3-1865662691cb","resolution":{"observed_at":"2026-08-07T14:49:41.358632Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.17993","last_updated":"2025-05-23T14:58:42Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T18:59:07.035178Z","submitted_at":"2025-05-23T14:58:42Z","title":"Finding d-Cuts in Claw-free Graphs"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":2,"verified_fuzzy":16},"total_outbound_references":24},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 1 inbound Pith citation observation for arXiv:2505.17993."}