{"as_of":"2026-08-18T23:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20ef3f3f8180216018fd64529a4c7df8b77f722a39c39633ad51d3da859731f5","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:52:01.528559Z","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-03T21:18:58.020417Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-08-11T05:56:02.076389Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.17018","last_updated":"2025-06-03T04:11:32Z","snapshot_observed_at":"2026-08-18T07:20:17.048563Z","submitted_at":"2024-12-22T13:47:46Z","title":"GAS: Generative Auto-bidding with Post-training Search","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T05:56:02.076389Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2412.17018"},"observation_digest":"sha256:b996aa4745365c50b16c3b76571ba260fa70031d9b87f39693d014077a41709c","observation_id":"cc6d86f0-6e8c-4cab-bae7-aa12ec358948","resolution":{"observed_at":"2026-08-11T05:56:02.076389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-08-08T22:31:18.517650Z","title":"Cascade reward sampling for efficient decoding-time alignment","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04517","last_updated":"2025-07-07T02:26:24Z","snapshot_observed_at":"2026-08-11T21:47:57.647615Z","submitted_at":"2025-02-06T21:36:44Z","title":"Towards Cost-Effective Reward Guided Text Generation","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T22:31:18.517650Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2502.04517"},"observation_digest":"sha256:93cfa135afa8b7fb6ac2d2266e8bf102acaac52ba24d54d0ed1d9e19b8fd6791","observation_id":"49c8c75d-139c-4ae6-9083-4241e8858954","resolution":{"observed_at":"2026-08-08T22:31:18.517650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-08-15T23:52:01.528559Z","title":"Cascade reward sampling for efficient decoding-time alignment.arXiv preprint arXiv:2406.16306,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.06274","last_updated":"2025-05-06T15:42:31Z","snapshot_observed_at":"2026-08-18T19:03:01.287649Z","submitted_at":"2025-05-06T15:42:31Z","title":"PARM: Multi-Objective Test-Time Alignment via Preference-Aware Autoregressive Reward Model","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:52:01.528559Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2505.06274"},"observation_digest":"sha256:342900a51ee5c458e3990dcb3ecf02ee8bac5235363bcd3d2e528daf9f774f56","observation_id":"294b4d03-0e8c-40eb-be91-3d0b51fdc0a0","resolution":{"observed_at":"2026-08-15T23:52:01.528559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-08-07T05:41:59.798320Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07434","last_updated":"2025-06-09T05:21:22Z","snapshot_observed_at":"2026-08-18T11:04:22.294770Z","submitted_at":"2025-06-09T05:21:22Z","title":"Well Begun is Half Done: Low-resource Preference Alignment by Weak-to-Strong Decoding","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:41:59.798320Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2506.07434"},"observation_digest":"sha256:969577e3823601063a2583cf50e5a9c4561b7c570ffb61d76b1f59fb7e9a30c1","observation_id":"b0ca6ada-dfb6-47b6-8910-fc9d13ec4de4","resolution":{"observed_at":"2026-08-07T05:41:59.798320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-08-15T19:08:14.383059Z","title":"Cascade reward sampling for efficient decoding-time alignment.arXiv preprint arXiv:2406.16306, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17828","last_updated":"2025-07-03T05:12:51Z","snapshot_observed_at":"2026-08-18T11:12:16.166349Z","submitted_at":"2025-06-21T21:49:02Z","title":"Aligning Frozen LLMs by Reinforcement Learning: An Iterative Reweight-then-Optimize Approach","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T19:08:14.383059Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2506.17828"},"observation_digest":"sha256:1e7bd7e0d225b654317d523c99a8d60af2caf09b262f8a1c5f4c21e4279cc1ad","observation_id":"c418a9ce-776a-47e1-9aec-d7e8708e6590","resolution":{"observed_at":"2026-08-15T19:08:14.383059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-08-05T21:18:43.127270Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.09016","last_updated":"2025-09-10T05:08:47Z","snapshot_observed_at":"2026-08-09T06:48:43.608452Z","submitted_at":"2025-08-12T15:30:44Z","title":"A Survey on Training-free Alignment of Large Language Models","version":4},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:43.127270Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2508.09016"},"observation_digest":"sha256:b655375037e671d9ebfaa0e145f356ef881240f78603fa5f89b8fc80ae7f9266","observation_id":"62c9e407-df19-4acd-a17f-b68465c7fbc0","resolution":{"observed_at":"2026-08-05T21:18:43.127270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-08-04T13:15:44.323192Z","title":"Cascade reward sampling for efficient decoding-time alignment","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.01167","last_updated":"2026-05-30T06:40:26Z","snapshot_observed_at":"2026-08-14T18:05:24.054010Z","submitted_at":"2025-10-01T17:54:15Z","title":"Simultaneous Multi-objective Alignment Across Verifiable and Non-verifiable Rewards","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T13:15:44.323192Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2510.01167"},"observation_digest":"sha256:5b487ed1ff3cf602bd98642e4c7fdc5f9d7d73ce1e606e39c10dde94a2f5441b","observation_id":"48a19fec-95b3-4543-87ab-9fb66f07a8c8","resolution":{"observed_at":"2026-08-04T13:15:44.323192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-08-04T07:23:56.545588Z","title":"Cascade reward sam- pling for efficient decoding-time alignment.arXiv preprint arXiv:2406.16306, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.26219","last_updated":"2026-06-03T00:59:51Z","snapshot_observed_at":"2026-08-11T21:49:14.891388Z","submitted_at":"2025-10-30T07:52:14Z","title":"Test-time reward-guided alignment of language models by importance sampling on pre-logit space","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-04T07:23:56.545588Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2510.26219"},"observation_digest":"sha256:532f5d7d1a29fdae3f241da6a1e03a16c3643e981e9f300e020950ada99e0565","observation_id":"001a68b9-b1f8-48bb-978c-6db05d923765","resolution":{"observed_at":"2026-08-04T07:23:56.545588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":"2406.16306","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-07-03T21:18:58.020417Z","title":"Cascade reward sampling for efficient decoding-time alignment","venue":null,"work_id":"100073a7-bf02-401d-82f9-16f92803ceb8","year":2024},"citing_paper":{"arxiv_id":"2605.13875","last_updated":"2026-05-08T06:56:35Z","snapshot_observed_at":"2026-08-02T22:27:33.584660Z","submitted_at":"2026-05-08T06:56:35Z","title":"Common-agency Games for Multi-Objective Test-Time Alignment","version":1},"reference_index":208,"source":"arxiv_source","source_observed_at":"2026-05-15T06:14:53.685486Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2605.13875"},"observation_digest":"sha256:3fed01fc2af004ef7754211e0daf27260c137cfd2bf4e7509ec0916097442bd6","observation_id":"d176487c-b34d-4627-a9d1-497da2ae4148","resolution":{"observed_at":"2026-05-15T06:15:06.574422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":"2406.16306","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-07-03T21:18:58.020417Z","title":"Cascade reward sampling for efficient decoding-time alignment","venue":null,"work_id":"100073a7-bf02-401d-82f9-16f92803ceb8","year":2024},"citing_paper":{"arxiv_id":"2606.09635","last_updated":"2026-06-08T15:33:13Z","snapshot_observed_at":"2026-08-02T03:20:14.810565Z","submitted_at":"2026-06-08T15:33:13Z","title":"Gradient-Guided Reward Optimization for Inference-time Alignment","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-27T16:43:04.984866Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2606.09635"},"observation_digest":"sha256:4be6577175b00a71a686ba84c20ef4b992177b47f6556fdcaf18058bb28d8de6","observation_id":"9e2c6f30-50c2-4c7c-8324-6952ca20e787","resolution":{"observed_at":"2026-07-03T01:17:30.641460Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment","version":3},"cited_work":{"arxiv_id":"2406.16306","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16306","snapshot_observed_at":"2026-07-03T21:18:58.020417Z","title":"Cascade reward sampling for efficient decoding-time alignment","venue":null,"work_id":"100073a7-bf02-401d-82f9-16f92803ceb8","year":2024},"citing_paper":{"arxiv_id":"2607.01392","last_updated":"2026-07-03T09:34:52Z","snapshot_observed_at":"2026-08-02T06:05:05.007648Z","submitted_at":"2026-07-01T18:50:14Z","title":"Multi-Objective Exploration and Preference Optimization via Mutual Information","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-03T21:17:46.551850Z"},"links":{"cited_paper":"/paper/2406.16306","citing_paper":"/paper/2607.01392"},"observation_digest":"sha256:5c4e5f0b9ae5b32017b4f8a411e8a8f9c5fe96ee9e2f591e7c307bf7816446b1","observation_id":"e3707ca7-1eda-43b4-b4a6-2ed0113b15ff","resolution":{"observed_at":"2026-07-03T21:18:58.021917Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.16306/citation-record","integrity":"/paper/2406.16306/integrity","json":"/paper/2406.16306/citation-record.json","paper":"/paper/2406.16306"},"outbound":[],"paper":{"arxiv_id":"2406.16306","last_updated":"2025-08-03T22:12:55Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T13:40:17.963736Z","submitted_at":"2024-06-24T04:08:35Z","title":"Cascade Reward Sampling for Efficient Decoding-Time Alignment"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2406.16306."}