{"as_of":"2026-08-08T06:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4103de6b87267b1d521ee942bf6561341c181f47104adef0f5fa6a1041e1565e","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:49:04.132022Z","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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T13:55:44.072306Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T23:46:24.174943Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"cited_work":{"arxiv_id":"2507.12798","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.12798","snapshot_observed_at":"2026-07-01T23:46:24.174943Z","title":null,"venue":null,"work_id":"c473ccdd-9923-491b-bf84-2f701ca5ab62","year":2025},"citing_paper":{"arxiv_id":"2605.02731","last_updated":"2026-05-04T15:31:57Z","snapshot_observed_at":"2026-08-06T13:28:05.215428Z","submitted_at":"2026-05-04T15:31:57Z","title":"Existence of cycles of length divisible by 3 or 4","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-08T18:14:21.929479Z"},"links":{"cited_paper":"/paper/2507.12798","citing_paper":"/paper/2605.02731"},"observation_digest":"sha256:f6dc9be411a2a6940e938313734b62623be474aa48774a31d34ed48c04bd9247","observation_id":"9ff70c8d-4d7d-425a-8894-a4a144b01cee","resolution":{"observed_at":"2026-05-09T06:40:40.374666Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"cited_work":{"arxiv_id":"2507.12798","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.12798","snapshot_observed_at":"2026-07-01T23:46:24.174943Z","title":null,"venue":null,"work_id":"c473ccdd-9923-491b-bf84-2f701ca5ab62","year":2025},"citing_paper":{"arxiv_id":"2606.02356","last_updated":"2026-06-07T02:34:55Z","snapshot_observed_at":"2026-08-07T00:27:20.602488Z","submitted_at":"2026-06-01T15:03:07Z","title":"On 2-connected graphs without cycles of length 1 modulo 3","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-28T13:55:44.072306Z"},"links":{"cited_paper":"/paper/2507.12798","citing_paper":"/paper/2606.02356"},"observation_digest":"sha256:06c57368a746604be130486b65ca1d4c192939c545520f1e4e1fab17e34a904e","observation_id":"5344d71e-ba25-423a-bc07-b63909a12090","resolution":{"observed_at":"2026-07-01T23:46:24.176798Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.12798/citation-record","integrity":"/paper/2507.12798/integrity","json":"/paper/2507.12798/citation-record.json","paper":"/paper/2507.12798"},"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-06T16:49:07.464682Z","title":null,"venue":null,"work_id":"c6752fae-ac39-48ff-98aa-1f43807ee80c","year":null},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:02.378990Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:46e49c97adfb715bdd82628f1f68f167838b42af53598aeef3f50c7eaa005dae","observation_id":"55a02a89-d7e2-45a8-8515-56ca0e7d25de","resolution":{"observed_at":"2026-08-06T16:49:07.559484Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:07.252619Z","title":"Bollob´as","venue":null,"work_id":"94d88eb7-9709-400a-aa9e-d6484e8b042b","year":1977},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:02.509013Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:6b175d0462379dab9640d4ec4b4e7c40d4f49c9b268e13d23d5b449176dfb9b7","observation_id":"8826c0ca-aafb-43a4-9299-9e4cac4df1dc","resolution":{"observed_at":"2026-08-06T16:49:07.364832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:06.969482Z","title":null,"venue":null,"work_id":"015cb52b-1b56-437d-a12b-74d961dd6793","year":1994},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:02.619308Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:9a93731be787b42ba9257340a0915882ba327e9e4c8e5f5f3da690af41aa277d","observation_id":"79d781d1-fbdf-46cd-8ca9-3400cbd0c799","resolution":{"observed_at":"2026-08-06T16:49:07.097976Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:06.696126Z","title":null,"venue":null,"work_id":"bcc74638-1007-43c5-b4d0-42a93dbe2492","year":1991},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:02.784480Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:3f6617ccc1d032e9ac37aade24e6476ed23da0d4322b40ac9f41e86592a92105","observation_id":"e93949b2-b92f-4b1a-a77c-9cadee6ace8f","resolution":{"observed_at":"2026-08-06T16:49:06.813545Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:06.472987Z","title":null,"venue":null,"work_id":"d4dd102a-fb30-4b77-a3e2-3665b50545a5","year":1993},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:02.874529Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:5319de9d732f2d3d16e6887797e4f27db7544414121f5e305c631d2f44fb9db3","observation_id":"8224a389-5c05-423c-b0fc-11bd6a1959ff","resolution":{"observed_at":"2026-08-06T16:49:06.567765Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:06.180761Z","title":"Erd˝os, Some recent problems and results in graph theory, combinatorics, and number theory, In Proc","venue":null,"work_id":"7fb35ec4-cb53-4f24-b0de-509c828140f9","year":1976},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:03.026531Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:3c8962656d52001a9e064f87022940f1733c3ade931f3b0448ee133fb8d65ab1","observation_id":"2edb5809-57e6-43c0-beaa-0b44dc11f3f6","resolution":{"observed_at":"2026-08-06T16:49:06.301536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:05.975840Z","title":null,"venue":null,"work_id":"4f907083-a8d7-4dc7-9fef-fb6863dacee9","year":2004},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:03.169456Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:2dd215657f990646635aeaa3d28f940a4a981556b4ca82e00944980ddab176e2","observation_id":"28b5e20e-42b6-4835-af50-2275b7fd0eec","resolution":{"observed_at":"2026-08-06T16:49:06.052682Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:05.764951Z","title":null,"venue":null,"work_id":"5bdb1f5e-3554-4afb-bdd4-7bbe11e88334","year":2024},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:03.295415Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:a7e1809c0e0c56f370b6a4e8aa23c7c8c7c71866c085131931fa5e6fb93066e3","observation_id":"ac61b98e-c35e-4e9a-aaf6-1fb1b28586ef","resolution":{"observed_at":"2026-08-06T16:49:05.865893Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.09999","last_updated":"2023-12-15T18:16:59Z","snapshot_observed_at":"2026-07-06T17:03:02.786273Z","submitted_at":"2023-12-15T18:16:59Z","title":"On graphs without cycles of length 0 modulo 4","version":1},"cited_work":{"arxiv_id":"2312.09999","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.09999","snapshot_observed_at":"2026-08-06T16:49:04.550471Z","title":"On graphs without cycles of length 0 modulo 4","venue":"math.CO","work_id":"fe5b0476-bbcb-467f-bc91-ad489aa87f67","year":2023},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:03.427602Z"},"links":{"cited_paper":"/paper/2312.09999","citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:849a02044215c3b757e43ad2ae458cb4d7c4fa17b1439d0e859aa82e5ea0ec76","observation_id":"2d93e954-baa1-46d2-9187-b3d1a837dc9f","resolution":{"observed_at":"2026-08-06T16:49:04.690456Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.08692","last_updated":"2025-06-10T11:08:17Z","snapshot_observed_at":"2026-08-07T05:02:01.243002Z","submitted_at":"2025-06-10T11:08:17Z","title":"A note on two cycles of consecutive even lengths in graphs","version":1},"cited_work":{"arxiv_id":"2506.08692","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.08692","snapshot_observed_at":"2026-08-06T16:49:04.298924Z","title":"A note on two cycles of consecutive even lengths in graphs","venue":"math.CO","work_id":"ee74f1dc-e9af-4548-a240-f7610991317a","year":2025},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:03.558927Z"},"links":{"cited_paper":"/paper/2506.08692","citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:1fa81fb7128c690bfc2b455fe5c4e2190febf84b3a5f97b2cc04babcd06f6587","observation_id":"26250f58-353b-485b-8c4b-9bf6a2b177bf","resolution":{"observed_at":"2026-08-06T16:49:04.412867Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:05.586152Z","title":null,"venue":null,"work_id":"0871f465-d017-4f55-be6c-f6fd47a858d8","year":2013},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:03.682246Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:884f56981c34d272274225791efdc04bc3eef0deac41ebf4d4305d7274856b6a","observation_id":"b51a1ab1-7425-458e-8192-a10ecea07fa8","resolution":{"observed_at":"2026-08-06T16:49:05.674957Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:05.368235Z","title":"Saito, Cycles of length 2 modulo 3 in graphs, Discrete Mathematics, 101(1–3):285–289, 1992","venue":null,"work_id":"78dc1e2b-29aa-4b69-a2db-3923f7a8e591","year":1992},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:03.784122Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:4f2f76d6b65f04b970a555bd70bdf990aa82dd99e281ff6f9914d2c3784f43b1","observation_id":"3bdd2d82-1d89-46d7-9d32-2895199351dd","resolution":{"observed_at":"2026-08-06T16:49:05.478649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:05.042057Z","title":"Sudakov and J","venue":null,"work_id":"c7405b99-e86d-4ce1-9f15-02372fbc82f7","year":2017},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:04.024623Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:71fff133fd62d5e34372a414851e6ff27f435f4b76ea1865b1353535f9fc287d","observation_id":"097185c1-9f7e-4e5a-936a-f150a19be403","resolution":{"observed_at":"2026-08-06T16:49:05.168765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:49:04.806124Z","title":"Verstra ¨ete, Extremal problems for cycles in graphs, In Recent trends in combinatorics , Springer, 83–116, 2016","venue":null,"work_id":"5e2e93c5-cb74-4c4c-9e6b-f60058c00b49","year":2016},"citing_paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:04.132022Z"},"links":{"citing_paper":"/paper/2507.12798"},"observation_digest":"sha256:387a495735789123c33f6572c70b172faa7676f726c99f7120ca52e36c08056c","observation_id":"9ab67152-502d-4914-871b-e00aae10a555","resolution":{"observed_at":"2026-08-06T16:49:04.914824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.12798","last_updated":"2025-07-17T05:32:45Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-06T16:35:57.136675Z","submitted_at":"2025-07-17T05:32:45Z","title":"On $2$-connected graphs avoiding cycles of length $0$ modulo $4$"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":5},"total_outbound_references":14},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 2 inbound Pith citation observations for arXiv:2507.12798."}