{"as_of":"2026-08-21T09:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:115b3042486f596c1475580fbf570ac805bbbeca336de18afeda7a18c3cd9db2","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:31:51.235533Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T18:17:33.811973Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.10006","last_updated":"2019-09-13T00:06:34Z","snapshot_observed_at":"2026-08-14T16:27:24.753403Z","submitted_at":"2019-05-24T02:42:22Z","title":"Graph Representations for Higher-Order Logic and Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10006","snapshot_observed_at":"2026-08-12T17:31:51.235533Z","title":"CoRR abs/1905.10006 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.15194","last_updated":"2024-11-19T14:15:34Z","snapshot_observed_at":"2026-08-17T00:51:33.967228Z","submitted_at":"2024-11-19T14:15:34Z","title":"Guiding Word Equation Solving using Graph Neural Networks (Extended Technical Report)","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T17:31:51.235533Z"},"links":{"cited_paper":"/paper/1905.10006","citing_paper":"/paper/2411.15194"},"observation_digest":"sha256:a81e1da71fc978e0dd4c92bc2f2d2721d166435bb06acf101f0c860fe016cd40","observation_id":"c435a418-d362-4f5d-ba41-75ee771e6d8e","resolution":{"observed_at":"2026-08-12T17:31:51.235533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10006","last_updated":"2019-09-13T00:06:34Z","snapshot_observed_at":"2026-08-14T16:27:24.753403Z","submitted_at":"2019-05-24T02:42:22Z","title":"Graph Representations for Higher-Order Logic and Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10006","snapshot_observed_at":"2026-08-06T20:18:25.433447Z","title":"Loos, Markus N","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2507.03314","last_updated":"2025-07-04T05:54:27Z","snapshot_observed_at":"2026-08-15T13:42:30.730562Z","submitted_at":"2025-07-04T05:54:27Z","title":"Partial Label Learning for Automated Theorem Proving","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T20:18:25.433447Z"},"links":{"cited_paper":"/paper/1905.10006","citing_paper":"/paper/2507.03314"},"observation_digest":"sha256:c46641f0492d906e368061d15dbbb75ef1fe709fd674d765f4d34389eb0c6c73","observation_id":"0fdf082f-29cc-41b1-b245-86666daeab2b","resolution":{"observed_at":"2026-08-06T20:18:25.433447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10006","last_updated":"2019-09-13T00:06:34Z","snapshot_observed_at":"2026-08-14T16:27:24.753403Z","submitted_at":"2019-05-24T02:42:22Z","title":"Graph Representations for Higher-Order Logic and Theorem Proving","version":2},"cited_work":{"arxiv_id":"1905.10006","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.10006","snapshot_observed_at":"2026-07-10T18:17:33.811973Z","title":"Graph Representations for Higher-Order Logic and Theorem Proving","venue":"cs.LG","work_id":"f1d0b8ea-6a58-481f-aff9-0376ffb528f4","year":2019},"citing_paper":{"arxiv_id":"2607.07779","last_updated":"2026-07-08T17:46:36Z","snapshot_observed_at":"2026-07-12T23:17:59.879344Z","submitted_at":"2026-07-08T17:46:36Z","title":"From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier","version":1},"reference_index":188,"source":"pdf_text","source_observed_at":"2026-07-10T18:16:31.176239Z"},"links":{"cited_paper":"/paper/1905.10006","citing_paper":"/paper/2607.07779"},"observation_digest":"sha256:2a7d31d5135fa382ca79f77985727507d6eb4652b1725a112ae1665f26882957","observation_id":"d9d576c3-8a01-47c4-ae6f-37e48714bfe9","resolution":{"observed_at":"2026-07-10T18:17:33.813252Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1905.10006/citation-record","integrity":"/paper/1905.10006/integrity","json":"/paper/1905.10006/citation-record.json","paper":"/paper/1905.10006"},"outbound":[],"paper":{"arxiv_id":"1905.10006","last_updated":"2019-09-13T00:06:34Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T16:27:24.753403Z","submitted_at":"2019-05-24T02:42:22Z","title":"Graph Representations for Higher-Order Logic and Theorem Proving"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1905.10006."}