{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J4AAZIR35Y5FQKPE6NPJ3XNR54","short_pith_number":"pith:J4AAZIR3","schema_version":"1.0","canonical_sha256":"4f000ca23bee3a5829e4f35e9dddb1ef1325f9d0beb2f85c28eeb751f7ed0efb","source":{"kind":"arxiv","id":"2410.14042","version":1},"attestation_state":"computed","paper":{"title":"Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Tianxing He, Xiaojun Wan, Xiao Pu","submitted_at":"2024-10-17T21:35:49Z","abstract_excerpt":"Prompt compression condenses contexts while maintaining their informativeness for different usage scenarios. It not only shortens the inference time and reduces computational costs during the usage of large language models, but also lowers expenses when using closed-source models. In a preliminary study, we discover that when instructing language models to compress prompts, different compression styles (e.g., extractive or abstractive) impact performance of compressed prompts on downstream tasks. Building on this insight, we propose Style-Compress, a lightweight framework that adapts a smaller"},"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":"2410.14042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-10-17T21:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"c1b06d6031af0b0022f8535a5264871c4821885819fb8207282c359ef9e72854","abstract_canon_sha256":"421ee5cc4d3929067f073a6e50c8047dc71b3dd31a0c0266f9e5740cfa4ed77d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:26.313026Z","signature_b64":"fw86LtA4GY1tCpJ7jJddcWGBhfQ1tJ+8MyNezOZMKcoDzHoPmCiptDg9PtLTQp+vPcDGVSNqvs8E5hrNBCgmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f000ca23bee3a5829e4f35e9dddb1ef1325f9d0beb2f85c28eeb751f7ed0efb","last_reissued_at":"2026-07-05T09:22:26.312592Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:26.312592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Tianxing He, Xiaojun Wan, Xiao Pu","submitted_at":"2024-10-17T21:35:49Z","abstract_excerpt":"Prompt compression condenses contexts while maintaining their informativeness for different usage scenarios. It not only shortens the inference time and reduces computational costs during the usage of large language models, but also lowers expenses when using closed-source models. In a preliminary study, we discover that when instructing language models to compress prompts, different compression styles (e.g., extractive or abstractive) impact performance of compressed prompts on downstream tasks. Building on this insight, we propose Style-Compress, a lightweight framework that adapts a smaller"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.14042","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/2410.14042/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":"2410.14042","created_at":"2026-07-05T09:22:26.312656+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.14042v1","created_at":"2026-07-05T09:22:26.312656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.14042","created_at":"2026-07-05T09:22:26.312656+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4AAZIR35Y5F","created_at":"2026-07-05T09:22:26.312656+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4AAZIR35Y5FQKPE","created_at":"2026-07-05T09:22:26.312656+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4AAZIR3","created_at":"2026-07-05T09:22:26.312656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.08324","citing_title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4AAZIR35Y5FQKPE6NPJ3XNR54","json":"https://pith.science/pith/J4AAZIR35Y5FQKPE6NPJ3XNR54.json","graph_json":"https://pith.science/api/pith-number/J4AAZIR35Y5FQKPE6NPJ3XNR54/graph.json","events_json":"https://pith.science/api/pith-number/J4AAZIR35Y5FQKPE6NPJ3XNR54/events.json","paper":"https://pith.science/paper/J4AAZIR3"},"agent_actions":{"view_html":"https://pith.science/pith/J4AAZIR35Y5FQKPE6NPJ3XNR54","download_json":"https://pith.science/pith/J4AAZIR35Y5FQKPE6NPJ3XNR54.json","view_paper":"https://pith.science/paper/J4AAZIR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.14042&json=true","fetch_graph":"https://pith.science/api/pith-number/J4AAZIR35Y5FQKPE6NPJ3XNR54/graph.json","fetch_events":"https://pith.science/api/pith-number/J4AAZIR35Y5FQKPE6NPJ3XNR54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4AAZIR35Y5FQKPE6NPJ3XNR54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4AAZIR35Y5FQKPE6NPJ3XNR54/action/storage_attestation","attest_author":"https://pith.science/pith/J4AAZIR35Y5FQKPE6NPJ3XNR54/action/author_attestation","sign_citation":"https://pith.science/pith/J4AAZIR35Y5FQKPE6NPJ3XNR54/action/citation_signature","submit_replication":"https://pith.science/pith/J4AAZIR35Y5FQKPE6NPJ3XNR54/action/replication_record"}},"created_at":"2026-07-05T09:22:26.312656+00:00","updated_at":"2026-07-05T09:22:26.312656+00:00"}