{"as_of":"2026-08-07T23:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbe4d6e89995743d070fb2fb0a2fb88b65d400fe9d98b5a095801747c4acc55b","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:30:37.736669Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2505.22351/citation-record","integrity":"/paper/2505.22351/integrity","json":"/paper/2505.22351/citation-record.json","paper":"/paper/2505.22351"},"outbound":[{"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:f5316bd91c285b3b038c9bbcc0922697465eb0d639340d6af44b40f0d06bbba6","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:43.845286Z","title":"Dis- crete Applied Mathematics 160, 2502–2513 (2012)","venue":null,"work_id":"6bf44c25-be8b-4d1e-acda-6fe30f921450","year":2012},"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":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.079596Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:df67324b3467e3869b99edbae4cedb4e507a621b93b2a87e07120990a52c2dfc","observation_id":"867cc4fc-9a50-4fb3-9153-ca30e69380c9","resolution":{"observed_at":"2026-08-07T13:30:43.943784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:43.562259Z","title":"SIAM Journal on Discrete Mathem atics 21, 573–591 (2007)","venue":null,"work_id":"f105dd2c-52a8-4c6f-80e5-adf73a58c095","year":2007},"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":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.141108Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:38db99e10d0a5efaefd27ea8191536767fa723dbea442fc0600de511b71ee182","observation_id":"012040d5-b011-4201-a75b-44e4d4ab22d6","resolution":{"observed_at":"2026-08-07T13:30:43.716030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:43.339772Z","title":null,"venue":null,"work_id":"c4333f9b-40db-4b9f-ad67-35e62e1eb3ee","year":2023},"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":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.234991Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:5dd610c4c7ac0e60d1f02fb8066b319b640a09d0e48bc0a58d15375ddcec26e0","observation_id":"df521678-4bf4-4a39-b911-8bc1f909f654","resolution":{"observed_at":"2026-08-07T13:30:43.433297Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:43.069949Z","title":"Journal of Graph Theory 62, 109–126 (2009)","venue":null,"work_id":"2522e57f-8eb2-4bc9-baed-75cffb743b99","year":2009},"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":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.329849Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:a74a8ad83e48d766dddd577b6091b50de588542752449538b0ed258a4c5374a2","observation_id":"4e8a901a-d599-457d-9c7e-d21315110f87","resolution":{"observed_at":"2026-08-07T13:30:43.198116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:42.842844Z","title":"Theo retical Computer Sci- ence 1032, 115088 (2025), conference version in Proc","venue":null,"work_id":"bee2da9e-ad27-4ae6-84b5-820ae432b67f","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":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.468435Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:59adfbd1a86a4a2832e4d1aeb957230e16d6dc4f6c0b7df66179cdbf2409ac00","observation_id":"74caa355-5dc5-4b2d-a6b9-205099e11085","resolution":{"observed_at":"2026-08-07T13:30:42.960780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:42.635930Z","title":"Discrete Applied Mathematics 157, 2611–2619 (2009)","venue":null,"work_id":"ee90c03d-946e-4867-a492-981fc84aca25","year":2009},"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":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.583971Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:b891b5cd43bf38eb49ffa4dd1b2f111d41cd243fbd33d74f20177c11231677ec","observation_id":"8c39870a-aec8-4daa-b050-b9f76879c12b","resolution":{"observed_at":"2026-08-07T13:30:42.735612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:42.404562Z","title":null,"venue":null,"work_id":"ce59ec3f-0c6f-463b-a69c-77634345c506","year":2005},"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":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.675514Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:f9fbab00c199f7fbdc5bf938b08cfd30ddf857d97dcab31d1b4ba083b2664a58","observation_id":"544369c5-81e1-4134-ae3e-e23c3b0c839d","resolution":{"observed_at":"2026-08-07T13:30:42.535980Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:42.156956Z","title":"Journal o f Graph Theory 8, 51–53 (1984)","venue":null,"work_id":"73b636f6-c87f-4fcd-b19d-1f37bf97b531","year":1984},"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":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.718956Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:97b6120adfba5507faffbe4efaeb47e2b55a1e101766ce18380506b94bd3b6de","observation_id":"9f606f4f-30f5-4c95-bc3c-cc7da008e8ff","resolution":{"observed_at":"2026-08-07T13:30:42.273766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:41.930744Z","title":"Theory of Computing Systems 33, 125– 150 (2000)","venue":null,"work_id":"c8bb8326-de85-4484-8b71-e218edc614af","year":2000},"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":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.776348Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:53893f7358ec2eed9425a2f74a1dfe4a44cb91fb443b907fb0ec9aa925fc0552","observation_id":"ad0a320e-d603-49cf-8601-42090f914fd7","resolution":{"observed_at":"2026-08-07T13:30:42.053995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:41.689754Z","title":"Discrete Applied Mathematics 292, 45–58 (2021)","venue":null,"work_id":"11909231-9649-4366-9fbb-8fbe1ecb1ed9","year":2021},"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":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.888036Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:42b2c3fd0e8911759a012d9c8c27042e9360ba8b1597da75191c5eaec9e4ffd2","observation_id":"68d2cef5-3801-4705-aa52-e1a95d95d27b","resolution":{"observed_at":"2026-08-07T13:30:41.801396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:41.423702Z","title":"Net- works 12, 393–403 (1982)","venue":null,"work_id":"46be5636-0c58-4ff7-86ba-d906cf5c2822","year":1982},"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":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:35.965811Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:806c018a7bf1fa027085d994058f26b1df5daa0c40d446fc422e469557b82a05","observation_id":"c1423e58-b767-4614-ba01-2b9b349135b9","resolution":{"observed_at":"2026-08-07T13:30:41.562117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:41.181523Z","title":null,"venue":null,"work_id":"34dd2b36-8e49-43af-b700-78bd2ad974f7","year":2023},"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":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:36.029371Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:d8b200f58d2605d7b152ae743dc480a80f3fbeb160429e42c89d8e56fcf740a5","observation_id":"17221fb5-15db-4390-86a8-8fc7149532b4","resolution":{"observed_at":"2026-08-07T13:30:41.308599Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:40.915988Z","title":"Theoretical Computer S cience 457, 86–100 (2012)","venue":null,"work_id":"88d763f1-b2ec-4f13-ab99-3b7324d8ef68","year":2012},"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":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:36.140093Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:e0a69d7c1839f85f80df1c334ab0ee3747a16c5c71f8101c99fadf77c4e9a969","observation_id":"928c1108-074d-4236-87c2-584ad01edee4","resolution":{"observed_at":"2026-08-07T13:30:41.068048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:40.724014Z","title":"Di screte Applied Mathe- matics 143, 221–237 (2004)","venue":null,"work_id":"b1d9b7ae-f90c-42c8-9098-ad9e4d3e5c5d","year":2004},"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":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:36.280675Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:979a44d19aec4e0bf95b69f5cc4fcddd6d4171db527d0a3960dd19d07e247192","observation_id":"bcef46e6-eb9f-4fbc-b13c-10406b1812e1","resolution":{"observed_at":"2026-08-07T13:30:40.821249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:40.533899Z","title":"Annals of Operations Research 188, 175–183 (2011)","venue":null,"work_id":"dbc2a8d1-f4de-4a4c-bfd1-b62db6370936","year":2011},"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":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:36.377706Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:ec97293b6cbfcfb3b2bba2867919201cd506f70cad32ae6e884bf7a23ae59aab","observation_id":"c47ab517-6d05-4f83-bdf8-e2a30ffac575","resolution":{"observed_at":"2026-08-07T13:30:40.637473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:40.292759Z","title":"Algorithmica 83, 1677–1706 (2021)","venue":null,"work_id":"b5820eb5-f2e6-4146-8bba-19496a0c31ab","year":2021},"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":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:36.481261Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:42dea056215b0261f3713c3c06fdfb5019fdf7ac83de5565fe2a42107e7fd264","observation_id":"2831af36-0f07-4ed5-a06c-d798dba8dadf","resolution":{"observed_at":"2026-08-07T13:30:40.379435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:40.079473Z","title":"Annals of the New York Academy of Sciences 175, 170–186 (1970)","venue":null,"work_id":"2d8080c4-be36-497f-83ed-9dbb9736e2e0","year":1970},"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":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:36.571197Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:a15ce9491d0b502e01d9a09513d7c36c9dc3011b47f37a748315d65bc874f257","observation_id":"765b3670-7b48-4004-8619-2a29bf7705b4","resolution":{"observed_at":"2026-08-07T13:30:40.198517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:39.944919Z","title":"Nordic Journal of Computing 5, 128–142 (1998)","venue":null,"work_id":"5254b212-92f4-4351-81dc-e6cc9514c09a","year":1998},"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":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:36.670144Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:d0881475ea479c9dd0e9c42c06a995ea910c67ce6c772f7fe4e6f2a0d657e1c2","observation_id":"ffb30739-1a00-4fb1-b439-d3d739c82017","resolution":{"observed_at":"2026-08-07T13:30:39.984507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:39.705837Z","title":null,"venue":null,"work_id":"08421565-ddea-487f-baf3-d0f01d27b75f","year":2023},"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":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:36.734501Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:dcbf4b4f6c39cc970bceeee92c117cd519e4a8aedc14d62e82895e01284ceb9c","observation_id":"4a4a1a56-203a-4839-a8a1-a532740fac05","resolution":{"observed_at":"2026-08-07T13:30:39.776603Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:39.577806Z","title":"Theoretical Computer Science 931, 117–130 (2022)","venue":null,"work_id":"1861defe-0736-46c2-af8c-6cef86409654","year":2022},"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":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:36.832461Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:8ef5073ec5a450d4c66e6cdd80cf201e7861359a9d840615a8d1c0cd6990e07f","observation_id":"7f83663b-ff42-4f0a-88d0-2bea41afdb7d","resolution":{"observed_at":"2026-08-07T13:30:39.625106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:36.949134Z","title":"CoRR abs/2502.18942 (2025)","venue":null,"work_id":null,"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":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:36.949134Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:e1a1c83cba599125344c757120c03b916aab4d96dab9fdf95fe39ebc4acd56c1","observation_id":"1e250e90-25a9-4b01-91d2-1e1e39d96487","resolution":{"observed_at":"2026-08-07T13:30:36.949134Z","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-07T13:30:39.427512Z","title":null,"venue":null,"work_id":"6f4e632b-4baa-4364-b680-31086ca22208","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":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:37.057057Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:8978675e23aaa91c34bc4d8bf463c9c41fb17b4ca10de709697f3addb984cd57","observation_id":"73fa7355-74d8-4ca0-ab06-739b52d19d9e","resolution":{"observed_at":"2026-08-07T13:30:39.500362Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:39.237390Z","title":"Theoretical Computer Science 936, 33–42 (2022)","venue":null,"work_id":"f86ce0b5-5868-4dee-97fc-6cdbaf08064d","year":2022},"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":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:37.197878Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:1f44606bfc2339ae45981bb597e9d546f612ebdb8c056f480d8f5855c62c63bb","observation_id":"24e82ad5-f745-4bc7-89f3-d35bc0f6b109","resolution":{"observed_at":"2026-08-07T13:30:39.304158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:39.079296Z","title":"Algo- rithmica 85, 3290–3322 (2023)","venue":null,"work_id":"44082a14-c465-4032-b07d-7387946c3b84","year":2023},"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":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:37.340415Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:7b4241a0abee2ed71993148016237493c0bae6b7d6ccbc538ab13b659982a4d7","observation_id":"4dbae049-796f-4ee1-b848-79bbfbf19445","resolution":{"observed_at":"2026-08-07T13:30:39.135077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:38.824616Z","title":"Theoretical C omputer Science 1017, 114795 (2024)","venue":null,"work_id":"e0913197-6d9a-4e02-a4cb-53f32e88c340","year":2024},"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":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:37.429737Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:145467b8cdf08724567a610c86d9f9682e1587f8f575701f19bcc0e74441178d","observation_id":"25bb8d3e-3f7d-411f-9478-b18e5ab46bb8","resolution":{"observed_at":"2026-08-07T13:30:38.959816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:38.599404Z","title":"Journal of Grap h Theory 13, 527–536 (1989)","venue":null,"work_id":"ee565110-50e7-4481-afef-e9751784725b","year":1989},"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":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:37.510151Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:de93fc23ba241c66f2aa102e9f0034bfe9038645e03b07e4889b67bf0f25a6c3","observation_id":"5191a499-6f36-4035-aa59-033483a8b03d","resolution":{"observed_at":"2026-08-07T13:30:38.753105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:38.389227Z","title":null,"venue":null,"work_id":"9e0ed5de-ccab-4fae-9a8e-4cd47d906273","year":2001},"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":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:37.660691Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:f51af5a52716e9fd0df2f71a16a90ca4763410fb28dcc64649d688f4dfee8c7c","observation_id":"fe71ebd0-4685-46d6-b83e-a592a6e4b36d","resolution":{"observed_at":"2026-08-07T13:30:38.471659Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:30:38.210037Z","title":"Computer Applications in the Biosciences 10, 309–317 (1994)","venue":null,"work_id":"d5431ed2-ca67-4ca1-bcf7-316c3fa85071","year":1994},"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":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:37.736669Z"},"links":{"citing_paper":"/paper/2505.22351"},"observation_digest":"sha256:296fdd33de4222a7138129de3d781c3ee3f76ac7634f5decfe3dd8d7ebf7c8c4","observation_id":"38b543cd-8783-46bb-9daf-8abcef2ff83c","resolution":{"observed_at":"2026-08-07T13:30:38.291534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.22351","last_updated":"2025-05-28T13:32:59Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":29},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2505.22351."}