{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DBQUGGVXNSID3YQKCCCNZQPXI6","short_pith_number":"pith:DBQUGGVX","schema_version":"1.0","canonical_sha256":"1861431ab76c903de20a1084dcc1f74786822fec4f191d1c1137e0347ada7768","source":{"kind":"arxiv","id":"2601.07978","version":3},"attestation_state":"computed","paper":{"title":"Cost and Accuracy of Long-Term Memory in Distributed Multi-Agent Systems Based on Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Benedict Wolff, Jacopo Bennati","submitted_at":"2026-01-12T20:20:35Z","abstract_excerpt":"Long-term memory (LTM) is fundamental to large language model (LLM)-based agents in the emerging Internet of Agents (IoA), where distributed multi-agent systems (DMAS) span cloud and edge networks. Existing evaluations are typically published by framework providers and focus on token usage and latency, rarely accounting for system-level cost or deployment in DMAS. These gaps are addressed with an independent reproducible testbed that evaluates accuracy, latency, CPU time, peak RAM, disk I/O and network usage in a simulated cloud-edge environment. Three venture capital-funded frameworks spannin"},"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":"2601.07978","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-01-12T20:20:35Z","cross_cats_sorted":[],"title_canon_sha256":"f6297e84b1d1b8e0caa78450dbaa16089d0a2f40c038fdfb5379db1a326efa74","abstract_canon_sha256":"1024753b5d440845a1857baf05580e295a79a4674800b96c1cba5930173f6400"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:40.749228Z","signature_b64":"2HH9M3l5lyZqV6G/ZeuYu6snFHDPu+ItFNXOErYWIkw12vrgVPd3yYCOo8B4HW0rlkFzIRQjzY7jmaSA5bAeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1861431ab76c903de20a1084dcc1f74786822fec4f191d1c1137e0347ada7768","last_reissued_at":"2026-06-02T01:03:40.748714Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:40.748714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cost and Accuracy of Long-Term Memory in Distributed Multi-Agent Systems Based on Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Benedict Wolff, Jacopo Bennati","submitted_at":"2026-01-12T20:20:35Z","abstract_excerpt":"Long-term memory (LTM) is fundamental to large language model (LLM)-based agents in the emerging Internet of Agents (IoA), where distributed multi-agent systems (DMAS) span cloud and edge networks. Existing evaluations are typically published by framework providers and focus on token usage and latency, rarely accounting for system-level cost or deployment in DMAS. These gaps are addressed with an independent reproducible testbed that evaluates accuracy, latency, CPU time, peak RAM, disk I/O and network usage in a simulated cloud-edge environment. Three venture capital-funded frameworks spannin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.07978","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.07978/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":"2601.07978","created_at":"2026-06-02T01:03:40.748771+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.07978v3","created_at":"2026-06-02T01:03:40.748771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.07978","created_at":"2026-06-02T01:03:40.748771+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBQUGGVXNSID","created_at":"2026-06-02T01:03:40.748771+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBQUGGVXNSID3YQK","created_at":"2026-06-02T01:03:40.748771+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBQUGGVX","created_at":"2026-06-02T01:03:40.748771+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.18854","citing_title":"Evaluating Memory Condensation Strategies for Coding Agents in Data-Driven Scientific Discovery","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10488","citing_title":"DeepRefine: Agent-Compiled Knowledge Refinement via Reinforcement Learning","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DBQUGGVXNSID3YQKCCCNZQPXI6","json":"https://pith.science/pith/DBQUGGVXNSID3YQKCCCNZQPXI6.json","graph_json":"https://pith.science/api/pith-number/DBQUGGVXNSID3YQKCCCNZQPXI6/graph.json","events_json":"https://pith.science/api/pith-number/DBQUGGVXNSID3YQKCCCNZQPXI6/events.json","paper":"https://pith.science/paper/DBQUGGVX"},"agent_actions":{"view_html":"https://pith.science/pith/DBQUGGVXNSID3YQKCCCNZQPXI6","download_json":"https://pith.science/pith/DBQUGGVXNSID3YQKCCCNZQPXI6.json","view_paper":"https://pith.science/paper/DBQUGGVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.07978&json=true","fetch_graph":"https://pith.science/api/pith-number/DBQUGGVXNSID3YQKCCCNZQPXI6/graph.json","fetch_events":"https://pith.science/api/pith-number/DBQUGGVXNSID3YQKCCCNZQPXI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBQUGGVXNSID3YQKCCCNZQPXI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBQUGGVXNSID3YQKCCCNZQPXI6/action/storage_attestation","attest_author":"https://pith.science/pith/DBQUGGVXNSID3YQKCCCNZQPXI6/action/author_attestation","sign_citation":"https://pith.science/pith/DBQUGGVXNSID3YQKCCCNZQPXI6/action/citation_signature","submit_replication":"https://pith.science/pith/DBQUGGVXNSID3YQKCCCNZQPXI6/action/replication_record"}},"created_at":"2026-06-02T01:03:40.748771+00:00","updated_at":"2026-06-02T01:03:40.748771+00:00"}