{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RE3SY34MBYONIOPSQW3E562CUJ","short_pith_number":"pith:RE3SY34M","schema_version":"1.0","canonical_sha256":"89372c6f8c0e1cd439f285b64efb42a248e86c0e38d9c2eab37357031e36ead4","source":{"kind":"arxiv","id":"2605.14169","version":1},"attestation_state":"computed","paper":{"title":"BOOKMARKS: Efficient Active Storyline Memory for Role-playing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"BOOKMARKS replaces recurrent summarization with search-based bookmarks that keep task-relevant details alive across long role-play storylines.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jingbo Shang, Kun Zhou, Letian Peng, Longfei Yun, Yiming Huang, Yupeng Hou, Ziche Liu","submitted_at":"2026-05-13T22:48:24Z","abstract_excerpt":"Memory systems are critical for role-playing agents (RPAs) to maintain long-horizon consistency. However, existing RPA memory methods (e.g., profiling) mainly rely on recurrent summarization, whose compression inevitably discards important details. To address this issue, we propose a search-based memory framework called BOOKMARKS, which actively initializes, maintains, and updates task-relevant pieces of bookmarks for the current task (e.g., character acting). A bookmark is structured as the answer to a question at a specific point in the storyline. For each current task, BOOKMARKS selects reu"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.14169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T22:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"9e0787977cf63638d65657a938397b3031e893df47907832540be822df3a7055","abstract_canon_sha256":"e841975f28e3f762207ff5191dfd02ab1649a9d53393305c6f873091ae31bcc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.380076Z","signature_b64":"DHkrdyzAaux64FANZ8DJc4vfTtsDy+LRs4OqNWLbqszBrRtsAl3kx8sk0lT3fVu9EfEFtSKXSjxY9urWmVq6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89372c6f8c0e1cd439f285b64efb42a248e86c0e38d9c2eab37357031e36ead4","last_reissued_at":"2026-05-17T23:39:11.378636Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.378636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BOOKMARKS: Efficient Active Storyline Memory for Role-playing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"BOOKMARKS replaces recurrent summarization with search-based bookmarks that keep task-relevant details alive across long role-play storylines.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jingbo Shang, Kun Zhou, Letian Peng, Longfei Yun, Yiming Huang, Yupeng Hou, Ziche Liu","submitted_at":"2026-05-13T22:48:24Z","abstract_excerpt":"Memory systems are critical for role-playing agents (RPAs) to maintain long-horizon consistency. However, existing RPA memory methods (e.g., profiling) mainly rely on recurrent summarization, whose compression inevitably discards important details. To address this issue, we propose a search-based memory framework called BOOKMARKS, which actively initializes, maintains, and updates task-relevant pieces of bookmarks for the current task (e.g., character acting). A bookmark is structured as the answer to a question at a specific point in the storyline. For each current task, BOOKMARKS selects reu"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"BOOKMARKS significantly outperforms RPA memory baselines on 85 characters from 16 artifacts, demonstrating the effectiveness of search-based memory for RPAs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That task-relevant questions for bookmarks can be reliably selected or initialized and that synchronization methods accurately update answers without introducing errors or missing critical context as the storyline progresses.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"BOOKMARKS introduces searchable bookmarks as reusable answers to storyline questions, enabling active initialization and passive synchronization for more consistent role-playing agent memory than recurrent summarization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"BOOKMARKS replaces recurrent summarization with search-based bookmarks that keep task-relevant details alive across long role-play storylines.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e04f44f6163610daf9b667f195daeba2e45de2d2108bb097181f39ec70db967d"},"source":{"id":"2605.14169","kind":"arxiv","version":1},"verdict":{"id":"e0c1a422-57e2-48c9-adae-a24b9144b14d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T04:48:45.692385Z","strongest_claim":"BOOKMARKS significantly outperforms RPA memory baselines on 85 characters from 16 artifacts, demonstrating the effectiveness of search-based memory for RPAs.","one_line_summary":"BOOKMARKS introduces searchable bookmarks as reusable answers to storyline questions, enabling active initialization and passive synchronization for more consistent role-playing agent memory than recurrent summarization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That task-relevant questions for bookmarks can be reliably selected or initialized and that synchronization methods accurately update answers without introducing errors or missing critical context as the storyline progresses.","pith_extraction_headline":"BOOKMARKS replaces recurrent summarization with search-based bookmarks that keep task-relevant details alive across long role-play storylines."},"references":{"count":136,"sample":[{"doi":"","year":2025,"title":"Proceedings of the Thirty-Ninth Annual Conference on Neural Information Processing Systems (NeurIPS 2025) Poster Session , year =","work_id":"10913ee8-023a-46ab-8412-53be6cb8c523","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Computational linguistics , volume=","work_id":"fe783c3d-8697-4ab1-80d1-839e34ff5a04","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Second Conference on Language Modeling , year=","work_id":"1b380696-2e90-46ca-8993-e98efae171a8","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.18653/v1/2023.emnlp-main.814","year":2023,"title":"Character-LLM","work_id":"4220d2d4-98f9-4270-967b-d4ede51af35e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.18653/v1/2021.emnlp-main.552","year":2021,"title":"SimCSE: Simple contrastive learning of sentence embeddings","work_id":"f9c0d9b5-c569-4f54-bdc7-6ff3cdd316db","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":136,"snapshot_sha256":"46e788f4fbeabe9d4f2a5af03aa3447a849ffd0955c5fd1c46eb217fa2f913b5","internal_anchors":18},"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":"2605.14169","created_at":"2026-05-17T23:39:11.379082+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14169v1","created_at":"2026-05-17T23:39:11.379082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14169","created_at":"2026-05-17T23:39:11.379082+00:00"},{"alias_kind":"pith_short_12","alias_value":"RE3SY34MBYON","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"RE3SY34MBYONIOPS","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"RE3SY34M","created_at":"2026-05-18T12:33:37.589309+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/RE3SY34MBYONIOPSQW3E562CUJ","json":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ.json","graph_json":"https://pith.science/api/pith-number/RE3SY34MBYONIOPSQW3E562CUJ/graph.json","events_json":"https://pith.science/api/pith-number/RE3SY34MBYONIOPSQW3E562CUJ/events.json","paper":"https://pith.science/paper/RE3SY34M"},"agent_actions":{"view_html":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ","download_json":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ.json","view_paper":"https://pith.science/paper/RE3SY34M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14169&json=true","fetch_graph":"https://pith.science/api/pith-number/RE3SY34MBYONIOPSQW3E562CUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RE3SY34MBYONIOPSQW3E562CUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ/action/storage_attestation","attest_author":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ/action/author_attestation","sign_citation":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ/action/citation_signature","submit_replication":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ/action/replication_record"}},"created_at":"2026-05-17T23:39:11.379082+00:00","updated_at":"2026-05-17T23:39:11.379082+00:00"}