{"as_of":"2026-08-14T00:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2c28a276d1f4763f28d32fb4852d56289eaa3df6771df24b5a3e71b3da49ea37","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:18:45.628477Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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-01T12:35:28.219471Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.16179","snapshot_observed_at":"2026-08-01T12:35:28.219471Z","title":"Bogdanov, E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26606","last_updated":"2026-07-29T08:28:56Z","snapshot_observed_at":"2026-08-13T12:05:57.262915Z","submitted_at":"2026-07-29T08:28:56Z","title":"Cyclic Neighborhoods in Digraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T12:35:28.219471Z"},"links":{"cited_paper":"/paper/2505.16179","citing_paper":"/paper/2607.26606"},"observation_digest":"sha256:56cb0bfa71e41a345f303911a1d814d0ee572d3f059f5eb6d7438c48775343d3","observation_id":"43a938f1-2674-49d1-94d5-b78de5dcf562","resolution":{"observed_at":"2026-08-01T12:35:28.219471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.16179/citation-record","integrity":"/paper/2505.16179/integrity","json":"/paper/2505.16179/citation-record.json","paper":"/paper/2505.16179"},"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-07T15:18:48.308524Z","title":null,"venue":null,"work_id":"8cbb891b-ab0d-4bac-b8ab-6e0be2efcf0f","year":1990},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:44.008249Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:ba83581008125550a877d6655b0b9ca3db18dada722ee61a7d44c0f6477384ef","observation_id":"39806635-f5b8-488f-a0c1-5cbb9754d1c7","resolution":{"observed_at":"2026-08-07T15:18:48.383797Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:48.154921Z","title":"Bollob´ as.Modern graph theory, volume 184","venue":null,"work_id":"1cb40427-5535-4ab5-a82c-833a653d5576","year":2013},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:44.074798Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:1ae435d46e3a80a73e4eda6d1ec658a2ff095b4d6707a38779ccb095d1260578","observation_id":"886aaae6-4be0-4841-839f-3220bae65a68","resolution":{"observed_at":"2026-08-07T15:18:48.212538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:47.952257Z","title":"Bonsma, A","venue":null,"work_id":"28823a84-6b03-4af0-9f5a-b044a493d471","year":2012},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:44.207356Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:c066bb97f71677c07311d04ac47604917b5662cb7256fa217c74712fb4becddb","observation_id":"54525679-bb52-4d50-a9ec-de3ca6c7cfb0","resolution":{"observed_at":"2026-08-07T15:18:48.041106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:47.779860Z","title":"Botler, Y","venue":null,"work_id":"916cf8cd-b8eb-4e33-99e9-ad32816fcc9d","year":2024},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:44.294652Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:f609156fa547546adc6865c3438c957881a6b725879a4f0d4d4845a843343e82","observation_id":"3ee18013-1a7b-445b-b360-b5e8444afa5c","resolution":{"observed_at":"2026-08-07T15:18:47.883487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:47.614902Z","title":"Caro and R","venue":null,"work_id":"a8d10b73-c52a-4e08-af3f-c3db1714760a","year":1999},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:44.395705Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:74ee4b5a5640f0f542f6f5ebbb43a9b5613bc90c942132ca317e4010e2e67737","observation_id":"9ba3e3ce-ff42-4868-a4a5-42a202856637","resolution":{"observed_at":"2026-08-07T15:18:47.686377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:47.428176Z","title":null,"venue":null,"work_id":"297085f3-3f57-44a2-b012-4d310e596305","year":2002},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:44.520194Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:5df65897d0307d81a8ca27115d6009af7fb774c628aa6c8186f1dcfb386d1433","observation_id":"439377ed-50ec-4bbb-8e27-84e756e39cf7","resolution":{"observed_at":"2026-08-07T15:18:47.544390Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:47.277826Z","title":"Chen and X","venue":null,"work_id":"4b81dc2e-2975-4350-b517-976438431df3","year":2002},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:44.649230Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:2ddf5b7971d8abfef8f27b8fd7b418ce55fd2acf29fd634dc111955b51e946c1","observation_id":"70696f55-6199-42ef-b76f-491aee31922f","resolution":{"observed_at":"2026-08-07T15:18:47.375128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:47.176330Z","title":"Cheng, Y","venue":null,"work_id":"909c7bda-570e-4466-823c-cefdd7153ee9","year":2024},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:44.783557Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:c858c067bfe573cb651da747818b906bbf42a4e32b920e5a86b0451977e17326","observation_id":"58bb4494-7b18-401e-9eed-460b56d69b33","resolution":{"observed_at":"2026-08-07T15:18:47.231678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:46.926809Z","title":"Chernyshev, J","venue":null,"work_id":"3edccac2-a975-47c9-8b3d-7039f30eca28","year":2024},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:44.922902Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:028b18411e3ca8162594842c4c62741838dd89dbc61068d7f9cf6f59aa8b0485","observation_id":"b2cbb722-ab26-45e3-9d02-96c68f4bdb09","resolution":{"observed_at":"2026-08-07T15:18:47.034686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:46.790360Z","title":"Fox and J","venue":null,"work_id":"bd27418b-b3d5-41d2-8922-e4856a210dea","year":2010},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:45.057787Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:21cce8f18ec02d9c8d90924b52f8db394bb16e8d29f5cbe8f5ea413d4008d2d1","observation_id":"f525274a-ab0a-46fc-98b1-c55878e3138c","resolution":{"observed_at":"2026-08-07T15:18:46.833705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:46.630995Z","title":null,"venue":null,"work_id":"fac3e503-a76d-43ae-9b4b-808a024e4877","year":1984},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:45.177384Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:c022e7e507abff015fbbabd3b3c6ea00c40f0bc743f76be80d287780c5af95be","observation_id":"afc0aefa-50c4-458e-9432-8ec94629fe4c","resolution":{"observed_at":"2026-08-07T15:18:46.725833Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:46.435672Z","title":null,"venue":null,"work_id":"c47b5095-2b4f-41e7-8b1c-9c6826b1ab5b","year":1977},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:45.275613Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:2627155cea0c72e833d01a0484c819b76c640d316cb991791c7257b997da5569","observation_id":"2d638ac0-c245-4c34-b0fa-64685f65233b","resolution":{"observed_at":"2026-08-07T15:18:46.485492Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:46.243265Z","title":"Pfender and V","venue":null,"work_id":"bb537b07-1543-47cd-abbc-840e3719df59","year":2013},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:45.379935Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:7c7634280951bcd3f2583f2a27016ff4f5f23e594332588f185e80d2ab40257e","observation_id":"e68eb07b-16da-4518-b054-fb8247c6cd14","resolution":{"observed_at":"2026-08-07T15:18:46.325471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:46.001536Z","title":"Rauch and D","venue":null,"work_id":"498c9649-86f1-4cdd-8a8a-b0b127129856","year":2024},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:45.500386Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:aa9b7cc6268a593050b7d14ef9e022f8d53952403adcea085f863077fa8278c9","observation_id":"d0f6eb5e-96fd-4777-b9ea-6e023ab935b5","resolution":{"observed_at":"2026-08-07T15:18:46.131410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-07T15:18:45.780739Z","title":null,"venue":null,"work_id":"f63c4654-29bd-4f25-8e35-8fa4c8f6c437","year":2005},"citing_paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:45.628477Z"},"links":{"citing_paper":"/paper/2505.16179"},"observation_digest":"sha256:71d1da497eeaa746c1a62e87ee70c77caef3d95e8539d5c4ec84f98654a4350f","observation_id":"77fbc39e-4cd8-4b4f-b76e-3416d7d94c5c","resolution":{"observed_at":"2026-08-07T15:18:45.882153Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.16179","last_updated":"2025-05-27T19:55:39Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T15:03:46.931781Z","submitted_at":"2025-05-22T03:34:48Z","title":"On forest and bipartite cuts in sparse graphs"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":15},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 1 inbound Pith citation observation for arXiv:2505.16179."}