{"as_of":"2026-08-17T01:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee4ce4c26522a9edac8d4489637483bd1de1df5b1e34cb799d082784b3c0960c","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:35:40.348203Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.09065/citation-record","integrity":"/paper/1908.09065/integrity","json":"/paper/1908.09065/citation-record.json","paper":"/paper/1908.09065"},"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-14T11:35:40.580365Z","title":null,"venue":null,"work_id":"6a91cf81-65e0-453b-8143-664a640a69f8","year":2003},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.275524Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:49e88c9e1f6f1ea7b31837c1fb5d9a81ad00c4de6cc30096d6f5fbc44704a7af","observation_id":"7d708525-af34-4b59-9a1b-9fa4889f8396","resolution":{"observed_at":"2026-08-14T11:35:40.583850Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.568853Z","title":"Adrian Bondy, and Bruce A","venue":null,"work_id":"aa3b6406-893f-48ea-8cd3-e9995359dc4b","year":2007},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.280302Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:7b64919e7c8a79b10d334725121030fe9a12eb9eaab54222acc2295f252bac24","observation_id":"850659b5-61ce-4b8d-b5f1-35d9e1292193","resolution":{"observed_at":"2026-08-14T11:35:40.572678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.558239Z","title":"Graph Theory 87 (2018), no","venue":null,"work_id":"ebe29154-81da-46f2-aa0a-5371fe261c20","year":2018},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.284581Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:f40c3a51150575b9c7d0f1044a5bdd0c096b2f5612664665c34a20ca3f25abed","observation_id":"cc3d7880-2e09-4aaa-bda4-db0ec9e23462","resolution":{"observed_at":"2026-08-14T11:35:40.561964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.548180Z","title":"Discrete Math","venue":null,"work_id":"641795be-1378-4e71-9709-53bf5b11386a","year":2013},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.288857Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:0c4e42433c6fe40864aebddd07cf7d3d98978143b7e6469168cff0ea83744b0e","observation_id":"9ee27702-0c76-4026-b69c-3f98d12b3e9d","resolution":{"observed_at":"2026-08-14T11:35:40.551648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.538933Z","title":null,"venue":null,"work_id":"0d0b9ef7-a379-44b2-a2b6-853c06379a14","year":1962},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.292821Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:19e7c0aefa86d23da2f09cbf5e272fe683d7ae9853457e92b1dc3e6cc1a81ad6","observation_id":"2ae2b94e-bc3d-4f86-a1d4-d6cf47aee00a","resolution":{"observed_at":"2026-08-14T11:35:40.541926Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.528973Z","title":null,"venue":null,"work_id":"33910b65-37a2-42de-b72c-90a0a2a95683","year":2000},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.297070Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:5a4afc0f2b4e66a62b04e0d345fba1b9c124b8211b51dbbfa7581d3262e48a52","observation_id":"1bd60032-07b9-4abf-b8e2-c35535beca1f","resolution":{"observed_at":"2026-08-14T11:35:40.532220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.518144Z","title":"Graph Theory 77 (2014), no","venue":null,"work_id":"60fb25cb-83c4-4558-b615-4ce6dfb04d1e","year":2014},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.301154Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:cab563897fce6e431caab72ac0ab86040f3f073c123de933379cae3dcd5c2e01","observation_id":"c4cf8333-9356-4bb1-b5ca-0f7141ed364c","resolution":{"observed_at":"2026-08-14T11:35:40.522172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.507457Z","title":"1, 91–133","venue":null,"work_id":"1a50c10d-6252-49e8-80ac-c4e0cadea25a","year":2019},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.304931Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:bacadb68be2e992a05dad745ece4a09c6d9245c7fdc5a001c5b538241591875e","observation_id":"9992a875-6080-43d5-9dea-230a4408a97b","resolution":{"observed_at":"2026-08-14T11:35:40.511116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.497035Z","title":"Discrete Math.26 (2012), no","venue":null,"work_id":"51ae1fc5-298b-4705-9ed6-8d291361c22e","year":2012},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.308367Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:bad2cc1b5166a6f5668514a2721d8dfb6e4ef7f075aebb73acef0cd9f1fa69e7","observation_id":"e05916a8-55ac-4dd2-8fda-dfbe21ddd298","resolution":{"observed_at":"2026-08-14T11:35:40.500755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.486270Z","title":null,"venue":null,"work_id":"262e833c-a261-476f-9c4b-84752380b843","year":2011},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.311628Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:bf6418d3f30ca743daaabc0d3b25382e590785c8930b3966114a571ac8380768","observation_id":"2d74d5b2-3ddf-4d57-9ab3-200f905dec7d","resolution":{"observed_at":"2026-08-14T11:35:40.489813Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.474444Z","title":"1665–1684","venue":null,"work_id":"b0b0b9f6-f691-46bc-9576-0ed9af72abaf","year":2018},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.315174Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:01a52b685d27f314e58c826470de9a3b95fb88a34595566b5399f23ebfb7554a","observation_id":"b3093247-478f-4c1e-8116-b93092a55df8","resolution":{"observed_at":"2026-08-14T11:35:40.478522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.463305Z","title":"Lapok 16 (1965), 289–299","venue":null,"work_id":"b832ad01-c9a7-481a-93d9-a6b23209302c","year":1965},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.318823Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:6179415407dc9453cab7715f54728a36521c8f24815e9c877313090d0abcd736","observation_id":"6d20fe47-a301-4640-a020-c6d389c052cf","resolution":{"observed_at":"2026-08-14T11:35:40.467218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.452348Z","title":"Mousset, A","venue":null,"work_id":"1828f605-742c-4bb6-b8f0-14dd34351e30","year":2017},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.322461Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:ac87fb3b1001b4a57852f0e60765f81d7dc37946542284264a749996ed4bb085","observation_id":"4bc07991-2d0e-43d6-8d2e-5b33d2f53741","resolution":{"observed_at":"2026-08-14T11:35:40.456039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.441373Z","title":"Pontecorvi and P","venue":null,"work_id":"5213cdc7-ea61-4faa-a33b-24d398c1d468","year":2012},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.326394Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:200b090f079a4a73a2dbcfb00f0dbd30651df639b9db77aa7d406d4a6229ac36","observation_id":"7c2da2e4-a77f-4b23-998a-e5772653cc9a","resolution":{"observed_at":"2026-08-14T11:35:40.445212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.429012Z","title":"Thilikos, Recent techniques and results on the Erd˝ os- P´ osa property, Discrete Appl","venue":null,"work_id":"debb36ed-589c-4c07-a950-c5746f03c1f4","year":2017},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.330024Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:01eb36300ef71ad1c4a618b387756efd3d75aadd5bf9af83c14623778d01dadb","observation_id":"5d635e1b-7b59-4b3a-8a89-11a66698735c","resolution":{"observed_at":"2026-08-14T11:35:40.433330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.417500Z","title":"2, 267–296","venue":null,"work_id":"e0844864-6fc2-4253-a655-7e329e943d20","year":1999},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.333670Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:e40e6c0c8610493874d0cd8538a42cc75d3a387f6b72a93cc03f001ce8d3f482","observation_id":"f727b191-dfaf-40fa-91a8-10a70f2f05da","resolution":{"observed_at":"2026-08-14T11:35:40.421029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.407681Z","title":"4, 535–554","venue":null,"work_id":"41093499-2e0a-4305-9496-c693d6f8f718","year":1996},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.337376Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:5124a1fd523dccd0572b5a619aa7391dc8290fb062f60a4c54f0595001c5bd75","observation_id":"c7e47e4b-b2cc-4921-a076-07feb9df2396","resolution":{"observed_at":"2026-08-14T11:35:40.410755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.398028Z","title":null,"venue":null,"work_id":"740fba83-1579-4e08-9c8c-ab28f7273a10","year":1986},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.340985Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:c05194802c5346e76e22dac543c7a6f1ef7dd68a3e6c18acd8c0a44740d25532","observation_id":"38dd7ac7-3abb-4358-8754-1f845264986e","resolution":{"observed_at":"2026-08-14T11:35:40.401059Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.387556Z","title":"Graph Theory 12 (1988), no","venue":null,"work_id":"bf4cf96b-c63f-450c-9374-ddc90b75bfb8","year":1988},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.344495Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:326eeef1f5531b9171f111bee6bf1f9c5a5377bfd2b6719f2a1c91153d8a047a","observation_id":"8d5f0fc5-51e1-4573-8890-7b2aea4b636c","resolution":{"observed_at":"2026-08-14T11:35:40.390844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:40.374421Z","title":"Voss, Eigenschaften von Graphen, die keine k ` 1 knotenfremde Kreise enthalten , Math","venue":null,"work_id":"15238b86-020d-41b5-8421-41e6c050d957","year":1969},"citing_paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:40.348203Z"},"links":{"citing_paper":"/paper/1908.09065"},"observation_digest":"sha256:9d4ceda47bc837b8b2360bee02badcaf0a239acebf8c420bd45408a8f559cf2c","observation_id":"1d368ed3-ae93-43e2-9668-23e9ad0c9cc0","resolution":{"observed_at":"2026-08-14T11:35:40.379901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09065","last_updated":"2020-02-11T06:59:27Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T16:42:53.252213Z","submitted_at":"2019-08-24T01:22:50Z","title":"Graphs without two vertex-disjoint $S$-cycles"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":20},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:1908.09065."}