Pith. sign in

Paper Citation Record · LEDGER

ReGAL: Refactoring Programs to Discover Generalizable Abstractions

As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2401.16467.

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

pith.paper-citation-record.v1
2401.16467 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 9 of 9 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 9 of 9 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T14:32:41.870865Z

measured 1 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

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

External citation measurements

1
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation f8597cc1-fa2f-4bb1-9d95-4a35e18771ef · inbound

A Compute-Matched Re-Evaluation of TroVE on MATH cites this paper.

A Compute-Matched Re-Evaluation of TroVE on MATH ReGAL: Refactoring Programs to Discover Generalizable Abstractions

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-06T17:05:19.225310Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T17:05:19.225310Z digest=sha256:c0d08ff72e8034b1a64f8482335d5442ef897edbbf9f40b5fd243db1a64570b0

Observation 553609ce-fa96-4206-a8a9-6349200fcb33 · inbound

Autark: A Serverless Toolkit for Prototyping Urban Visual Analytics Systems cites this paper.

Autark: A Serverless Toolkit for Prototyping Urban Visual Analytics Systems ReGAL: Refactoring Programs to Discover Generalizable Abstractions

Reference 57

Resolution
verified exact
arxiv_id, observed 2026-05-11T14:11:03.892722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-05-09T23:25:06.889072Z digest=sha256:f75631a5f76679432f8d5292f627c39c97cd208b91dc67af341d6e816ac634e1

Observation 76111945-835c-4727-ac4e-2b489c07648e · inbound

Autark: A Serverless Toolkit for Prototyping Urban Visual Analytics Systems cites this paper.

Autark: A Serverless Toolkit for Prototyping Urban Visual Analytics Systems ReGAL: Refactoring Programs to Discover Generalizable Abstractions

Reference 58

Resolution
verified exact
arxiv_id, observed 2026-05-09T23:29:43.693097Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-05-09T23:25:06.889072Z digest=sha256:20f611c7b54166b47bc832c1f026ae8bdcdf78db145f84a4e20a3c51315f4f39

Observation 02d050cb-b46d-4130-8496-b491bf93fefe · inbound

ReaComp: Compiling LLM Reasoning into Symbolic Solvers for Efficient Program Synthesis cites this paper.

ReaComp: Compiling LLM Reasoning into Symbolic Solvers for Efficient Program Synthesis ReGAL: Refactoring Programs to Discover Generalizable Abstractions

Reference 9

Resolution
verified exact
arxiv_id, observed 2026-05-11T18:21:09.019307Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-05-08T16:13:09.447000Z digest=sha256:225bfdccb13d02e551b965a8dae9f5c5e4e2fa4934bc43064fbb69841edd2d3a

Observation a71a6710-b92f-4ae6-888a-a4a258a18e4b · inbound

PYTHALAB-MERA: Validation-Grounded Memory, Retrieval, and Acceptance Control for Frozen-LLM Coding Agents cites this paper.

PYTHALAB-MERA: Validation-Grounded Memory, Retrieval, and Acceptance Control for Frozen-LLM Coding Agents ReGAL: Refactoring Programs to Discover Generalizable Abstractions

Reference 58

Resolution
verified exact
arxiv_id, observed 2026-05-12T08:26:23.038371Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-05-12T01:12:37.970638Z digest=sha256:b18337b3bae3ca1e39e385f3a5d27138ab9f90a16912359dac2f8fc6355daa82

Observation 80b07c8c-0477-4696-8562-e5730446168e · inbound

XSearch: Explainable Code Search via Concept-to-Code Alignment cites this paper.

XSearch: Explainable Code Search via Concept-to-Code Alignment ReGAL: Refactoring Programs to Discover Generalizable Abstractions

Reference 73

Resolution
verified exact
arxiv_id, observed 2026-05-20T16:33:34.054734Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-05-20T16:31:27.989614Z digest=sha256:10d911a6091eb013adb115b923453f55c91705737dd6f98971a48574767d46df

Observation 6b951fb3-df08-48e1-8ac2-eb1590ba0c54 · inbound

XSearch: Explainable Code Search via Concept-to-Code Alignment cites this paper.

XSearch: Explainable Code Search via Concept-to-Code Alignment ReGAL: Refactoring Programs to Discover Generalizable Abstractions

Reference 73

Resolution
verified exact
arxiv_id, observed 2026-07-04T00:59:18.937487Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-07-04T00:55:50.772103Z digest=sha256:33a3e7d86202e473d9ef22c24e150b56efc43b31f8a4336ea08e7423de3ef1d2

Observation 5bc5e9f2-f0e4-445c-98a2-8a7b14900422 · inbound

PACE: Primitive-Aware Code Evolution for Automated Algorithm Design cites this paper.

PACE: Primitive-Aware Code Evolution for Automated Algorithm Design ReGAL: Refactoring Programs to Discover Generalizable Abstractions

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-15T14:32:41.870865Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T14:32:41.870865Z digest=sha256:c97b367ccaf1b29ba2adf1640f1f6de21316f0b6b2560840b6a39d3e5702d473

Observation bdf2e2c6-595d-4173-8673-57103881a41d · inbound

Better, Faster, Stronger: Programmatic Skill Learning Best Reduces Agent Cost cites this paper.

Better, Faster, Stronger: Programmatic Skill Learning Best Reduces Agent Cost ReGAL: Refactoring Programs to Discover Generalizable Abstractions

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-15T14:18:10.656502Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T14:18:10.656502Z digest=sha256:c6f0eceb5c739789e045271cede0529aa56294d1d6510d15a760cfc638f19414