{"as_of":"2026-08-04T14:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:28ddb730346b408e5a90a216a3e2de5e1ceb813980705627892c780cc5223d55","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":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-04T06:34:03.388597+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:12:31.824874Z","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-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":"2205.11491","doi":"10.48550/arxiv.2205.11491","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"b42747bd-615d-4195-9d85-772ff3605648","year":2022},"citing_paper":{"arxiv_id":"2310.10631","last_updated":"2024-03-15T19:14:39Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-16T17:54:07Z","title":"Llemma: An Open Language Model For Mathematics","version":3},"reference_index":156,"source":"arxiv_source","source_observed_at":"2026-05-19T08:17:46.055279Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2310.10631"},"observation_digest":"sha256:7603720ecd4784026e88713717a74e0eafc22e9a14f0a13528dddb923746a64d","observation_id":"481aee27-24ff-4762-9c53-4559105cbd0d","resolution":{"observed_at":"2026-05-19T08:17:46.508812Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":"2205.11491","doi":"10.48550/arxiv.2205.11491","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"b42747bd-615d-4195-9d85-772ff3605648","year":2022},"citing_paper":{"arxiv_id":"2502.02871","last_updated":"2026-04-20T02:18:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-05T04:05:27Z","title":"Position: Multimodal Large Language Models Can Significantly Advance Scientific Reasoning","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-05-23T04:30:38.804702Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2502.02871"},"observation_digest":"sha256:c1a16aed51134d572be6e5043ad976119b59b9d51d1622ed84a2fda928e6e494","observation_id":"88246db0-327e-43a1-aa80-9be78228b285","resolution":{"observed_at":"2026-05-23T04:32:33.302414Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-08-04T00:12:31.824874Z","title":"Hypertree proof search for neural theorem proving, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.02603","last_updated":"2026-06-09T02:34:12Z","snapshot_observed_at":"2026-08-04T00:12:30.500316Z","submitted_at":"2025-11-04T14:25:54Z","title":"CGES: Confidence-Guided Early Stopping for Efficient and Accurate Self-Consistency","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T00:12:31.824874Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2511.02603"},"observation_digest":"sha256:74f5f512252fee31f98d7c8f13fff2c63b02a04e3fbbeab82b72b906351abdf2","observation_id":"249d68c1-cacc-4ae2-821c-17689349c4ee","resolution":{"observed_at":"2026-08-04T00:12:31.824874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":"2205.11491","doi":"10.48550/arxiv.2205.11491","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"b42747bd-615d-4195-9d85-772ff3605648","year":2022},"citing_paper":{"arxiv_id":"2602.24273","last_updated":"2026-05-14T16:23:55Z","snapshot_observed_at":"2026-08-02T04:41:42.758635Z","submitted_at":"2026-02-27T18:43:47Z","title":"A Minimal Agent for Automated Theorem Proving","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-15T18:44:35.600033Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2602.24273"},"observation_digest":"sha256:06496debccb5155501d92faa5f742852db7d2bb24b2fd0c7d0f299b8feab6c5e","observation_id":"4d1e714f-a617-4f06-a6b8-613ec7d69ddb","resolution":{"observed_at":"2026-05-15T18:46:28.970896Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":"2205.11491","doi":"10.48550/arxiv.2205.11491","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"b42747bd-615d-4195-9d85-772ff3605648","year":2022},"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":11,"source":"pdf_text","source_observed_at":"2026-05-15T12:31:32.917453Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2603.11164"},"observation_digest":"sha256:d1c81b82e5524f84668e5f1b735d63f0c5c8367abafa7af006ae1a0bfbc1fa6e","observation_id":"84019802-974e-4a28-bcf3-2370bcec0e04","resolution":{"observed_at":"2026-05-15T12:35:35.475775Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":"2205.11491","doi":"10.48550/arxiv.2205.11491","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"b42747bd-615d-4195-9d85-772ff3605648","year":2022},"citing_paper":{"arxiv_id":"2605.06690","last_updated":"2026-05-02T07:40:09Z","snapshot_observed_at":"2026-07-06T23:19:05.764765Z","submitted_at":"2026-05-02T07:40:09Z","title":"State Representation and Termination for Recursive Reasoning Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-11T01:07:19.199344Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2605.06690"},"observation_digest":"sha256:81b87650f0cba5cce2be6316a12a4918d6353bc7d72d90268fb9006383093ece","observation_id":"40005ec3-48f8-4cae-85bf-46a5d8b5f494","resolution":{"observed_at":"2026-05-11T04:45:56.682035Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":"2205.11491","doi":"10.48550/arxiv.2205.11491","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"b42747bd-615d-4195-9d85-772ff3605648","year":2022},"citing_paper":{"arxiv_id":"2605.27485","last_updated":"2026-05-26T14:50:47Z","snapshot_observed_at":"2026-08-02T13:15:11.614769Z","submitted_at":"2026-05-26T14:50:47Z","title":"Automating Formal Verification with Agent-Guided Tree Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T14:54:59.333847Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2605.27485"},"observation_digest":"sha256:d2d0e60564a87ddd8cd45631b37ff13f9c99fe6810d6b9e6e1f53333ed02b12c","observation_id":"cf8b04fc-92d4-408e-beea-81db67d80a1b","resolution":{"observed_at":"2026-06-29T15:03:31.416564Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":"2205.11491","doi":"10.48550/arxiv.2205.11491","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"b42747bd-615d-4195-9d85-772ff3605648","year":2022},"citing_paper":{"arxiv_id":"2605.30914","last_updated":"2026-05-29T06:59:28Z","snapshot_observed_at":"2026-08-04T08:48:12.582835Z","submitted_at":"2026-05-29T06:59:28Z","title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-28T23:52:36.891080Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2605.30914"},"observation_digest":"sha256:be15e05b267139840b7950ab3c1dbebc9a7707d25f8638591d895e2cf99668e0","observation_id":"15d274d3-e76f-49c5-963a-8cf8de18421d","resolution":{"observed_at":"2026-06-28T23:52:49.225979Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":"2205.11491","doi":"10.48550/arxiv.2205.11491","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"b42747bd-615d-4195-9d85-772ff3605648","year":2022},"citing_paper":{"arxiv_id":"2606.05400","last_updated":"2026-06-03T20:09:39Z","snapshot_observed_at":"2026-08-02T19:19:40.682112Z","submitted_at":"2026-06-03T20:09:39Z","title":"LeanMarathon: Toward Reliable AI Co-Mathematicians through Long-Horizon Lean Autoformalization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T05:48:56.691155Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2606.05400"},"observation_digest":"sha256:56362d1d9b3758ede20051a0975bc6cfd2a86303d532fb6a50baa2acadf68e8e","observation_id":"8dd57796-1a04-42eb-b66f-7885b12a2b09","resolution":{"observed_at":"2026-07-02T08:36:48.764451Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":"2205.11491","doi":"10.48550/arxiv.2205.11491","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"b42747bd-615d-4195-9d85-772ff3605648","year":2022},"citing_paper":{"arxiv_id":"2606.09450","last_updated":"2026-06-08T12:57:18Z","snapshot_observed_at":"2026-08-02T11:29:46.747086Z","submitted_at":"2026-06-08T12:57:18Z","title":"TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T16:19:11.123994Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2606.09450"},"observation_digest":"sha256:5988e5d3172cdc6362500a3dfa4b1ddd2ca01feb439a71b0a4467e4d97f402e2","observation_id":"8093a9e1-0567-4f5e-8f07-e61eb565a877","resolution":{"observed_at":"2026-07-03T01:47:31.576511Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":"2205.11491","doi":"10.48550/arxiv.2205.11491","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hypertree proof search for neural theorem proving","venue":null,"work_id":"b42747bd-615d-4195-9d85-772ff3605648","year":2022},"citing_paper":{"arxiv_id":"2607.02390","last_updated":"2026-07-02T16:25:10Z","snapshot_observed_at":"2026-08-03T00:49:51.748486Z","submitted_at":"2026-07-02T16:25:10Z","title":"DecompRL: Solving Harder Problems by Learning Modular Code Generation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-03T16:30:34.793328Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2607.02390"},"observation_digest":"sha256:3ff8ecfffc84193e13834140df2b9ca3024bf6a55dea688a0cacad94a6ef77b9","observation_id":"ad14c7bf-624a-4a6d-8e20-2b388d635640","resolution":{"observed_at":"2026-07-03T16:38:39.512617Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-07-14T02:43:21.225324Z","title":"HyperTree Proof Search for neural theorem proving.CoRR, abs/2205.11491, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11849","last_updated":"2026-07-13T17:38:22Z","snapshot_observed_at":"2026-07-16T23:20:03.329744Z","submitted_at":"2026-07-13T17:38:22Z","title":"AdvancedMathBench: A Benchmark Suite for Advanced Mathematical Proof Generation and Verification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T02:43:21.225324Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2607.11849"},"observation_digest":"sha256:c2fd00b55aa8ff37dc524c85ef0d772aa7f639078ffaac8151038d4218463239","observation_id":"3c85bf8b-f867-44b4-9403-75efee204b38","resolution":{"observed_at":"2026-07-14T02:43:21.225324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11491","snapshot_observed_at":"2026-08-01T04:33:59.268066Z","title":"HyperTree proof search for neural theorem proving.arXiv preprint arXiv:2205.11491, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22511","last_updated":"2026-07-24T17:32:35Z","snapshot_observed_at":"2026-08-04T14:17:18.964747Z","submitted_at":"2026-07-24T17:32:35Z","title":"CausalForge: A Formally Grounded, Self-Improving Agentic Framework for Automated Research in Causal Inference","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T04:33:59.268066Z"},"links":{"cited_paper":"/paper/2205.11491","citing_paper":"/paper/2607.22511"},"observation_digest":"sha256:9e0b207a0c380ee285e63023ed94d88e2e0875e82e85dc924e76bca682e7573d","observation_id":"4d75af8d-bf1a-41a3-ba05-bc86c68d9584","resolution":{"observed_at":"2026-08-01T04:33:59.268066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2205.11491/citation-record","integrity":"/paper/2205.11491/integrity","json":"/paper/2205.11491/citation-record.json","paper":"/paper/2205.11491"},"outbound":[],"paper":{"arxiv_id":"2205.11491","last_updated":"2022-05-23T17:49:55Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:49:55Z","title":"HyperTree Proof Search for Neural 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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2205.11491."}