{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:H6SNRLDY7YLR54CUUPZHHVPXLC","short_pith_number":"pith:H6SNRLDY","schema_version":"1.0","canonical_sha256":"3fa4d8ac78fe171ef054a3f273d5f7589a25d72996f299628df084530d079be7","source":{"kind":"arxiv","id":"2311.08981","version":2},"attestation_state":"computed","paper":{"title":"Speculative Contrastive Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chang Zhou, Fei Huang, Hongyi Yuan, Keming Lu, Zheng Yuan","submitted_at":"2023-11-15T14:15:30Z","abstract_excerpt":"Large language models~(LLMs) exhibit exceptional performance in language tasks, yet their auto-regressive inference is limited due to high computational requirements and is sub-optimal due to the exposure bias. Inspired by speculative decoding and contrastive decoding, we introduce Speculative Contrastive Decoding~(SCD), a straightforward yet powerful decoding approach that leverages predictions from smaller language models~(LMs) to achieve both decoding acceleration and quality improvement. Extensive evaluations and analyses on four diverse language tasks demonstrate the effectiveness of SCD,"},"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.08981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-11-15T14:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"aa326855ba16e13ff5254ec176a0b0ef1527f30a5dc908fd6da0e49243d0dfb0","abstract_canon_sha256":"3fb956b27a1e92b6d4dac627e9b61c76ea066de756c254b9b96c6d64b6986298"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:26.189948Z","signature_b64":"+u/C9HaWIiSja8A9vh3RwwMWA4cXKFOHBhRXDb2UXVPkj5OhiTdeYfvvaUV8UC3FyLRaiByaeky1YVwDrf7KAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fa4d8ac78fe171ef054a3f273d5f7589a25d72996f299628df084530d079be7","last_reissued_at":"2026-07-05T07:55:26.189475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:26.189475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speculative Contrastive Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chang Zhou, Fei Huang, Hongyi Yuan, Keming Lu, Zheng Yuan","submitted_at":"2023-11-15T14:15:30Z","abstract_excerpt":"Large language models~(LLMs) exhibit exceptional performance in language tasks, yet their auto-regressive inference is limited due to high computational requirements and is sub-optimal due to the exposure bias. Inspired by speculative decoding and contrastive decoding, we introduce Speculative Contrastive Decoding~(SCD), a straightforward yet powerful decoding approach that leverages predictions from smaller language models~(LMs) to achieve both decoding acceleration and quality improvement. Extensive evaluations and analyses on four diverse language tasks demonstrate the effectiveness of SCD,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08981","kind":"arxiv","version":2},"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.08981/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.08981","created_at":"2026-07-05T07:55:26.189544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.08981v2","created_at":"2026-07-05T07:55:26.189544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08981","created_at":"2026-07-05T07:55:26.189544+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6SNRLDY7YLR","created_at":"2026-07-05T07:55:26.189544+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6SNRLDY7YLR54CU","created_at":"2026-07-05T07:55:26.189544+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6SNRLDY","created_at":"2026-07-05T07:55:26.189544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.21187","citing_title":"Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs","ref_index":228,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H6SNRLDY7YLR54CUUPZHHVPXLC","json":"https://pith.science/pith/H6SNRLDY7YLR54CUUPZHHVPXLC.json","graph_json":"https://pith.science/api/pith-number/H6SNRLDY7YLR54CUUPZHHVPXLC/graph.json","events_json":"https://pith.science/api/pith-number/H6SNRLDY7YLR54CUUPZHHVPXLC/events.json","paper":"https://pith.science/paper/H6SNRLDY"},"agent_actions":{"view_html":"https://pith.science/pith/H6SNRLDY7YLR54CUUPZHHVPXLC","download_json":"https://pith.science/pith/H6SNRLDY7YLR54CUUPZHHVPXLC.json","view_paper":"https://pith.science/paper/H6SNRLDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.08981&json=true","fetch_graph":"https://pith.science/api/pith-number/H6SNRLDY7YLR54CUUPZHHVPXLC/graph.json","fetch_events":"https://pith.science/api/pith-number/H6SNRLDY7YLR54CUUPZHHVPXLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6SNRLDY7YLR54CUUPZHHVPXLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6SNRLDY7YLR54CUUPZHHVPXLC/action/storage_attestation","attest_author":"https://pith.science/pith/H6SNRLDY7YLR54CUUPZHHVPXLC/action/author_attestation","sign_citation":"https://pith.science/pith/H6SNRLDY7YLR54CUUPZHHVPXLC/action/citation_signature","submit_replication":"https://pith.science/pith/H6SNRLDY7YLR54CUUPZHHVPXLC/action/replication_record"}},"created_at":"2026-07-05T07:55:26.189544+00:00","updated_at":"2026-07-05T07:55:26.189544+00:00"}