{"as_of":"2026-08-22T14:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bd9e4f9e2a43c4284141eb7fb2355bd772a73f56f487da27f29690f564363d0f","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:45:06.440571Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2505.17964/citation-record","integrity":"/paper/2505.17964/integrity","json":"/paper/2505.17964/citation-record.json","paper":"/paper/2505.17964"},"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-07T14:45:12.227746Z","title":"Global lyapunov func- tions: A long-standing open problem in mathematics with symbolic transformers","venue":null,"work_id":"41310023-a39a-43ac-a9c4-7de35aa67142","year":2024},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.039479Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:4bfdcca95753ce71720fe47a4f0bc06bcf42dde63870dbcea0f08d156daea2f7","observation_id":"5af69c07-fdee-4103-9a2c-eabe4d7c2677","resolution":{"observed_at":"2026-08-07T14:45:12.316684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:12.048582Z","title":"Bondy and U.S.R","venue":null,"work_id":"8be92613-8821-4ad1-88b7-6480e2290b32","year":1991},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.117078Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:0f644c7af24d9128c7f839818e0c761e10b2561b297f192079ad106f45d6665f","observation_id":"bb862214-d33c-4a56-9916-2de96807d769","resolution":{"observed_at":"2026-08-07T14:45:12.147862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:11.839992Z","title":"Language models are few-shot learners","venue":null,"work_id":"f303ff35-9e82-48f0-8eda-d09b6dfa9475","year":1901},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.208754Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:aba8701fee3c2e6edceeaedd3c070bcbfce5bc809febaf52cdc52c14196f6655","observation_id":"7754683c-b535-4fff-a45d-2b03f5124c13","resolution":{"observed_at":"2026-08-07T14:45:11.933996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:11.587460Z","title":"Chang and H.L","venue":null,"work_id":"bb099c73-5856-4e10-98c1-5aede4d9a21e","year":2003},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.329227Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:e475a897ab4845a94c4f24754911bdde8958cbbc21b7bfe116e51cae20f9e8b1","observation_id":"741e4cdd-b2c7-493b-87ba-1376f1895a30","resolution":{"observed_at":"2026-08-07T14:45:11.750524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:11.341430Z","title":"Advancing mathematics by guiding human intuition with AI.Nature, 600(7887):70–74, 2021","venue":null,"work_id":"089f11ef-a563-454a-9bf6-0c3b4b1d5007","year":2021},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.436594Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:442e66d6a13441fff14f67a9ffb69d5ddc079add5443fd040f13a110116fa9be","observation_id":"77bcf2f1-0572-4733-a47d-e82a2ad16893","resolution":{"observed_at":"2026-08-07T14:45:11.414644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:11.267109Z","title":"Patti, Jayson Lynch, Avi Shporer, Nakul Verma, Eugene Wu, and Gilbert Strang","venue":null,"work_id":"a0a5010d-34e1-4cbe-9766-868545fe32ff","year":2022},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.540469Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:1bf6b8e02cace2984665d5cf5e9944fbb1a7ab67ff125e56b6b86997c1aa877e","observation_id":"9ac9ea3b-3dff-4bb6-8dbe-7cd5b62bef81","resolution":{"observed_at":"2026-08-07T14:45:11.332285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:11.081386Z","title":"Token-hungry, yet precise: Deepseek r1 highlights the need for multi-step reasoning over speed in math.ArXiv, 2024","venue":null,"work_id":"cd11b552-3a68-4c38-8b8a-5c4c90f04e64","year":2024},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.633202Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:925e2bf2ce0f0e42696d3be88d8ad3980b34250ee5bcb6aa17eade58ddb2cbe6","observation_id":"89e4b70c-76da-4aa2-8100-0d482c5b3b03","resolution":{"observed_at":"2026-08-07T14:45:11.138648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.00862","last_updated":"2017-10-16T04:57:52Z","snapshot_observed_at":"2026-08-18T16:10:06.638649Z","submitted_at":"2017-10-02T18:39:20Z","title":"Testing for Global Network Structure Using Small Subgraph Statistics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.00862","snapshot_observed_at":"2026-08-07T14:45:03.759449Z","title":"Testing for global network structure using small subgraph statistics.arXiv preprint arXiv:1710.00862, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.759449Z"},"links":{"cited_paper":"/paper/1710.00862","citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:86a8362f75d0737d4d451278101fc68c7e2a5a84f47cad73c0b7335c051f27a6","observation_id":"56d129ae-a7db-4c7b-8453-5b371e3004b7","resolution":{"observed_at":"2026-08-07T14:45:03.759449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T14:45:03.860896Z","title":"Deepseek-r1: Incen- tivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.860896Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:2075efd245e52646b32366deb7d5d39a7e4565fc71d52b88ecb9206973439d57","observation_id":"42261b2a-deb4-4789-8e14-deeab6bba75e","resolution":{"observed_at":"2026-08-07T14:45:03.860896Z","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-07T14:45:10.877060Z","title":"Harary.Graph Theory","venue":null,"work_id":"27fa0899-2cd4-4ec1-9f12-0033f9067245","year":1969},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:03.975527Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:aadeec2d860620220901db3759129e0ae962635daca364f5645220c37cd6e6bd","observation_id":"abbe76c0-0399-4816-a98b-82a728ac5124","resolution":{"observed_at":"2026-08-07T14:45:10.954994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:10.667402Z","title":"On the number of cycles in a graph.Matem- aticky casopis, 21(1):55–63, 1971","venue":null,"work_id":"a9761fd5-1434-411b-9a64-f36416939342","year":1971},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:04.106087Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:36a9a0c9054f09b87169ed59321e723b8f9022f4ce96498cc7e2b26fddd7d807","observation_id":"f24f65ec-b367-4fbf-885e-0956a1d1b438","resolution":{"observed_at":"2026-08-07T14:45:10.767174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:10.434451Z","title":"Measuring mathematical problem solving with the MATH dataset","venue":null,"work_id":"626227b5-90d5-42b3-a3b3-6bf64d38a8fe","year":2021},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:04.285721Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:f798355a1b33939967cedc56715764e0eb607c27ace957a818ba2bd651622de2","observation_id":"ff1880b4-bee1-43ec-bb78-50c590adc44b","resolution":{"observed_at":"2026-08-07T14:45:10.562463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:10.192911Z","title":"Optimal adaptivity of signed- polygon statistics for network testing.The Annals of Statistics, 49(6):3408–3433, 2021","venue":null,"work_id":"ac12ffd9-236e-40c0-9827-c49f27a73dba","year":2021},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:04.439475Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:cbe99bb1757b7beb5519a599c008cbe57fab61b8cb898db5a1889828a4228504","observation_id":"f0c71eea-4022-4cec-b278-0698fca3cce6","resolution":{"observed_at":"2026-08-07T14:45:10.296409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:09.963073Z","title":"Optimal estimation of the number of network communities.Journal of the American Statistical Association, 118(543):2101–2116, 2023","venue":null,"work_id":"f6571829-b591-412c-a75f-f2d69c0cc5f3","year":2023},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:04.566519Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:33592061949827c21fbb5b783deb77177bf78cf9cb3e12dfae9c2f311fc22e94","observation_id":"df5835af-39a5-4ce3-a195-144f5140569a","resolution":{"observed_at":"2026-08-07T14:45:10.072903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:09.727174Z","title":"Network goodness-of-fit for the block-model family.Journal of the American Statistical Association, pages 1–27, 2025","venue":null,"work_id":"1ca946b5-87f6-404d-b386-19df4bccf93e","year":2025},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:04.719953Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:e6446720b7be83d518027e49c8588e52abba8fa0bfaba157224f31880b342315","observation_id":"3c358178-70b8-4aa6-8f10-c0dd075fca53","resolution":{"observed_at":"2026-08-07T14:45:09.851331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:09.448405Z","title":"Spectrum estimation from samples.The Annals of Statistics, 45(6):2218–2247, 2017","venue":null,"work_id":"730986d8-a4a7-434d-85b2-48ca703e235d","year":2017},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:04.898972Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:5e7e53a0efae7d38f60f4ea504eed2205a1637781f7f42a5c87ba88ef8e9c5d0","observation_id":"2254b7bd-7aed-4341-adbe-e84be5ad59c2","resolution":{"observed_at":"2026-08-07T14:45:09.588854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:09.115913Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"7d4e3c84-7462-4357-9732-a7e66edfcead","year":2022},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:05.066254Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:4cc0c06f54ed8abd3a6e0d2f6c8542f09dfdec958b1f0f990e5c55578969cded","observation_id":"5a4ca4a2-2970-41c1-aefa-d46c7829fa5b","resolution":{"observed_at":"2026-08-07T14:45:09.275679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:08.863155Z","title":"Two sample tests for high-dimensional covariance matrices.The Annals of Statistics, 40(2):908–940, 2012","venue":null,"work_id":"45f75344-3b06-4135-bb42-ebc04ccaf028","year":2012},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:05.208797Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:eec59c4d904c3a7696ebdef9e23d6d80702c2a5e8e7567c81e236dc33adf9147","observation_id":"005f97dc-a65f-4a8b-a1a1-c5634e5ec676","resolution":{"observed_at":"2026-08-07T14:45:08.980219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:08.628049Z","title":"On the number of cycles in a graph","venue":null,"work_id":"f5b0615b-a157-485b-beff-b9e6a2e2c067","year":2016},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:05.421157Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:b98e610d9ee4e817c75dcd68fbed5bf9c052cdb10dd4b72512387c78788fb573","observation_id":"8fc51f7d-2a58-43e9-ba9f-2ae920350778","resolution":{"observed_at":"2026-08-07T14:45:08.735736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:08.371422Z","title":"The number of fixed length cycles in an undirected graph","venue":null,"work_id":"eee06c34-a8ba-49fe-8d4f-a14b38e52a51","year":2009},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:05.612700Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:a83da29836c785045279658da0cc540dd9b8cba4ad7b83bb9b15664be97426f0","observation_id":"6d736cf8-5850-459c-89d3-586dbb331fb3","resolution":{"observed_at":"2026-08-07T14:45:08.487085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:08.097211Z","title":"Pawan Kumar, Emilien Dupont, Francisco J","venue":null,"work_id":"94b19aa0-e03b-447c-a471-098f319b85bb","year":2024},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:05.758125Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:7cbe8a475155457f83ce442aecd295974690d1caced17fc54eced44a9f9d124a","observation_id":"b2eefb41-9823-4e02-8694-e842feed3bdd","resolution":{"observed_at":"2026-08-07T14:45:08.221886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:07.721897Z","title":"Stanley.Enumerative Combinatorics","venue":null,"work_id":"ef42787c-e81c-46b3-b7ca-136b8a2d1d33","year":2011},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:05.941343Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:cdbdee81c12ca8d80844b2385e58f8b00e46a05bdfcf57f19a5de2c51888c67c","observation_id":"4d1974db-4275-44cc-a068-4e719f893505","resolution":{"observed_at":"2026-08-07T14:45:07.917976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:07.437273Z","title":"Trinh andet al","venue":null,"work_id":"70c9a35e-7693-4be5-ab20-c0723769c084","year":2024},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:06.093876Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:b73aa442d322fd834fb88cdc0fd610e5c2df1e95c425384fc880d6117ea71575","observation_id":"0eeab453-e831-4282-a8d2-c6619370a5bc","resolution":{"observed_at":"2026-08-07T14:45:07.568035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:07.016406Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":"c660426d-e069-4bed-8dc8-6f06df8f4e44","year":2022},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:06.275902Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:1374b4a3af02ff7703d4467bd66fc7739b550e672cf201b0979f18b0a6189174","observation_id":"cc8c55c7-1408-4d20-81b4-81ceb4a196e3","resolution":{"observed_at":"2026-08-07T14:45:07.213164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:45:06.704877Z","title":"miniF2F: A cross-system benchmark for formal olympiad-level mathematics","venue":null,"work_id":"7e1b0797-3540-46be-a0aa-a4d20aa818eb","year":2022},"citing_paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:45:06.440571Z"},"links":{"citing_paper":"/paper/2505.17964"},"observation_digest":"sha256:cc7d57af740d860336d58ebc98e4a81c8454f987611a3607b770ef915e539e4f","observation_id":"b3f68aa6-b596-46dc-afe4-28dedd409256","resolution":{"observed_at":"2026-08-07T14:45:06.849790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.17964","last_updated":"2026-07-19T19:34:21Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-18T16:10:36.680423Z","submitted_at":"2025-05-23T14:34:40Z","title":"Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":25},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2505.17964."}