{"as_of":"2026-08-18T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:367c642a20dd5b86d003bc5d1714993c678bfb22e94c37c017ba42e6e72da428","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:29:54.682187Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2608.06698/citation-record","integrity":"/paper/2608.06698/integrity","json":"/paper/2608.06698/citation-record.json","paper":"/paper/2608.06698"},"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-10T22:29:54.828990Z","title":null,"venue":null,"work_id":"2a8fd3d6-f78b-4707-83e9-1ae35560cbdd","year":2026},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.640973Z"},"links":{"citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:fb99966b47ffc82c06591131a3e540eee6324a515131b25afa599bf8c45e91ab","observation_id":"4487f141-91f2-41c4-b85a-816af4773b72","resolution":{"observed_at":"2026-08-10T22:29:54.832440Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.02356","last_updated":"2026-06-07T02:34:55Z","snapshot_observed_at":"2026-08-13T05:17:08.939620Z","submitted_at":"2026-06-01T15:03:07Z","title":"On 2-connected graphs without cycles of length 1 modulo 3","version":2},"cited_work":{"arxiv_id":"2606.02356","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.02356","snapshot_observed_at":"2026-08-10T22:29:54.727870Z","title":"On 2-connected graphs without cycles of length 1 modulo 3","venue":"math.CO","work_id":"591f294c-c922-4e9c-b9c2-e0344ab844aa","year":2026},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.644891Z"},"links":{"cited_paper":"/paper/2606.02356","citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:d0692f5fb973deac9d9380c430966860ca7a93bd54640039b64ee6dbebf443a2","observation_id":"a588f3d9-c395-43f5-95b8-5684d6708ca8","resolution":{"observed_at":"2026-08-10T22:29:54.733969Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.03504","last_updated":"2025-03-05T13:50:57Z","snapshot_observed_at":"2026-08-16T12:52:51.338804Z","submitted_at":"2025-03-05T13:50:57Z","title":"On graphs without cycles of length 1 modulo 3","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.03504","snapshot_observed_at":"2026-08-10T22:29:54.648803Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.648803Z"},"links":{"cited_paper":"/paper/2503.03504","citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:15d93f3851323965b5f8f04aebcb726beefed45f3e64a982751aa8df06776d85","observation_id":"e13bb161-90bd-4d59-8d92-7589b7d06261","resolution":{"observed_at":"2026-08-10T22:29:54.648803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:54.819368Z","title":"Bollob´ as, Cycles modulok,Bulletin of the London Mathematical Society9 (1) (1977), 97–98","venue":null,"work_id":"7e4a9f05-bf9d-4dec-b895-d5117e87695f","year":1977},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.652524Z"},"links":{"citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:121ebf4bdc5c05509ef2e4afd9db2a530974235fce99711b786358ba900ca815","observation_id":"5a17f4fa-1354-43dd-a76f-a92209b18807","resolution":{"observed_at":"2026-08-10T22:29:54.823049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:29:54.809866Z","title":"Cai and W","venue":null,"work_id":"3ad0ab4b-4e7c-4afc-a8e5-b7cc40a67699","year":2001},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.656448Z"},"links":{"citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:5391f83d0b7e45103f03c81728066561173fd5466af159e133d9512a1b64bf55","observation_id":"f3e4dddc-a721-4cd9-858c-3a6526148dcc","resolution":{"observed_at":"2026-08-10T22:29:54.813094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:29:54.800716Z","title":"Chen and A","venue":null,"work_id":"b60e5934-2706-433d-835c-112b910e5e28","year":1994},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.659958Z"},"links":{"citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:c86ef9a6e88959685fba413ebc322c25fd4fa11e8ac446a1ca3aaa7057cb26a5","observation_id":"1d40dc53-7aae-4b7b-84cf-73abf6b1008c","resolution":{"observed_at":"2026-08-10T22:29:54.803994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-17T16:31:12.495844Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.12798","snapshot_observed_at":"2026-08-10T22:29:54.663476Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.663476Z"},"links":{"cited_paper":"/paper/2507.12798","citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:544f9bd896dd9cf70a7e37be4ac9a336b5d67fe95b2365128cab9ebae6021f7a","observation_id":"dc2c752f-f612-442e-ab67-9f16c86c9cf2","resolution":{"observed_at":"2026-08-10T22:29:54.663476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:29:54.790890Z","title":"Erd˝ os, Some recent problems and results in graph theory, combinatorics, and num- ber theory,Proc","venue":null,"work_id":"30c1169f-cabf-402d-a5e9-b6630fac272a","year":1976},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.666978Z"},"links":{"citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:a76dc251e56713f5db65cba9e6d32e3dede264d672f9048b9d101800982fc610","observation_id":"ab20486f-f5e6-43cc-bb0a-cfe8d4a60f55","resolution":{"observed_at":"2026-08-10T22:29:54.794800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:29:54.780588Z","title":null,"venue":null,"work_id":"a3b79651-f3a5-4a6c-a711-373171b968df","year":2022},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.670085Z"},"links":{"citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:f0f997cea2436cb76beac4879fa7856a7389c0cbd35310cd496667eae29a927c","observation_id":"3aa0cf95-846e-4d22-b5d0-504fb22bac27","resolution":{"observed_at":"2026-08-10T22:29:54.784024Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:29:54.771456Z","title":null,"venue":null,"work_id":"a3c9a23d-291d-42b2-a073-7f4684cb7af5","year":2024},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.673146Z"},"links":{"citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:90b5fff6fde4fe5fbc5c436af5b197e0e8a8653cf0c489c863c7c16d8504826e","observation_id":"c4a60a72-f573-45ec-b630-f32f7ef78cb1","resolution":{"observed_at":"2026-08-10T22:29:54.774598Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:29:54.761626Z","title":"Gy˝ ori, B","venue":null,"work_id":"7ac12995-4c95-4e61-8a3a-f9c98ea99684","year":2026},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.676250Z"},"links":{"citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:fe75d8a538c962a2da7615d0a727699ae8eca1189eb055c4820be33ed5ede0d3","observation_id":"ea85c884-88c2-45b2-9418-39f257413937","resolution":{"observed_at":"2026-08-10T22:29:54.764787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:29:54.751470Z","title":"Simonovits, Extremal graph problems with symmetrical extremal graphs","venue":null,"work_id":"c3410d35-3606-4cf1-b2aa-f7df5cd131c2","year":1974},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.679260Z"},"links":{"citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:6b179ae3123976656ccf131ff5c2d9b9a74379e1d6aaf61379b6c1c5d6e870ae","observation_id":"0154287b-a286-4b1f-b8ba-8f194875a023","resolution":{"observed_at":"2026-08-10T22:29:54.755169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T22:29:54.741392Z","title":"Sudakov and J","venue":null,"work_id":"929cd4f8-98a9-4bcd-b38a-70ea780c93b6","year":2017},"citing_paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:29:54.682187Z"},"links":{"citing_paper":"/paper/2608.06698"},"observation_digest":"sha256:86150e7c8d90957e59761f609eb6ffd17129ad0d0feeae73e6e07f46e5c96993","observation_id":"c31ace9d-ce25-4741-8f96-29bfc4495622","resolution":{"observed_at":"2026-08-10T22:29:54.744857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.06698","last_updated":"2026-08-07T01:52:08Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T05:22:17.543988Z","submitted_at":"2026-08-07T01:52:08Z","title":"On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":7},"total_outbound_references":13},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2608.06698."}