{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_53901d1541ced7a7b34ea6deec4527fd3f46f1f594fd8e4a31aedf4ff154d64b","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_53901d1541ced7a7b34ea6deec4527fd3f46f1f594fd8e4a31aedf4ff154d64b","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"fc8cf1094bb83a80a41948cb67bd80ce61602b02c2421a66e6a1cc41dfca1353","published":"Wed, 03 Jun 2026 00:00:00 -0400","receipt_hash":"fc8cf1094bb83a80a41948cb67bd80ce61602b02c2421a66e6a1cc41dfca1353","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"fc8cf1094bb83a80a41948cb67bd80ce61602b02c2421a66e6a1cc41dfca1353","observed_at":"2026-06-03T04:43:57.136784Z","parent_run_hash":"62ae9c8eda846b00bc49666345b338d00756c5203438666c4c1fc694cc364b84","published":"Wed, 03 Jun 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2606.03463v1 Announce Type: new \nAbstract: Conversational AI agents require memory systems that are both scalable and semantically coherent across long interaction horizons. Existing approaches rely predominantly on large language model (LLM)-based summarisation at write time, which introduces non-determinism, escalating token costs, and opacity in pruning decisions. We present the Deterministic Memory Framework (DMF), a CPU-first approach that replaces generative memory compression with a fully deterministic pipeline grounded in classical NLP analysis, vector geometry, and mathematical scoring. DMF assigns each conversational interaction a Survival Score $\\Omega$ computed from deterministic content signals, conversational cues, and structured provenance, combined through a logistic projection. An interaction-count decay law, denoted as $\\Omega_{\\mathrm{eff}}(\\Delta n)$, governs how relevance evolves as new turns arrive, where $\\Delta n$ is the number of newer interactions rather","title":"DMF: A Deterministic Memory Framework for Conversational AI Agents","url":"https://arxiv.org/abs/2606.03463","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.03463v1 Announce Type: new \nAbstract: Conversational AI agents require memory systems that are both scalable and semantically coherent across long interaction horizons. Existing approaches rely predominantly on large language model (LLM)-based summarisation at write time, which introduces non-determinism, escalating token costs, and opacity in pruning decisions. We present the Deterministic Memory Framework (DMF), a CPU-first approach that replaces generative memory compression with a fully deterministic pipeline grounded in classical NLP analysis, vector geometry, and mathematical scoring. DMF assigns each conversational interaction a Survival Score $\\Omega$ computed from deterministic content signals, conversational cues, and structured provenance, combined through a logistic projection. An interaction-count decay law, denoted as $\\Omega_{\\mathrm{eff}}(\\Delta n)$, governs how relevance evolves as new turns arrive, where $\\Delta n$ is the number of newer interactions rather","title":"DMF: A Deterministic Memory Framework for Conversational AI Agents","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-03T04:43:57Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2606.03463"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:6da9f729c0eab22d9ff72d266c24407275415e64842774e22aed3c381b790b37c1bc21a8dad43fee6e660d2d69a05d2a2a8cdf7c23c131e4bcc7add6b259a506","signer":"crovia.substrate","subject":{"observed_at":"2026-06-03T04:43:57Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.03463"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"21ed3d8a57c7cc2c01565fb969a220cd69d8540b4c74abda690ae80d9ddbd737","leaf_index":209055,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"341da24d04982d09d20cdcb06003f72a42a094a8a5ed30b49109a5b4e4934aa6","side":"left"},{"sibling":"861d3e985e982d9dd67146a3cad1ee78a2871de210da353aa7570ed53ddbcf54","side":"left"},{"sibling":"f76f3d0cd98dc344ca9b2a8cfb676e0eafb6051aad2f8ddc3ea431f41c175983","side":"left"},{"sibling":"7c6c30bfce4b10b23f51b8d01ce5c8871945fca56e8b3e3f6cb4a92af7caf79e","side":"left"},{"sibling":"12dbaf3e3acea566087df9434acb1cb757c8ca71c9a3452bd8361e8c3eff29c8","side":"left"},{"sibling":"c03e8f96750eda496a0fdd79bfb2df81faf0d17551a619e67ebf402f271263bb","side":"right"},{"sibling":"774fc127f09c4116646d44b290dc856efd1c3b5371b99a54c99f0ed4cfbe2353","side":"right"},{"sibling":"eae7f3d160253f87d5f2b594663f65cef3187784faa6d32d0ec2a662c29c4d98","side":"left"},{"sibling":"9924ce3405008f0c3a3b79e9066c574929b10c2965e0cc083262d3ac8aae2cb3","side":"right"},{"sibling":"2abcec6d14b256f82b270a3141886de6129141dec525543607b760f02588a877","side":"right"},{"sibling":"2b6b45743f97ac502854e489ac38a3366f8ae7ede58a2728b45daadbf29e9d03","side":"right"},{"sibling":"a81babbd79ea0da9e030dd7f43bffb6519d214317decd50727bea4e78189d970","side":"right"},{"sibling":"2dca509b3eb767a47cf215d4315f230ce9103a76264412008ae23a349b519ef1","side":"left"},{"sibling":"24d1bb4b13e0e46131b27b70a48e65fcf4e2e14b95e3bb83ade821e9df530f6b","side":"left"},{"sibling":"8d3baa674a45fd8bc6d3e8d25298f4bec86c72fa8259d576c330d12955c7b4f7","side":"right"},{"sibling":"e32819d1eff909db08066d1703f2db3f091cddac19378b2c0c625ab11e3fdbc0","side":"right"},{"sibling":"c300cf0154c136afc09b1702a0be98f4ba5b6dc5cf57e8cc714ec1eaf4196eff","side":"left"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":209569,"merkle_root":"c852efc8ad7dfffc196c71380f79e6398bcaf566974cbae7c9950b0f600d5bc8","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260603T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-03T05:37:57Z","sig_algorithm":"ed25519","signature":"1ca417607effc813341721cfdade0a2d2d4ba96a90d361dbc3e864b6991b90abc326ec41d9ba3e7110cc04adb29d7b8d95abea7ff2ab8c591b2f864ed7270c03","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_53901d1541ced7a7b34ea6deec4527fd3f46f1f594fd8e4a31aedf4ff154d64b"}}