{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RLOF7UAA3DBG2XPLWBQKUSJE6V","short_pith_number":"pith:RLOF7UAA","schema_version":"1.0","canonical_sha256":"8adc5fd000d8c26d5debb060aa4924f55b4099538249747d054027e0e48962ec","source":{"kind":"arxiv","id":"2408.03094","version":1},"attestation_state":"computed","paper":{"title":"500xCompressor: Generalized Prompt Compression for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Nigel Collier, Yixuan Su, Zongqian Li","submitted_at":"2024-08-06T10:51:47Z","abstract_excerpt":"Prompt compression is crucial for enhancing inference speed, reducing costs, and improving user experience. However, current methods face challenges such as low compression ratios and potential data leakage during evaluation. To address these issues, we propose 500xCompressor, a method that compresses extensive natural language contexts into a minimum of one single special token. The 500xCompressor introduces approximately 0.3% additional parameters and achieves compression ratios ranging from 6x to 480x. It is designed to compress any text, answer various types of questions, and could be util"},"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":"2408.03094","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-08-06T10:51:47Z","cross_cats_sorted":[],"title_canon_sha256":"93c0036adb302a3970cbb754fea8c860c841d6b39882491b04cca5df3c17fa0e","abstract_canon_sha256":"ff81edfcb4aa48f013d1b7d30ff1bd928b104ef9f1a9347ba63efb7048e1b437"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:52:45.397235Z","signature_b64":"ZgoU5stmt/k3pYUkVDUwi9vr8h2RQfeybNOC3SxMOmyKsxrWPmci9ZbD9CUCyhGUDNrIWLuSOr4vhO6IpzvmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8adc5fd000d8c26d5debb060aa4924f55b4099538249747d054027e0e48962ec","last_reissued_at":"2026-07-05T08:52:45.396720Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:52:45.396720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"500xCompressor: Generalized Prompt Compression for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Nigel Collier, Yixuan Su, Zongqian Li","submitted_at":"2024-08-06T10:51:47Z","abstract_excerpt":"Prompt compression is crucial for enhancing inference speed, reducing costs, and improving user experience. However, current methods face challenges such as low compression ratios and potential data leakage during evaluation. To address these issues, we propose 500xCompressor, a method that compresses extensive natural language contexts into a minimum of one single special token. The 500xCompressor introduces approximately 0.3% additional parameters and achieves compression ratios ranging from 6x to 480x. It is designed to compress any text, answer various types of questions, and could be util"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03094","kind":"arxiv","version":1},"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/2408.03094/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":"2408.03094","created_at":"2026-07-05T08:52:45.396780+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03094v1","created_at":"2026-07-05T08:52:45.396780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03094","created_at":"2026-07-05T08:52:45.396780+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLOF7UAA3DBG","created_at":"2026-07-05T08:52:45.396780+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLOF7UAA3DBG2XPL","created_at":"2026-07-05T08:52:45.396780+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLOF7UAA","created_at":"2026-07-05T08:52:45.396780+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08032","citing_title":"What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agents","ref_index":67,"is_internal_anchor":true},{"citing_arxiv_id":"2604.13725","citing_title":"On the Effectiveness of Context Compression for Repository-Level Tasks: An Empirical Investigation","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLOF7UAA3DBG2XPLWBQKUSJE6V","json":"https://pith.science/pith/RLOF7UAA3DBG2XPLWBQKUSJE6V.json","graph_json":"https://pith.science/api/pith-number/RLOF7UAA3DBG2XPLWBQKUSJE6V/graph.json","events_json":"https://pith.science/api/pith-number/RLOF7UAA3DBG2XPLWBQKUSJE6V/events.json","paper":"https://pith.science/paper/RLOF7UAA"},"agent_actions":{"view_html":"https://pith.science/pith/RLOF7UAA3DBG2XPLWBQKUSJE6V","download_json":"https://pith.science/pith/RLOF7UAA3DBG2XPLWBQKUSJE6V.json","view_paper":"https://pith.science/paper/RLOF7UAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03094&json=true","fetch_graph":"https://pith.science/api/pith-number/RLOF7UAA3DBG2XPLWBQKUSJE6V/graph.json","fetch_events":"https://pith.science/api/pith-number/RLOF7UAA3DBG2XPLWBQKUSJE6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLOF7UAA3DBG2XPLWBQKUSJE6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLOF7UAA3DBG2XPLWBQKUSJE6V/action/storage_attestation","attest_author":"https://pith.science/pith/RLOF7UAA3DBG2XPLWBQKUSJE6V/action/author_attestation","sign_citation":"https://pith.science/pith/RLOF7UAA3DBG2XPLWBQKUSJE6V/action/citation_signature","submit_replication":"https://pith.science/pith/RLOF7UAA3DBG2XPLWBQKUSJE6V/action/replication_record"}},"created_at":"2026-07-05T08:52:45.396780+00:00","updated_at":"2026-07-05T08:52:45.396780+00:00"}