{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IHPCPTFIRC2AZAVY5KCJMQEDKO","short_pith_number":"pith:IHPCPTFI","schema_version":"1.0","canonical_sha256":"41de27cca888b40c82b8ea8496408353a435a7888444b471b5873fb307c11602","source":{"kind":"arxiv","id":"2508.15813","version":1},"attestation_state":"computed","paper":{"title":"SCOPE: A Generative Approach for LLM Prompt Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Daisy Zhe Wang, Tinghui Zhang, Yifan Wang","submitted_at":"2025-08-16T01:41:53Z","abstract_excerpt":"Prompt compression methods enhance the efficiency of Large Language Models (LLMs) and minimize the cost by reducing the length of input context. The goal of prompt compression is to shorten the LLM prompt while maintaining a high generation quality. However, existing solutions, mainly based on token removal, face challenges such as information loss and structural incoherence, like missing grammar elements in a sentence, or incomplete word phrases after token removal. Such challenges limit the final generation quality of LLM.\n  To overcome these limitations, we present a novel generative prompt"},"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":"2508.15813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-08-16T01:41:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d5f526e50fac3016028cfd9c86709345ebc9e2feb5429ac67c38033c7fc929dc","abstract_canon_sha256":"79b82795e2e7dcd5a15345d1051e3e4ee4591a51b54b002b7945686e44e23dd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:21.443797Z","signature_b64":"yJScLPMRYEYwO0pq7JM48iyqbv1TpJwG+JZjO78iNQiUcJi3/+vjojB68o610TmA5zfxgURwHqk09NQUGt8ECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41de27cca888b40c82b8ea8496408353a435a7888444b471b5873fb307c11602","last_reissued_at":"2026-07-05T11:57:21.443373Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:21.443373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SCOPE: A Generative Approach for LLM Prompt Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Daisy Zhe Wang, Tinghui Zhang, Yifan Wang","submitted_at":"2025-08-16T01:41:53Z","abstract_excerpt":"Prompt compression methods enhance the efficiency of Large Language Models (LLMs) and minimize the cost by reducing the length of input context. The goal of prompt compression is to shorten the LLM prompt while maintaining a high generation quality. However, existing solutions, mainly based on token removal, face challenges such as information loss and structural incoherence, like missing grammar elements in a sentence, or incomplete word phrases after token removal. Such challenges limit the final generation quality of LLM.\n  To overcome these limitations, we present a novel generative prompt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.15813","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/2508.15813/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":"2508.15813","created_at":"2026-07-05T11:57:21.443435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.15813v1","created_at":"2026-07-05T11:57:21.443435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.15813","created_at":"2026-07-05T11:57:21.443435+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHPCPTFIRC2A","created_at":"2026-07-05T11:57:21.443435+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHPCPTFIRC2AZAVY","created_at":"2026-07-05T11:57:21.443435+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHPCPTFI","created_at":"2026-07-05T11:57:21.443435+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29251","citing_title":"When Summaries Distort Decisions: Information Fidelity in LLM-Compressed Financial Analysis","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04661","citing_title":"CRAFT: Cost-aware Refinement And Front-aware Tuning of Prompts","ref_index":238,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09463","citing_title":"Beyond Position Bias: Shifting Context Compression from Position-Driven to Semantic-Driven","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IHPCPTFIRC2AZAVY5KCJMQEDKO","json":"https://pith.science/pith/IHPCPTFIRC2AZAVY5KCJMQEDKO.json","graph_json":"https://pith.science/api/pith-number/IHPCPTFIRC2AZAVY5KCJMQEDKO/graph.json","events_json":"https://pith.science/api/pith-number/IHPCPTFIRC2AZAVY5KCJMQEDKO/events.json","paper":"https://pith.science/paper/IHPCPTFI"},"agent_actions":{"view_html":"https://pith.science/pith/IHPCPTFIRC2AZAVY5KCJMQEDKO","download_json":"https://pith.science/pith/IHPCPTFIRC2AZAVY5KCJMQEDKO.json","view_paper":"https://pith.science/paper/IHPCPTFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.15813&json=true","fetch_graph":"https://pith.science/api/pith-number/IHPCPTFIRC2AZAVY5KCJMQEDKO/graph.json","fetch_events":"https://pith.science/api/pith-number/IHPCPTFIRC2AZAVY5KCJMQEDKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHPCPTFIRC2AZAVY5KCJMQEDKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHPCPTFIRC2AZAVY5KCJMQEDKO/action/storage_attestation","attest_author":"https://pith.science/pith/IHPCPTFIRC2AZAVY5KCJMQEDKO/action/author_attestation","sign_citation":"https://pith.science/pith/IHPCPTFIRC2AZAVY5KCJMQEDKO/action/citation_signature","submit_replication":"https://pith.science/pith/IHPCPTFIRC2AZAVY5KCJMQEDKO/action/replication_record"}},"created_at":"2026-07-05T11:57:21.443435+00:00","updated_at":"2026-07-05T11:57:21.443435+00:00"}