{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2RXVGKIM444KD52HRRLXNEPMY7","short_pith_number":"pith:2RXVGKIM","schema_version":"1.0","canonical_sha256":"d46f53290ce738a1f7478c577691ecc7e928aa9b3aa99439ad27a804836b68e1","source":{"kind":"arxiv","id":"1807.06473","version":3},"attestation_state":"computed","paper":{"title":"Contextual Memory Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alina Beygelzimer, Hal Daum\\'e III, John Langford, Paul Mineiro, Wen Sun","submitted_at":"2018-07-17T14:36:22Z","abstract_excerpt":"We design and study a Contextual Memory Tree (CMT), a learning memory controller that inserts new memories into an experience store of unbounded size. It is designed to efficiently query for memories from that store, supporting logarithmic time insertion and retrieval operations. Hence CMT can be integrated into existing statistical learning algorithms as an augmented memory unit without substantially increasing training and inference computation. Furthermore CMT operates as a reduction to classification, allowing it to benefit from advances in representation or architecture. We demonstrate th"},"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":"1807.06473","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-17T14:36:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8fd83b11c41c1b7e662135100245dad2cfa161f22916cc9d5c21a1cb7950a156","abstract_canon_sha256":"e4fa080d611fb6153f3a65ce31e6bb07a2a42f8c87db7b63c40f04908fb8677d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:32.275138Z","signature_b64":"HEaPxJUsc/vjOUlUkxUnbbX+0g6qFnuSlvya+h2t0kUgT7/BtVZSATi5FB2KVp775+PK8f8qRyOLt19a07vDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d46f53290ce738a1f7478c577691ecc7e928aa9b3aa99439ad27a804836b68e1","last_reissued_at":"2026-05-17T23:44:32.274424Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:32.274424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contextual Memory Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alina Beygelzimer, Hal Daum\\'e III, John Langford, Paul Mineiro, Wen Sun","submitted_at":"2018-07-17T14:36:22Z","abstract_excerpt":"We design and study a Contextual Memory Tree (CMT), a learning memory controller that inserts new memories into an experience store of unbounded size. It is designed to efficiently query for memories from that store, supporting logarithmic time insertion and retrieval operations. Hence CMT can be integrated into existing statistical learning algorithms as an augmented memory unit without substantially increasing training and inference computation. Furthermore CMT operates as a reduction to classification, allowing it to benefit from advances in representation or architecture. We demonstrate th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06473","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1807.06473","created_at":"2026-05-17T23:44:32.274543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06473v3","created_at":"2026-05-17T23:44:32.274543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06473","created_at":"2026-05-17T23:44:32.274543+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RXVGKIM444K","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RXVGKIM444KD52H","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RXVGKIM","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2RXVGKIM444KD52HRRLXNEPMY7","json":"https://pith.science/pith/2RXVGKIM444KD52HRRLXNEPMY7.json","graph_json":"https://pith.science/api/pith-number/2RXVGKIM444KD52HRRLXNEPMY7/graph.json","events_json":"https://pith.science/api/pith-number/2RXVGKIM444KD52HRRLXNEPMY7/events.json","paper":"https://pith.science/paper/2RXVGKIM"},"agent_actions":{"view_html":"https://pith.science/pith/2RXVGKIM444KD52HRRLXNEPMY7","download_json":"https://pith.science/pith/2RXVGKIM444KD52HRRLXNEPMY7.json","view_paper":"https://pith.science/paper/2RXVGKIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06473&json=true","fetch_graph":"https://pith.science/api/pith-number/2RXVGKIM444KD52HRRLXNEPMY7/graph.json","fetch_events":"https://pith.science/api/pith-number/2RXVGKIM444KD52HRRLXNEPMY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RXVGKIM444KD52HRRLXNEPMY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RXVGKIM444KD52HRRLXNEPMY7/action/storage_attestation","attest_author":"https://pith.science/pith/2RXVGKIM444KD52HRRLXNEPMY7/action/author_attestation","sign_citation":"https://pith.science/pith/2RXVGKIM444KD52HRRLXNEPMY7/action/citation_signature","submit_replication":"https://pith.science/pith/2RXVGKIM444KD52HRRLXNEPMY7/action/replication_record"}},"created_at":"2026-05-17T23:44:32.274543+00:00","updated_at":"2026-05-17T23:44:32.274543+00:00"}