{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RE3SY34MBYONIOPSQW3E562CUJ","short_pith_number":"pith:RE3SY34M","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"},"canonical_sha256":"89372c6f8c0e1cd439f285b64efb42a248e86c0e38d9c2eab37357031e36ead4","source":{"kind":"arxiv","id":"2605.14169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14169","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14169v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14169","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"RE3SY34MBYON","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"RE3SY34MBYONIOPS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"RE3SY34M","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RE3SY34MBYONIOPSQW3E562CUJ","target":"record","payload":{"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"},"canonical_sha256":"89372c6f8c0e1cd439f285b64efb42a248e86c0e38d9c2eab37357031e36ead4","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"},"source_kind":"arxiv","source_id":"2605.14169","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/ue/6RD5b/1EKUMv+SrikGbOzZfsvQVaZtBGbBYFcN5r7945KB5wRJxWozJe4/Azn0LgPWUxReJ1/IRsmayAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:41:33.955623Z"},"content_sha256":"bcd3400b20f8977d7a909bd65d67a1db5e222a792e4914fc572303aee4e47c48","schema_version":"1.0","event_id":"sha256:bcd3400b20f8977d7a909bd65d67a1db5e222a792e4914fc572303aee4e47c48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RE3SY34MBYONIOPSQW3E562CUJ","target":"graph","payload":{"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"},"verdict_id":"e0c1a422-57e2-48c9-adae-a24b9144b14d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p159vFAkfCOz5NgPMyj9ltIflcz29gP7xtbycKOQu7sMjlwRkwNBvJ3xr1RPcCTmn6zVmocgZInTdcbIyJa0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:41:33.956571Z"},"content_sha256":"f2246feef5ac60d3cf3e33e0cfd39a6d524a307d5e86067fc219c504c40512a1","schema_version":"1.0","event_id":"sha256:f2246feef5ac60d3cf3e33e0cfd39a6d524a307d5e86067fc219c504c40512a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ/bundle.json","state_url":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RE3SY34MBYONIOPSQW3E562CUJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T04:41:33Z","links":{"resolver":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ","bundle":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ/bundle.json","state":"https://pith.science/pith/RE3SY34MBYONIOPSQW3E562CUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RE3SY34MBYONIOPSQW3E562CUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RE3SY34MBYONIOPSQW3E562CUJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e841975f28e3f762207ff5191dfd02ab1649a9d53393305c6f873091ae31bcc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T22:48:24Z","title_canon_sha256":"9e0787977cf63638d65657a938397b3031e893df47907832540be822df3a7055"},"schema_version":"1.0","source":{"id":"2605.14169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14169","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14169v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14169","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"RE3SY34MBYON","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"RE3SY34MBYONIOPS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"RE3SY34M","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:f2246feef5ac60d3cf3e33e0cfd39a6d524a307d5e86067fc219c504c40512a1","target":"graph","created_at":"2026-05-17T23:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"BOOKMARKS significantly outperforms RPA memory baselines on 85 characters from 16 artifacts, demonstrating the effectiveness of search-based memory for RPAs."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"BOOKMARKS replaces recurrent summarization with search-based bookmarks that keep task-relevant details alive across long role-play storylines."}],"snapshot_sha256":"e04f44f6163610daf9b667f195daeba2e45de2d2108bb097181f39ec70db967d"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jingbo Shang, Kun Zhou, Letian Peng, Longfei Yun, Yiming Huang, Yupeng Hou, Ziche Liu","cross_cats":[],"headline":"BOOKMARKS replaces recurrent summarization with search-based bookmarks that keep task-relevant details alive across long role-play storylines.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T22:48:24Z","title":"BOOKMARKS: Efficient Active Storyline Memory for Role-playing"},"references":{"count":136,"internal_anchors":18,"resolved_work":136,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"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","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Computational linguistics , volume=","work_id":"fe783c3d-8697-4ab1-80d1-839e34ff5a04","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Second Conference on Language Modeling , year=","work_id":"1b380696-2e90-46ca-8993-e98efae171a8","year":null},{"cited_arxiv_id":"","doi":"10.18653/v1/2023.emnlp-main.814","is_internal_anchor":false,"ref_index":4,"title":"Character-LLM","work_id":"4220d2d4-98f9-4270-967b-d4ede51af35e","year":2023},{"cited_arxiv_id":"","doi":"10.18653/v1/2021.emnlp-main.552","is_internal_anchor":false,"ref_index":5,"title":"SimCSE: Simple contrastive learning of sentence embeddings","work_id":"f9c0d9b5-c569-4f54-bdc7-6ff3cdd316db","year":2021}],"snapshot_sha256":"46e788f4fbeabe9d4f2a5af03aa3447a849ffd0955c5fd1c46eb217fa2f913b5"},"source":{"id":"2605.14169","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T04:48:45.692385Z","id":"e0c1a422-57e2-48c9-adae-a24b9144b14d","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"BOOKMARKS replaces recurrent summarization with search-based bookmarks that keep task-relevant details alive across long role-play storylines.","strongest_claim":"BOOKMARKS significantly outperforms RPA memory baselines on 85 characters from 16 artifacts, demonstrating the effectiveness of search-based memory for RPAs.","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."}},"verdict_id":"e0c1a422-57e2-48c9-adae-a24b9144b14d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bcd3400b20f8977d7a909bd65d67a1db5e222a792e4914fc572303aee4e47c48","target":"record","created_at":"2026-05-17T23:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e841975f28e3f762207ff5191dfd02ab1649a9d53393305c6f873091ae31bcc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-13T22:48:24Z","title_canon_sha256":"9e0787977cf63638d65657a938397b3031e893df47907832540be822df3a7055"},"schema_version":"1.0","source":{"id":"2605.14169","kind":"arxiv","version":1}},"canonical_sha256":"89372c6f8c0e1cd439f285b64efb42a248e86c0e38d9c2eab37357031e36ead4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89372c6f8c0e1cd439f285b64efb42a248e86c0e38d9c2eab37357031e36ead4","first_computed_at":"2026-05-17T23:39:11.378636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.378636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DHkrdyzAaux64FANZ8DJc4vfTtsDy+LRs4OqNWLbqszBrRtsAl3kx8sk0lT3fVu9EfEFtSKXSjxY9urWmVq6Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.380076Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcd3400b20f8977d7a909bd65d67a1db5e222a792e4914fc572303aee4e47c48","sha256:f2246feef5ac60d3cf3e33e0cfd39a6d524a307d5e86067fc219c504c40512a1"],"state_sha256":"30072d9cbbf8916d49833e6562a6104f810e46259ab63cbfca42351c9580936d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UodMqLbruu/pq2Kd/g3y0FxDwDWgPM7VKe5H+0/o7WQSHEO/cnmJ3+6aPCcoAhiG74zcyL6zJ7Nk4jEM32yfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:41:33.960875Z","bundle_sha256":"13913cbb2f55f044f30f48930f8b9ad2d165c355733026d28c61961eb2d741d6"}}