{"as_of":"2026-08-08T16:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:91e25227d5fdf17f71ad58b4cff4d367808a70a2bb9f249eba9347550466f49f","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:11:56.453211Z","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-03T06:47:43.369333Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.04115","last_updated":"2022-06-08T18:20:21Z","snapshot_observed_at":"2026-07-06T13:18:48.620328Z","submitted_at":"2022-06-08T18:20:21Z","title":"Simplifying Polylogarithms with Machine Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04115","snapshot_observed_at":"2026-08-07T21:11:56.453211Z","title":"Dersy, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09544","last_updated":"2025-02-13T17:58:18Z","snapshot_observed_at":"2026-08-07T23:50:42.071725Z","submitted_at":"2025-02-13T17:58:18Z","title":"Explainable AI-assisted Optimization for Feynman Integral Reduction","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T21:11:56.453211Z"},"links":{"cited_paper":"/paper/2206.04115","citing_paper":"/paper/2502.09544"},"observation_digest":"sha256:e64736650273b435da87dccb4a7ebc955a77f51ac8fcac70b2c776e4112ae630","observation_id":"957eda78-1e01-4d2f-a402-4fa735fd1f58","resolution":{"observed_at":"2026-08-07T21:11:56.453211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04115","last_updated":"2022-06-08T18:20:21Z","snapshot_observed_at":"2026-07-06T13:18:48.620328Z","submitted_at":"2022-06-08T18:20:21Z","title":"Simplifying Polylogarithms with Machine Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04115","snapshot_observed_at":"2026-08-06T14:46:49.676227Z","title":"Dersy, M.D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.17815","last_updated":"2025-07-23T18:00:02Z","snapshot_observed_at":"2026-08-06T16:44:27.568490Z","submitted_at":"2025-07-23T18:00:02Z","title":"Analytic Regression of Feynman Integrals from High-Precision Numerical Sampling","version":1},"reference_index":129,"source":"pdf_text","source_observed_at":"2026-08-06T14:46:49.676227Z"},"links":{"cited_paper":"/paper/2206.04115","citing_paper":"/paper/2507.17815"},"observation_digest":"sha256:f6f4f30b15c241309c17213e373d8566ed5c5ee7ba43957e3942d291cba7f0c2","observation_id":"4bcd7926-f83c-496e-b6ac-015849bd307a","resolution":{"observed_at":"2026-08-06T14:46:49.676227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04115","last_updated":"2022-06-08T18:20:21Z","snapshot_observed_at":"2026-07-06T13:18:48.620328Z","submitted_at":"2022-06-08T18:20:21Z","title":"Simplifying Polylogarithms with Machine Learning","version":1},"cited_work":{"arxiv_id":"2206.04115","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.04115","snapshot_observed_at":"2026-07-03T06:47:43.369333Z","title":"Dersy, M","venue":null,"work_id":"bfcfbfc8-acad-4c23-b28b-a662e2bb9a07","year":2024},"citing_paper":{"arxiv_id":"2603.11164","last_updated":"2026-04-11T19:05:19Z","snapshot_observed_at":"2026-08-02T05:21:25.823147Z","submitted_at":"2026-03-11T18:00:01Z","title":"Learning to Unscramble: Simplifying Symbolic Expressions via Self-Supervised Oracle Trajectories","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-15T12:31:32.917453Z"},"links":{"cited_paper":"/paper/2206.04115","citing_paper":"/paper/2603.11164"},"observation_digest":"sha256:124934c929c0f583f02645a3c07d724015319de573854c534adeb6fefd04c398","observation_id":"f0d20f29-c8db-4340-a596-2318bbe72c0e","resolution":{"observed_at":"2026-05-15T12:35:35.460991Z","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":"2206.04115","last_updated":"2022-06-08T18:20:21Z","snapshot_observed_at":"2026-07-06T13:18:48.620328Z","submitted_at":"2022-06-08T18:20:21Z","title":"Simplifying Polylogarithms with Machine Learning","version":1},"cited_work":{"arxiv_id":"2206.04115","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.04115","snapshot_observed_at":"2026-07-03T06:47:43.369333Z","title":"Dersy, M","venue":null,"work_id":"bfcfbfc8-acad-4c23-b28b-a662e2bb9a07","year":2024},"citing_paper":{"arxiv_id":"2606.10698","last_updated":"2026-06-09T10:59:00Z","snapshot_observed_at":"2026-07-30T08:30:54.384467Z","submitted_at":"2026-06-09T10:59:00Z","title":"Efficient AI-Inspired Reduction of Feynman Integrals via Tube Seeding","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-06-27T12:28:49.796094Z"},"links":{"cited_paper":"/paper/2206.04115","citing_paper":"/paper/2606.10698"},"observation_digest":"sha256:27a5aee7e6eb7dbbb7201c78fd768c0b8865c418bfc82ffbfa790d8cc0801a84","observation_id":"3c02eef1-5b43-40d1-a7ed-300041a5b865","resolution":{"observed_at":"2026-07-03T06:47:43.370644Z","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":"2206.04115","last_updated":"2022-06-08T18:20:21Z","snapshot_observed_at":"2026-07-06T13:18:48.620328Z","submitted_at":"2022-06-08T18:20:21Z","title":"Simplifying Polylogarithms with Machine Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04115","snapshot_observed_at":"2026-07-12T04:50:25.686477Z","title":"Dersy et al.,Simplifying polylogarithms with machine learning,arXiv preprint arXiv:2206.04115(2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03109","last_updated":"2026-07-03T08:45:19Z","snapshot_observed_at":"2026-08-02T11:14:02.207705Z","submitted_at":"2026-07-03T08:45:19Z","title":"Graph Neural Networks for the Graphical Bootstrap","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T04:50:25.686477Z"},"links":{"cited_paper":"/paper/2206.04115","citing_paper":"/paper/2607.03109"},"observation_digest":"sha256:f1e1a9c1bc56c4e15bbefb8afb5c735bdf97c69c1dba095094dd9e4e83771fa5","observation_id":"5183bf97-75f1-4e98-983a-c839702cabd2","resolution":{"observed_at":"2026-07-12T04:50:25.686477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04115","last_updated":"2022-06-08T18:20:21Z","snapshot_observed_at":"2026-07-06T13:18:48.620328Z","submitted_at":"2022-06-08T18:20:21Z","title":"Simplifying Polylogarithms with Machine Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04115","snapshot_observed_at":"2026-08-02T06:16:16.857106Z","title":"Simplifying Polylogarithms with Machine Learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.21629","last_updated":"2026-07-14T16:45:07Z","snapshot_observed_at":"2026-08-06T05:53:01.583463Z","submitted_at":"2026-07-14T16:45:07Z","title":"Scattering Amplitudes as Programs: Self-Evolving Search for Theory and Event Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T06:16:16.857106Z"},"links":{"cited_paper":"/paper/2206.04115","citing_paper":"/paper/2607.21629"},"observation_digest":"sha256:dbb020ec153ee8991de483fc93c56775c3841bdedafaadbdc2feca702a1fd3bf","observation_id":"983c4e52-7fc4-464b-b10e-c99511ab1089","resolution":{"observed_at":"2026-08-02T06:16:16.857106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.04115/citation-record","integrity":"/paper/2206.04115/integrity","json":"/paper/2206.04115/citation-record.json","paper":"/paper/2206.04115"},"outbound":[],"paper":{"arxiv_id":"2206.04115","last_updated":"2022-06-08T18:20:21Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:18:48.620328Z","submitted_at":"2022-06-08T18:20:21Z","title":"Simplifying Polylogarithms with Machine Learning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2206.04115."}