{"as_of":"2026-08-23T15:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a21e611239a1c97abbd393a86b3018d1cbda08621b4fb93b146cc49ff47d418","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T17:47:14.495513Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2508.16199/citation-record","integrity":"/paper/2508.16199/integrity","json":"/paper/2508.16199/citation-record.json","paper":"/paper/2508.16199"},"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-05T17:47:19.680547Z","title":"Andr´ asfai, P","venue":null,"work_id":"e2c5d5d2-569f-4262-b86a-78710927fb5a","year":1974},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:12.481979Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:7e070d9f08b6810fc309b473b3bf720e25ecbb80a5519d839c1940d8be482b32","observation_id":"e70ca564-5f95-4ef5-a547-0850ce368926","resolution":{"observed_at":"2026-08-05T17:47:19.788912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:19.480995Z","title":"Balogh, F","venue":null,"work_id":"3d7c7f1d-eb80-4814-a023-09ce13f9cbdc","year":2021},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:12.547074Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:beb0ad12457aeb4e05f2f204d7f9a542423e0e1edcbf0543f9374344e94cfa2c","observation_id":"b5df1615-981c-4e15-af61-88f503ebf289","resolution":{"observed_at":"2026-08-05T17:47:19.570499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:19.280546Z","title":"Bollob´ as and A","venue":null,"work_id":"314fd440-1f29-474f-81d3-834e11a9df4a","year":1999},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:12.620617Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:5a8ed7ba2ab170930d863ce9e0040b0564a5210d1cef3814840fbffcc02996db","observation_id":"daf40d5b-22d4-444f-b780-d8754bbe037b","resolution":{"observed_at":"2026-08-05T17:47:19.354111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:19.122577Z","title":null,"venue":null,"work_id":"f0b9d78f-1e25-4292-9155-c748111d36f8","year":1971},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:12.705962Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:38ea5a41b6d80de3eac94f560302d546e625e21b560a3d7e62efcd4b47fab10a","observation_id":"438921c7-6aa2-4150-bee5-50cfaf32693c","resolution":{"observed_at":"2026-08-05T17:47:19.202871Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:18.960302Z","title":"Brandt, A sufficient condition for all short cycles, Discrete Applied Mathematics 79 (1997), 63–66","venue":null,"work_id":"1feb38f6-e6b7-49e8-80a1-47aff26bccaa","year":1997},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:12.739323Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:ebcf8194f1b4a280f64c0116bbe19386403c3dc96abaf4a28aaaed199579a037","observation_id":"f5dc73b9-4a43-4bc5-86bc-13f2f3e48c17","resolution":{"observed_at":"2026-08-05T17:47:19.038987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:18.706542Z","title":"Brandt, R","venue":null,"work_id":"2c558c1c-f100-4969-8cb9-c00459d56455","year":1998},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:12.837129Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:417b7e6cb1c89a5026554599de0d0cb29cf8add8ad51f369e51b373d288c507d","observation_id":"9f84f2ad-4a7b-4532-9653-94e654be9343","resolution":{"observed_at":"2026-08-05T17:47:18.815358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:18.413933Z","title":null,"venue":null,"work_id":"aa0d0a84-5576-475a-a593-a2ebc984f30f","year":1981},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:12.888823Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:db1532fad28ba7fc089fb5487424635154301e715f121ad8b07c1c015af626c5","observation_id":"eecb9453-1459-44e4-bfe3-ce06f33989a2","resolution":{"observed_at":"2026-08-05T17:47:18.575238Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:18.126173Z","title":"Caccetta and R","venue":null,"work_id":"530641ee-b7cd-4485-91b6-05e4f67739c6","year":2002},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:12.951746Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:24208a076c9c89481856081021992a46ce39427a04228891feb888fa15133505","observation_id":"58f1e1d9-f4b0-45ea-89d8-aa38d332189b","resolution":{"observed_at":"2026-08-05T17:47:18.284748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:17.791825Z","title":null,"venue":null,"work_id":"7501281c-29f3-4b5f-b551-b35ead396f6e","year":1952},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.026666Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:f1a4d0f680b532bf187bacd3325cdf6250668423713530d46b779f7c13cce693","observation_id":"450d6760-4e0f-4dbe-ae40-8ce90009c9a8","resolution":{"observed_at":"2026-08-05T17:47:17.996328Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:17.556719Z","title":null,"venue":null,"work_id":"f4b12dd3-c0b9-4377-ac1d-82eec5ca0485","year":1966},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.113528Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:bad48127fb15ff0af7a151e87be872b063e8e21b488b2798f9526842fcb04b14","observation_id":"8c67be70-5471-455c-badd-c9ff051449a1","resolution":{"observed_at":"2026-08-05T17:47:17.701370Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:17.312922Z","title":"Erd˝ os, On some new inequalities concerning extremal properties of graphs, In: Theory of Graphs (Proceedings of the Colloquium, Tihany, 1966), Academic Press, New York 1968, pp","venue":null,"work_id":"919dae9d-51d3-4245-a43e-f0550d98d28b","year":1966},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.184321Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:252ab1388d01f6441b321173888c616a609ba482956dd16e14baed622e40a0d1","observation_id":"7fec7243-938b-4192-bfc5-3761977ca2b9","resolution":{"observed_at":"2026-08-05T17:47:17.424223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:17.074450Z","title":"F¨ uredi, A proof of the stability of extremal graphs, Simonovits’ stability from Szemer´ edi’s regularity, J","venue":null,"work_id":"3c7fb296-5b59-4d92-beab-164f2dac7a93","year":2015},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.247559Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:1729de0c38eb45bbae55db5015d2b8d19ab7cd1d92b73f083e2ebf87f5069b2a","observation_id":"97123bea-12e0-459b-9f38-5315e207f151","resolution":{"observed_at":"2026-08-05T17:47:17.199647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:16.736503Z","title":"F¨ uredi and D","venue":null,"work_id":"8604796a-8703-4e15-a929-dc63de9688ba","year":2015},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.333295Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:02f45b40a3b2364584825a027a5a7f7ef936e6db10afad3d08f944a069d3c5e1","observation_id":"a0a76dc0-9638-432b-abf8-746fec5e0223","resolution":{"observed_at":"2026-08-05T17:47:16.899616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:16.373124Z","title":"Gy˝ ori, V","venue":null,"work_id":"4071d9a7-7b8a-4c69-a239-8d33d59d2bde","year":2003},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.407013Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:f48194a07903ae5a0471d9d901a4c713e048b2e59953af654eefbf63e310eceb","observation_id":"c8459bc3-38a3-4b4d-be72-92f99f12b052","resolution":{"observed_at":"2026-08-05T17:47:16.521406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:16.083491Z","title":"H¨ aggkvist, Odd cycles of specified length in non-bipartite graphs, North-Holland Mathematics Studies","venue":null,"work_id":"a1e8e9c3-f449-418c-b24e-ca4dd7960c69","year":1982},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.482915Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:74748d8b1570e1ad4ba96f9c41434ac7c3dfa8f0aee7d8e9ac4895009235dd4f","observation_id":"474c9716-797c-44f3-b344-479a49443181","resolution":{"observed_at":"2026-08-05T17:47:16.184134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:16.045039Z","title":"H¨ aggkvist, R","venue":null,"work_id":"42287ca3-e319-4475-af9e-2ac45029f450","year":1981},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.590340Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:e943497e01f75cecc92cf94f0ca07481344b5fe6eab4131e62482ee4ab4b4808","observation_id":"1939fedb-e37a-4c75-8d11-1aa95031d1c7","resolution":{"observed_at":"2026-08-05T17:47:16.073776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:15.840467Z","title":"Kor´ andi, A","venue":null,"work_id":"d6fd51b8-fdd7-47bb-9586-7cb133c109b7","year":2021},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.657491Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:111a2c0bc2bcd8e9f2fa44241d11bb9c0f8922b994337c5652056a11e4d1ba51","observation_id":"267b9c91-a0cb-42fc-95f7-f751c38808e0","resolution":{"observed_at":"2026-08-05T17:47:15.947230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:15.685605Z","title":null,"venue":null,"work_id":"fc22bd04-b745-4282-85cf-0d64f69ccf73","year":2021},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.733677Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:954ee252ff701ba698e0ad8aa26920bd7a411758efebae0640018944fb055f0e","observation_id":"ffdff23c-975f-4f3b-b2c7-89b32da324f6","resolution":{"observed_at":"2026-08-05T17:47:15.761887Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:15.482619Z","title":"Mantel, Problem 28, In Wiskundige Opgaven 10 (1907), 60–61","venue":null,"work_id":"a4c56a8b-8c1f-4f8d-b29b-91d5a6e0c418","year":1907},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.812022Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:afbfb49a5a5c92f5ae931333ea13c95560c67f2b3d12f83e7e02118c59fe0710","observation_id":"f81105b4-5ce8-48ec-95d6-d041c462f00f","resolution":{"observed_at":"2026-08-05T17:47:15.598161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:15.362197Z","title":"Nikiforov and R","venue":null,"work_id":"1c03ab39-4dcc-4331-bdfe-62249013ce96","year":2004},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.868400Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:61c99d3d6f0fdbabb21936a3fab2644253ea19843a6f6592c24d9be4896c5ae9","observation_id":"c1907236-fd19-45a1-a838-1fc353bc2953","resolution":{"observed_at":"2026-08-05T17:47:15.433917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:15.211889Z","title":"Nikiforov and R","venue":null,"work_id":"d39c7f5a-1fc0-449c-8e6b-778aad333296","year":2004},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:13.965315Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:458f8fd92189edd8488e1901695f345fbfdc987d45800ca4aac12c7526240928","observation_id":"72ecf3d1-7e2b-4453-8aa6-4711bea4c2eb","resolution":{"observed_at":"2026-08-05T17:47:15.266039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:15.031281Z","title":"Roberts and A","venue":null,"work_id":"95cac393-abf9-4f6a-9653-360ba467da5d","year":2018},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:14.037854Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:e5546bc6b9eb7bcc7fb24ee1cc8ca10c45f2372adb56c55384506cf050875e12","observation_id":"1869c682-0809-4d00-80e0-a7874a5f862e","resolution":{"observed_at":"2026-08-05T17:47:15.109136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:14.893976Z","title":null,"venue":null,"work_id":"7d20e18e-b743-4a72-9bec-f63d4b33fe21","year":2024},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:14.106286Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:2f2f88541442303f7078e3b4b47f87b96d892bbad3db4b125d766465fda23684","observation_id":"ccba7097-dae8-4537-b0b9-c41a4d688452","resolution":{"observed_at":"2026-08-05T17:47:14.937482Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:14.714473Z","title":"Simonovits, A method for solving extremal problems in graph theory, stability problems, in: Theory of Graphs, Proc","venue":null,"work_id":"81a8839a-f72e-42be-bd5f-2cce8c5402b0","year":1966},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:14.193935Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:bdc219a7c2900c7e8bcdac0aa193244982ae2024090b9a445f8e0b82e9e9f401","observation_id":"6b6afa65-9bbe-45a8-8be9-433a0404dd6e","resolution":{"observed_at":"2026-08-05T17:47:14.793882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-05T17:47:14.597001Z","title":"Tur´ an, Eine Extremalaufgabe aus der Graphentheorie, Mat","venue":null,"work_id":"0b818ec4-e6fb-4976-b835-f04b93974d46","year":1941},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:14.293775Z"},"links":{"citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:d8aa8cd4341f07f3afa71fcce34d8580b3fe6643693070f3b7f9a88985a24a30","observation_id":"19282bcb-9442-47b2-b090-6b15c5851544","resolution":{"observed_at":"2026-08-05T17:47:14.642249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15487","last_updated":"2024-10-22T08:09:04Z","snapshot_observed_at":"2026-08-20T15:07:43.388913Z","submitted_at":"2024-08-28T02:21:37Z","title":"A strong structural stability of $C_{2k+1}$-free graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15487","snapshot_observed_at":"2026-08-05T17:47:14.392729Z","title":"Yan and Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:14.392729Z"},"links":{"cited_paper":"/paper/2408.15487","citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:cc378838ec5d38dbc41f4af473c0b9a8b27085958a94163ea7d3d5c72172e369","observation_id":"71f4f500-3197-4633-9179-07cf108aefc0","resolution":{"observed_at":"2026-08-05T17:47:14.392729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.13643","last_updated":"2025-08-27T08:10:12Z","snapshot_observed_at":"2026-08-09T22:44:10.542942Z","submitted_at":"2025-08-19T08:54:09Z","title":"Strong spectral stabilities for $C_{2k+1}$-free graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.13643","snapshot_observed_at":"2026-08-05T17:47:14.495513Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T17:47:14.495513Z"},"links":{"cited_paper":"/paper/2508.13643","citing_paper":"/paper/2508.16199"},"observation_digest":"sha256:988255fd97ea27884e5b4b3d293a50985e6406f3d4c196e3b15e2f76696ae7ab","observation_id":"47ae103c-3c8a-44dd-86e7-63460312cc2c","resolution":{"observed_at":"2026-08-05T17:47:14.495513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.16199","last_updated":"2025-08-22T08:18:58Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-17T12:41:28.737102Z","submitted_at":"2025-08-22T08:18:58Z","title":"Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":27},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2508.16199."}