{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6F4DSJ7JJ2OA2ELPUTQZAUCH5U","short_pith_number":"pith:6F4DSJ7J","schema_version":"1.0","canonical_sha256":"f1783927e94e9c0d116fa4e1905047ed3e6d61930696741561d8c7ffced32d4c","source":{"kind":"arxiv","id":"2311.08154","version":3},"attestation_state":"computed","paper":{"title":"Just Ask One More Time! Self-Agreement Improves Reasoning of Language Models in (Almost) All Scenarios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Di Zhang, Fuzheng Zhang, Jiayi Fu, Junchen Wan, Kun Gai, Lei Lin, Pengli Liu, Qingyang Li, Yan Gong, Zhongyuan Wang","submitted_at":"2023-11-14T13:30:54Z","abstract_excerpt":"Although chain-of-thought (CoT) prompting combined with language models has achieved encouraging results on complex reasoning tasks, the naive greedy decoding used in CoT prompting usually causes the repetitiveness and local optimality. To address this shortcoming, ensemble-optimization tries to obtain multiple reasoning paths to get the final answer assembly. However, current ensemble-optimization methods either simply employ rule-based post-processing such as \\textit{self-consistency}, or train an additional model based on several task-related human annotations to select the best one among m"},"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":"2311.08154","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-11-14T13:30:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5b2e1f9f86d10b0eb3cfed428c97f863dc608ea5cb2620f9112d6081ddf00ec6","abstract_canon_sha256":"a186ec9c3988520b86f835f413ffd918ff55f4f8a7441a8c66750d7689276a14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:34.822185Z","signature_b64":"dMknATBKTPO/LU4H1dyahYeWW48hsBkkkHFz+kB+BRFnBnFGToUpxwRc1S4PefcZXjQNsZLDwodYK7YCl1OyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1783927e94e9c0d116fa4e1905047ed3e6d61930696741561d8c7ffced32d4c","last_reissued_at":"2026-07-05T08:22:34.821654Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:34.821654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Just Ask One More Time! Self-Agreement Improves Reasoning of Language Models in (Almost) All Scenarios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Di Zhang, Fuzheng Zhang, Jiayi Fu, Junchen Wan, Kun Gai, Lei Lin, Pengli Liu, Qingyang Li, Yan Gong, Zhongyuan Wang","submitted_at":"2023-11-14T13:30:54Z","abstract_excerpt":"Although chain-of-thought (CoT) prompting combined with language models has achieved encouraging results on complex reasoning tasks, the naive greedy decoding used in CoT prompting usually causes the repetitiveness and local optimality. To address this shortcoming, ensemble-optimization tries to obtain multiple reasoning paths to get the final answer assembly. However, current ensemble-optimization methods either simply employ rule-based post-processing such as \\textit{self-consistency}, or train an additional model based on several task-related human annotations to select the best one among m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08154","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/2311.08154/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":"2311.08154","created_at":"2026-07-05T08:22:34.821719+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.08154v3","created_at":"2026-07-05T08:22:34.821719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08154","created_at":"2026-07-05T08:22:34.821719+00:00"},{"alias_kind":"pith_short_12","alias_value":"6F4DSJ7JJ2OA","created_at":"2026-07-05T08:22:34.821719+00:00"},{"alias_kind":"pith_short_16","alias_value":"6F4DSJ7JJ2OA2ELP","created_at":"2026-07-05T08:22:34.821719+00:00"},{"alias_kind":"pith_short_8","alias_value":"6F4DSJ7J","created_at":"2026-07-05T08:22:34.821719+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10281","citing_title":"Benchmarking and Exploring the Capabilities of LLMs for Attack Investigations","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26644","citing_title":"When to Vote, When to Rewrite: Disagreement-Guided Strategy Routing for Test-Time Scaling","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20500","citing_title":"Efficient Test-Time Inference via Deterministic Exploration of Truncated Decoding Trees","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6F4DSJ7JJ2OA2ELPUTQZAUCH5U","json":"https://pith.science/pith/6F4DSJ7JJ2OA2ELPUTQZAUCH5U.json","graph_json":"https://pith.science/api/pith-number/6F4DSJ7JJ2OA2ELPUTQZAUCH5U/graph.json","events_json":"https://pith.science/api/pith-number/6F4DSJ7JJ2OA2ELPUTQZAUCH5U/events.json","paper":"https://pith.science/paper/6F4DSJ7J"},"agent_actions":{"view_html":"https://pith.science/pith/6F4DSJ7JJ2OA2ELPUTQZAUCH5U","download_json":"https://pith.science/pith/6F4DSJ7JJ2OA2ELPUTQZAUCH5U.json","view_paper":"https://pith.science/paper/6F4DSJ7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.08154&json=true","fetch_graph":"https://pith.science/api/pith-number/6F4DSJ7JJ2OA2ELPUTQZAUCH5U/graph.json","fetch_events":"https://pith.science/api/pith-number/6F4DSJ7JJ2OA2ELPUTQZAUCH5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6F4DSJ7JJ2OA2ELPUTQZAUCH5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6F4DSJ7JJ2OA2ELPUTQZAUCH5U/action/storage_attestation","attest_author":"https://pith.science/pith/6F4DSJ7JJ2OA2ELPUTQZAUCH5U/action/author_attestation","sign_citation":"https://pith.science/pith/6F4DSJ7JJ2OA2ELPUTQZAUCH5U/action/citation_signature","submit_replication":"https://pith.science/pith/6F4DSJ7JJ2OA2ELPUTQZAUCH5U/action/replication_record"}},"created_at":"2026-07-05T08:22:34.821719+00:00","updated_at":"2026-07-05T08:22:34.821719+00:00"}