{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:O7BZNU6F7E6E4BZ76BK66C3VDG","short_pith_number":"pith:O7BZNU6F","schema_version":"1.0","canonical_sha256":"77c396d3c5f93c4e073ff055ef0b7519b1da1942f40d1e0151a673bb02ffa58d","source":{"kind":"arxiv","id":"2009.06367","version":2},"attestation_state":"computed","paper":{"title":"GeDi: Generative Discriminator Guided Sequence Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Akhilesh Deepak Gotmare, Ben Krause, Bryan McCann, Nazneen Fatema Rajani, Nitish Shirish Keskar, Richard Socher, Shafiq Joty","submitted_at":"2020-09-14T17:45:36Z","abstract_excerpt":"While large-scale language models (LMs) are able to imitate the distribution of natural language well enough to generate realistic text, it is difficult to control which regions of the distribution they generate. This is especially problematic because datasets used for training large LMs usually contain significant toxicity, hate, bias, and negativity. We propose GeDi as an efficient method for using smaller LMs as generative discriminators to guide generation from large LMs to make them safer and more controllable. GeDi guides generation at each step by computing classification probabilities "},"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":"2009.06367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-09-14T17:45:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0473c680c72ac07c20c8010c4fd4c7ce4d1da5ce252d36a83b3dc341245f267f","abstract_canon_sha256":"34fc31bc02d5b74a7dab23e10f158b67190c5d96a748acd407e7170c7b109f40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:06.062953Z","signature_b64":"L0AcJHEZmdB1Jq9/VsBHofK2JRGUZW+dj0qpKvD22lkGONX45yNANxuJwKdSiRlbpeuOvzeDFT8YvsPjCtErCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77c396d3c5f93c4e073ff055ef0b7519b1da1942f40d1e0151a673bb02ffa58d","last_reissued_at":"2026-07-05T01:45:06.062534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:06.062534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GeDi: Generative Discriminator Guided Sequence Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Akhilesh Deepak Gotmare, Ben Krause, Bryan McCann, Nazneen Fatema Rajani, Nitish Shirish Keskar, Richard Socher, Shafiq Joty","submitted_at":"2020-09-14T17:45:36Z","abstract_excerpt":"While large-scale language models (LMs) are able to imitate the distribution of natural language well enough to generate realistic text, it is difficult to control which regions of the distribution they generate. This is especially problematic because datasets used for training large LMs usually contain significant toxicity, hate, bias, and negativity. We propose GeDi as an efficient method for using smaller LMs as generative discriminators to guide generation from large LMs to make them safer and more controllable. GeDi guides generation at each step by computing classification probabilities "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.06367","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/2009.06367/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":"2009.06367","created_at":"2026-07-05T01:45:06.062584+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.06367v2","created_at":"2026-07-05T01:45:06.062584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06367","created_at":"2026-07-05T01:45:06.062584+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7BZNU6F7E6E","created_at":"2026-07-05T01:45:06.062584+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7BZNU6F7E6E4BZ7","created_at":"2026-07-05T01:45:06.062584+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7BZNU6F","created_at":"2026-07-05T01:45:06.062584+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12234","citing_title":"On The Effectiveness-Fluency Trade-Off In LLM Conditioning: A Systematic Study","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2008.02275","citing_title":"Aligning AI With Shared Human Values","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2506.17299","citing_title":"Toward Principled LLM Safety Testing: Solving the Jailbreak Oracle Problem","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2106.01345","citing_title":"Decision Transformer: Reinforcement Learning via Sequence Modeling","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14004","citing_title":"Conditional Attribute Estimation with Autoregressive Sequence Models","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2101.00190","citing_title":"Prefix-Tuning: Optimizing Continuous Prompts for Generation","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07631","citing_title":"Inference Time Causal Probing in LLMs","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O7BZNU6F7E6E4BZ76BK66C3VDG","json":"https://pith.science/pith/O7BZNU6F7E6E4BZ76BK66C3VDG.json","graph_json":"https://pith.science/api/pith-number/O7BZNU6F7E6E4BZ76BK66C3VDG/graph.json","events_json":"https://pith.science/api/pith-number/O7BZNU6F7E6E4BZ76BK66C3VDG/events.json","paper":"https://pith.science/paper/O7BZNU6F"},"agent_actions":{"view_html":"https://pith.science/pith/O7BZNU6F7E6E4BZ76BK66C3VDG","download_json":"https://pith.science/pith/O7BZNU6F7E6E4BZ76BK66C3VDG.json","view_paper":"https://pith.science/paper/O7BZNU6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.06367&json=true","fetch_graph":"https://pith.science/api/pith-number/O7BZNU6F7E6E4BZ76BK66C3VDG/graph.json","fetch_events":"https://pith.science/api/pith-number/O7BZNU6F7E6E4BZ76BK66C3VDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7BZNU6F7E6E4BZ76BK66C3VDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7BZNU6F7E6E4BZ76BK66C3VDG/action/storage_attestation","attest_author":"https://pith.science/pith/O7BZNU6F7E6E4BZ76BK66C3VDG/action/author_attestation","sign_citation":"https://pith.science/pith/O7BZNU6F7E6E4BZ76BK66C3VDG/action/citation_signature","submit_replication":"https://pith.science/pith/O7BZNU6F7E6E4BZ76BK66C3VDG/action/replication_record"}},"created_at":"2026-07-05T01:45:06.062584+00:00","updated_at":"2026-07-05T01:45:06.062584+00:00"}