Pith. sign in

Paper Citation Record · LEDGER

Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2305.16366.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2305.16366 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 6 of 6 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 6 of 6 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T12:35:20.514785Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-01T09:45:40.447075Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation d5d0b85c-113d-4e43-af5d-28c0403b0ff5 · inbound

Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations cites this paper.

Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-07T12:35:20.514785Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:35:20.514785Z digest=sha256:b8837fedac03c8eae7c01a5352db3e16992255fd05080cc729679c1b369b82fb

Observation e07071c2-82e2-49eb-869d-280508153009 · inbound

Mathesis: Towards Formal Theorem Proving from Natural Languages cites this paper.

Mathesis: Towards Formal Theorem Proving from Natural Languages Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-07T05:50:37.459534Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T05:50:37.459534Z digest=sha256:6bb3024d2cb5db466714acd67e4c095f841623e81dd461cdcd1f56f5fcfc590e

Observation 90ef68e1-a456-4782-9e50-1ecb7d962ed0 · inbound

Solving Formal Math Problems by Decomposition and Iterative Reflection cites this paper.

Solving Formal Math Problems by Decomposition and Iterative Reflection Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving

Reference 55

Resolution
unresolved
no resolver link, observed 2026-08-06T15:42:09.772568Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T15:42:09.772568Z digest=sha256:84700bf6c7aa9737639641ed1010be86514b185de6e73681a1af1c78bfe97031

Observation a4bb4ad3-cd92-4155-8927-362760e4f1a6 · inbound

FormaRL: Enhancing Autoformalization with no Labeled Data cites this paper.

FormaRL: Enhancing Autoformalization with no Labeled Data Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-05T16:11:23.282888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T16:11:23.282888Z digest=sha256:e6fd04dac3644eb79880c4705e8c22ff77bfb17c3bcd0e3909a73981cdc36adc

Observation 2ce60bed-b1c9-4b0f-8c05-20227f33e069 · inbound

Less Effort, Shorter Proofs: Reinforcement Learning for Security Protocol Analysis in Tamarin cites this paper.

Less Effort, Shorter Proofs: Reinforcement Learning for Security Protocol Analysis in Tamarin Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving

Reference 49

Resolution
verified exact
arxiv_id, observed 2026-05-25T04:10:19.421794Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-05-25T04:09:10.588205Z digest=sha256:270c183a61bd04b4e529e038c7b68c3e181b07b65caf3bab676c29972ea7ce3b

Observation 63093732-3028-407c-9823-41cbbb51c0c8 · inbound

Knowledge Distillation from Large Reasoning Models to Compact Student Models: A Case Study on the John O Bryan Mathematics Competition cites this paper.

Knowledge Distillation from Large Reasoning Models to Compact Student Models: A Case Study on the John O Bryan Mathematics Competition Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-07-01T09:45:40.448656Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-07-01T06:12:33.386915Z digest=sha256:ac39fdf794ea756e735cda56da5da37fb5f994376ffd8fbf98e3314aa2110c07