{"as_of":"2026-08-14T16:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee92c6983b2f5d7702902ab32cdc00cb0f63dc836e712f321b261eebf91abe97","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-14T20:50:12.237932Z","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-05-14T20:52:58.896444Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.13820","last_updated":"2024-04-22T01:48:58Z","snapshot_observed_at":"2026-08-13T00:25:04.457642Z","submitted_at":"2024-04-22T01:48:58Z","title":"Prove Symbolic Regression is NP-hard by Symbol Graph","version":1},"cited_work":{"arxiv_id":"2404.13820","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.13820","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prove symbolic regression is NP-hard by symbol graph","venue":null,"work_id":"7e77eb2e-9efe-42d9-8a81-57417c2ee82b","year":2024},"citing_paper":{"arxiv_id":"2605.12704","last_updated":"2026-05-12T20:04:59Z","snapshot_observed_at":"2026-08-12T09:42:07.859918Z","submitted_at":"2026-05-12T20:04:59Z","title":"FePySR: A Neural Feature Extraction Framework for Efficient and Scalable Symbolic Regression","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-14T20:50:12.237932Z"},"links":{"cited_paper":"/paper/2404.13820","citing_paper":"/paper/2605.12704"},"observation_digest":"sha256:ae7a7a1895cb9a3b23c8c226f8afd8c259da875614048b079ff3dd6fe2ee046a","observation_id":"fe202296-6d6e-4e13-93a7-8418a4f244c8","resolution":{"observed_at":"2026-05-14T20:52:58.899429Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.13820/citation-record","integrity":"/paper/2404.13820/integrity","json":"/paper/2404.13820/citation-record.json","paper":"/paper/2404.13820"},"outbound":[],"paper":{"arxiv_id":"2404.13820","last_updated":"2024-04-22T01:48:58Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-13T00:25:04.457642Z","submitted_at":"2024-04-22T01:48:58Z","title":"Prove Symbolic Regression is NP-hard by Symbol Graph"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2404.13820."}