{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YY7DRFOK75D7CMUHLJV2A4VVLD","short_pith_number":"pith:YY7DRFOK","schema_version":"1.0","canonical_sha256":"c63e3895caff47f132875a6ba072b558fb10725bb55605e6534c76759c47919e","source":{"kind":"arxiv","id":"2502.03678","version":3},"attestation_state":"computed","paper":{"title":"Reflection-Window Decoding: Text Generation with Selective Refinement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Guangyi Chen, Kun Zhang, Loka Li, Peter Spirtes, Xiangchen Song, Yifan Shen, Yunlong Deng, Zeyu Tang, Zhenhao Chen","submitted_at":"2025-02-05T23:53:08Z","abstract_excerpt":"The autoregressive decoding for text generation in large language models (LLMs), while widely used, is inherently suboptimal due to the lack of a built-in mechanism to perform refinement and/or correction of the generated content. In this paper, we consider optimality in terms of the joint probability over the generated response, when jointly considering all tokens at the same time. We theoretically characterize the potential deviation of the autoregressively generated response from its globally optimal counterpart that is of the same length. Our analysis suggests that we need to be cautious w"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.03678","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-05T23:53:08Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"cff58e099ef9d0ee7fdcafeaf4cdb98912167884c1aac4ad6dd0c3399cdccff7","abstract_canon_sha256":"7cf4bf0951e8f3156fe8dbe8f582a5eebd2671af97e188146442f81ca640a50b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:19.868736Z","signature_b64":"hLuOSHcaGhWWgsa+c/j7d6I+5nMc+cHXZ5mx6ZUkALha8MFnihCogocNOXyvj1+4JMDOgdrKpLL25pPruwT6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c63e3895caff47f132875a6ba072b558fb10725bb55605e6534c76759c47919e","last_reissued_at":"2026-07-05T11:13:19.868181Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:19.868181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reflection-Window Decoding: Text Generation with Selective Refinement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Guangyi Chen, Kun Zhang, Loka Li, Peter Spirtes, Xiangchen Song, Yifan Shen, Yunlong Deng, Zeyu Tang, Zhenhao Chen","submitted_at":"2025-02-05T23:53:08Z","abstract_excerpt":"The autoregressive decoding for text generation in large language models (LLMs), while widely used, is inherently suboptimal due to the lack of a built-in mechanism to perform refinement and/or correction of the generated content. In this paper, we consider optimality in terms of the joint probability over the generated response, when jointly considering all tokens at the same time. We theoretically characterize the potential deviation of the autoregressively generated response from its globally optimal counterpart that is of the same length. Our analysis suggests that we need to be cautious w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03678","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.03678/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.03678","created_at":"2026-07-05T11:13:19.868241+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.03678v3","created_at":"2026-07-05T11:13:19.868241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03678","created_at":"2026-07-05T11:13:19.868241+00:00"},{"alias_kind":"pith_short_12","alias_value":"YY7DRFOK75D7","created_at":"2026-07-05T11:13:19.868241+00:00"},{"alias_kind":"pith_short_16","alias_value":"YY7DRFOK75D7CMUH","created_at":"2026-07-05T11:13:19.868241+00:00"},{"alias_kind":"pith_short_8","alias_value":"YY7DRFOK","created_at":"2026-07-05T11:13:19.868241+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.17419","citing_title":"From System 1 to System 2: A Survey of Reasoning Large Language Models","ref_index":114,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YY7DRFOK75D7CMUHLJV2A4VVLD","json":"https://pith.science/pith/YY7DRFOK75D7CMUHLJV2A4VVLD.json","graph_json":"https://pith.science/api/pith-number/YY7DRFOK75D7CMUHLJV2A4VVLD/graph.json","events_json":"https://pith.science/api/pith-number/YY7DRFOK75D7CMUHLJV2A4VVLD/events.json","paper":"https://pith.science/paper/YY7DRFOK"},"agent_actions":{"view_html":"https://pith.science/pith/YY7DRFOK75D7CMUHLJV2A4VVLD","download_json":"https://pith.science/pith/YY7DRFOK75D7CMUHLJV2A4VVLD.json","view_paper":"https://pith.science/paper/YY7DRFOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.03678&json=true","fetch_graph":"https://pith.science/api/pith-number/YY7DRFOK75D7CMUHLJV2A4VVLD/graph.json","fetch_events":"https://pith.science/api/pith-number/YY7DRFOK75D7CMUHLJV2A4VVLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YY7DRFOK75D7CMUHLJV2A4VVLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YY7DRFOK75D7CMUHLJV2A4VVLD/action/storage_attestation","attest_author":"https://pith.science/pith/YY7DRFOK75D7CMUHLJV2A4VVLD/action/author_attestation","sign_citation":"https://pith.science/pith/YY7DRFOK75D7CMUHLJV2A4VVLD/action/citation_signature","submit_replication":"https://pith.science/pith/YY7DRFOK75D7CMUHLJV2A4VVLD/action/replication_record"}},"created_at":"2026-07-05T11:13:19.868241+00:00","updated_at":"2026-07-05T11:13:19.868241+00:00"}