{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7L6X5T3BK4AWFQIDUWEFCOEGYU","short_pith_number":"pith:7L6X5T3B","schema_version":"1.0","canonical_sha256":"fafd7ecf61570162c103a588513886c51a436d370891b5c0c541607cdf2ae519","source":{"kind":"arxiv","id":"2408.11745","version":2},"attestation_state":"computed","paper":{"title":"FocusLLM: Precise Understanding of Long Context by Dynamic Condensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jianyong Wang, Junjie Fang, Rong Han, Tengyu Pan, Yike Zhang, Yutao Sun, Zhenyu Li, Zhichao Duan, Zixuan Wang","submitted_at":"2024-08-21T16:11:59Z","abstract_excerpt":"Empowering LLMs with the ability to precisely understand long contexts is crucial for many downstream applications. However, handling long contexts with conventional transformer architecture requires substantial training and inference resources. Existing context condensing methods cannot accurately understand the full context, as there is a considerable amount of information loss in the condensing process. To address these issues, we present FocusLLM, a framework designed to extend the fixed context length of any decoder-only LLM, allowing the model to focus on relevant information from very l"},"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.11745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-08-21T16:11:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8838c600e7ab980658906c3550d9650cc7fc189472ddb4d087dc23c2e36c6cd3","abstract_canon_sha256":"368832216885850e10ce5f2590eb5c240496452772df3840a042dc1fffe1c66a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:03.830625Z","signature_b64":"y9f2l2Gj6qtMzMzyrEmIk00VVhL041BOsPaN0EbCKvm4b1ySacGPfUcIqRsZW2uiPWeiy1O8f82s1PJKjAOeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fafd7ecf61570162c103a588513886c51a436d370891b5c0c541607cdf2ae519","last_reissued_at":"2026-07-05T09:53:03.830162Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:03.830162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FocusLLM: Precise Understanding of Long Context by Dynamic Condensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jianyong Wang, Junjie Fang, Rong Han, Tengyu Pan, Yike Zhang, Yutao Sun, Zhenyu Li, Zhichao Duan, Zixuan Wang","submitted_at":"2024-08-21T16:11:59Z","abstract_excerpt":"Empowering LLMs with the ability to precisely understand long contexts is crucial for many downstream applications. However, handling long contexts with conventional transformer architecture requires substantial training and inference resources. Existing context condensing methods cannot accurately understand the full context, as there is a considerable amount of information loss in the condensing process. To address these issues, we present FocusLLM, a framework designed to extend the fixed context length of any decoder-only LLM, allowing the model to focus on relevant information from very l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.11745","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/2408.11745/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.11745","created_at":"2026-07-05T09:53:03.830218+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.11745v2","created_at":"2026-07-05T09:53:03.830218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.11745","created_at":"2026-07-05T09:53:03.830218+00:00"},{"alias_kind":"pith_short_12","alias_value":"7L6X5T3BK4AW","created_at":"2026-07-05T09:53:03.830218+00:00"},{"alias_kind":"pith_short_16","alias_value":"7L6X5T3BK4AWFQID","created_at":"2026-07-05T09:53:03.830218+00:00"},{"alias_kind":"pith_short_8","alias_value":"7L6X5T3B","created_at":"2026-07-05T09:53:03.830218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19823","citing_title":"HCAttention: Extreme KV Cache Compression via Heterogeneous Attention Computing for LLMs","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7L6X5T3BK4AWFQIDUWEFCOEGYU","json":"https://pith.science/pith/7L6X5T3BK4AWFQIDUWEFCOEGYU.json","graph_json":"https://pith.science/api/pith-number/7L6X5T3BK4AWFQIDUWEFCOEGYU/graph.json","events_json":"https://pith.science/api/pith-number/7L6X5T3BK4AWFQIDUWEFCOEGYU/events.json","paper":"https://pith.science/paper/7L6X5T3B"},"agent_actions":{"view_html":"https://pith.science/pith/7L6X5T3BK4AWFQIDUWEFCOEGYU","download_json":"https://pith.science/pith/7L6X5T3BK4AWFQIDUWEFCOEGYU.json","view_paper":"https://pith.science/paper/7L6X5T3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.11745&json=true","fetch_graph":"https://pith.science/api/pith-number/7L6X5T3BK4AWFQIDUWEFCOEGYU/graph.json","fetch_events":"https://pith.science/api/pith-number/7L6X5T3BK4AWFQIDUWEFCOEGYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7L6X5T3BK4AWFQIDUWEFCOEGYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7L6X5T3BK4AWFQIDUWEFCOEGYU/action/storage_attestation","attest_author":"https://pith.science/pith/7L6X5T3BK4AWFQIDUWEFCOEGYU/action/author_attestation","sign_citation":"https://pith.science/pith/7L6X5T3BK4AWFQIDUWEFCOEGYU/action/citation_signature","submit_replication":"https://pith.science/pith/7L6X5T3BK4AWFQIDUWEFCOEGYU/action/replication_record"}},"created_at":"2026-07-05T09:53:03.830218+00:00","updated_at":"2026-07-05T09:53:03.830218+00:00"}