{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SY4L4SVHEPZCVAJYIOI6U4CAAL","short_pith_number":"pith:SY4L4SVH","schema_version":"1.0","canonical_sha256":"9638be4aa723f22a81384391ea704002f83e58b13e16d7b4febe0452ef68758e","source":{"kind":"arxiv","id":"2410.03156","version":1},"attestation_state":"computed","paper":{"title":"MELODI: Exploring Memory Compression for Long Contexts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Andrey Zhmoginov, Aren Jansen, David Racz, DeLesley Hutchins, Jesper Andersen, Yinpeng Chen","submitted_at":"2024-10-04T05:34:15Z","abstract_excerpt":"We present MELODI, a novel memory architecture designed to efficiently process long documents using short context windows. The key principle behind MELODI is to represent short-term and long-term memory as a hierarchical compression scheme across both network layers and context windows. Specifically, the short-term memory is achieved through recurrent compression of context windows across multiple layers, ensuring smooth transitions between windows. In contrast, the long-term memory performs further compression within a single middle layer and aggregates information across context windows, eff"},"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.03156","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-04T05:34:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"170690cfa31d598b9fb6e38eaa342ca970f1dff4f9820838afc51ee3555c4227","abstract_canon_sha256":"03c8c4cd22c3e9e2bb9c474a8142911fda9ab384f58425fd677288e35cf1c65d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:45.373221Z","signature_b64":"71BidDD1aHV0WcLb4hms9G2sEyy0APg/J82VmL4jhlBdzT6/YS0/OnCGqeBeBm4qdPaqu1ezDD55JHbfmU4yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9638be4aa723f22a81384391ea704002f83e58b13e16d7b4febe0452ef68758e","last_reissued_at":"2026-07-05T09:15:45.372762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:45.372762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MELODI: Exploring Memory Compression for Long Contexts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Andrey Zhmoginov, Aren Jansen, David Racz, DeLesley Hutchins, Jesper Andersen, Yinpeng Chen","submitted_at":"2024-10-04T05:34:15Z","abstract_excerpt":"We present MELODI, a novel memory architecture designed to efficiently process long documents using short context windows. The key principle behind MELODI is to represent short-term and long-term memory as a hierarchical compression scheme across both network layers and context windows. Specifically, the short-term memory is achieved through recurrent compression of context windows across multiple layers, ensuring smooth transitions between windows. In contrast, the long-term memory performs further compression within a single middle layer and aggregates information across context windows, eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03156","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.03156/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.03156","created_at":"2026-07-05T09:15:45.372817+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03156v1","created_at":"2026-07-05T09:15:45.372817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03156","created_at":"2026-07-05T09:15:45.372817+00:00"},{"alias_kind":"pith_short_12","alias_value":"SY4L4SVHEPZC","created_at":"2026-07-05T09:15:45.372817+00:00"},{"alias_kind":"pith_short_16","alias_value":"SY4L4SVHEPZCVAJY","created_at":"2026-07-05T09:15:45.372817+00:00"},{"alias_kind":"pith_short_8","alias_value":"SY4L4SVH","created_at":"2026-07-05T09:15:45.372817+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06139","citing_title":"LCIRC: A Recurrent Compression Approach for Efficient Long-form Context and Query Dependent Modeling in LLMs","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SY4L4SVHEPZCVAJYIOI6U4CAAL","json":"https://pith.science/pith/SY4L4SVHEPZCVAJYIOI6U4CAAL.json","graph_json":"https://pith.science/api/pith-number/SY4L4SVHEPZCVAJYIOI6U4CAAL/graph.json","events_json":"https://pith.science/api/pith-number/SY4L4SVHEPZCVAJYIOI6U4CAAL/events.json","paper":"https://pith.science/paper/SY4L4SVH"},"agent_actions":{"view_html":"https://pith.science/pith/SY4L4SVHEPZCVAJYIOI6U4CAAL","download_json":"https://pith.science/pith/SY4L4SVHEPZCVAJYIOI6U4CAAL.json","view_paper":"https://pith.science/paper/SY4L4SVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03156&json=true","fetch_graph":"https://pith.science/api/pith-number/SY4L4SVHEPZCVAJYIOI6U4CAAL/graph.json","fetch_events":"https://pith.science/api/pith-number/SY4L4SVHEPZCVAJYIOI6U4CAAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SY4L4SVHEPZCVAJYIOI6U4CAAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SY4L4SVHEPZCVAJYIOI6U4CAAL/action/storage_attestation","attest_author":"https://pith.science/pith/SY4L4SVHEPZCVAJYIOI6U4CAAL/action/author_attestation","sign_citation":"https://pith.science/pith/SY4L4SVHEPZCVAJYIOI6U4CAAL/action/citation_signature","submit_replication":"https://pith.science/pith/SY4L4SVHEPZCVAJYIOI6U4CAAL/action/replication_record"}},"created_at":"2026-07-05T09:15:45.372817+00:00","updated_at":"2026-07-05T09:15:45.372817+00:00"}