{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JDHKC7WBPPLEDZG7TJKMSU645U","short_pith_number":"pith:JDHKC7WB","schema_version":"1.0","canonical_sha256":"48cea17ec17bd641e4df9a54c953dced3d3490b6c2a2b8a0524c177cb100d5c3","source":{"kind":"arxiv","id":"2308.08758","version":3},"attestation_state":"computed","paper":{"title":"Discrete Prompt Compression with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Hoyoun Jung, Kyung-Joong Kim","submitted_at":"2023-08-17T03:10:17Z","abstract_excerpt":"Compressed prompts aid instruction-tuned language models (LMs) in overcoming context window limitations and reducing computational costs. Existing methods, which primarily based on training embeddings, face various challenges associated with interpretability, the fixed number of embedding tokens, reusability across different LMs, and inapplicability when interacting with black-box APIs. This study proposes prompt compression with reinforcement learning (PCRL), which is a discrete prompt compression method that addresses these issues. The proposed PCRL method utilizes a computationally efficien"},"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":"2308.08758","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-17T03:10:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"62048e18e69ddd1373ffeca6537bf71dc8a5165e7eb74965bff4a81b81abc253","abstract_canon_sha256":"8cee34552902e20c87e25b00c8be2176b1cbb348b3607c8301121760a0d4e775"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:13.374433Z","signature_b64":"EuNDLCHW8S7YNKcfVwEYEo6jFrlzSf+EyECNpo/UWe4v1LBYjdoMc59JErpUIvAYRo1zjswzLrvBOtUScnjuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48cea17ec17bd641e4df9a54c953dced3d3490b6c2a2b8a0524c177cb100d5c3","last_reissued_at":"2026-07-05T08:26:13.373895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:13.373895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Prompt Compression with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Hoyoun Jung, Kyung-Joong Kim","submitted_at":"2023-08-17T03:10:17Z","abstract_excerpt":"Compressed prompts aid instruction-tuned language models (LMs) in overcoming context window limitations and reducing computational costs. Existing methods, which primarily based on training embeddings, face various challenges associated with interpretability, the fixed number of embedding tokens, reusability across different LMs, and inapplicability when interacting with black-box APIs. This study proposes prompt compression with reinforcement learning (PCRL), which is a discrete prompt compression method that addresses these issues. The proposed PCRL method utilizes a computationally efficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.08758","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/2308.08758/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":"2308.08758","created_at":"2026-07-05T08:26:13.373961+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.08758v3","created_at":"2026-07-05T08:26:13.373961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.08758","created_at":"2026-07-05T08:26:13.373961+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDHKC7WBPPLE","created_at":"2026-07-05T08:26:13.373961+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDHKC7WBPPLEDZG7","created_at":"2026-07-05T08:26:13.373961+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDHKC7WB","created_at":"2026-07-05T08:26:13.373961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.14294","citing_title":"A Survey on Efficient Inference for Large Language Models","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JDHKC7WBPPLEDZG7TJKMSU645U","json":"https://pith.science/pith/JDHKC7WBPPLEDZG7TJKMSU645U.json","graph_json":"https://pith.science/api/pith-number/JDHKC7WBPPLEDZG7TJKMSU645U/graph.json","events_json":"https://pith.science/api/pith-number/JDHKC7WBPPLEDZG7TJKMSU645U/events.json","paper":"https://pith.science/paper/JDHKC7WB"},"agent_actions":{"view_html":"https://pith.science/pith/JDHKC7WBPPLEDZG7TJKMSU645U","download_json":"https://pith.science/pith/JDHKC7WBPPLEDZG7TJKMSU645U.json","view_paper":"https://pith.science/paper/JDHKC7WB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.08758&json=true","fetch_graph":"https://pith.science/api/pith-number/JDHKC7WBPPLEDZG7TJKMSU645U/graph.json","fetch_events":"https://pith.science/api/pith-number/JDHKC7WBPPLEDZG7TJKMSU645U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDHKC7WBPPLEDZG7TJKMSU645U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDHKC7WBPPLEDZG7TJKMSU645U/action/storage_attestation","attest_author":"https://pith.science/pith/JDHKC7WBPPLEDZG7TJKMSU645U/action/author_attestation","sign_citation":"https://pith.science/pith/JDHKC7WBPPLEDZG7TJKMSU645U/action/citation_signature","submit_replication":"https://pith.science/pith/JDHKC7WBPPLEDZG7TJKMSU645U/action/replication_record"}},"created_at":"2026-07-05T08:26:13.373961+00:00","updated_at":"2026-07-05T08:26:13.373961+00:00"}