Pith. sign in

Paper Citation Record · LEDGER

Efficient and Asymptotically Unbiased Constrained Decoding for Large Language Models

As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2504.09135.

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

pith.paper-citation-record.v1
2504.09135 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

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

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T00:11:33.234899Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-10T11:15:10.154966Z

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 f7849806-ecc5-4b6a-9d47-a8d6639e53b3 · inbound

Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators cites this paper.

Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators Efficient and Asymptotically Unbiased Constrained Decoding for Large Language Models

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-02T20:42:44.117497Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T20:42:44.117497Z digest=sha256:fe8bf27b7a193be7b13dd01a7c4075eb3c6ef1902ab39d730c485940178e27f2

Observation 33cd19a7-2567-49ff-a6a8-6f570a5b89c8 · inbound

The Format Tax cites this paper.

The Format Tax Efficient and Asymptotically Unbiased Constrained Decoding for Large Language Models

Reference 22

Resolution
unresolved
no resolver link, observed 2026-07-13T12:48:03.396039Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-13T12:48:03.396039Z digest=sha256:5310da46b7974dc891dddaa5cb73624d7689e09ed2a17fef0b61c1dcc4bba127

Observation f7f4741c-5d46-48c2-8789-a590bcd5b527 · inbound

Schema Key Wording as an Instruction Channel in Structured Generation under Constrained Decoding cites this paper.

Schema Key Wording as an Instruction Channel in Structured Generation under Constrained Decoding Efficient and Asymptotically Unbiased Constrained Decoding for Large Language Models

Reference 22

Resolution
verified exact
arxiv_id, observed 2026-05-10T11:15:10.157707Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-10T11:14:29.764233Z digest=sha256:b7e136b23b01a9958769e558e69d8b1883aa7ba0bd74700273340de6186d725d

Observation 4cfeabbd-18a1-47bf-ba1c-426aa3eae787 · inbound

Trie Automata for Constrained Decoding over Large Finite Sets cites this paper.

Trie Automata for Constrained Decoding over Large Finite Sets Efficient and Asymptotically Unbiased Constrained Decoding for Large Language Models

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-16T00:11:33.234899Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:11:33.234899Z digest=sha256:4c1c574ca4db7b31968f3deb1ef8341cea5759099c887863a80cd2e4b254349b