{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4NMKA5COY6UESS6722LCTP2HQ6","short_pith_number":"pith:4NMKA5CO","canonical_record":{"source":{"id":"2608.05095","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-05T17:32:43Z","cross_cats_sorted":[],"title_canon_sha256":"ff740ddf77f80a698a5a28a8c2b6662085667d93b54a319111cac3ca696ec3c2","abstract_canon_sha256":"b5da925fe8844eee4bb6cbaf853364bf34a81bad60aab640c61fa514ed751ff2"},"schema_version":"1.0"},"canonical_sha256":"e358a0744ec7a8494bdfd69629bf4787958e628846585038ae8d10914ebbbbca","source":{"kind":"arxiv","id":"2608.05095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.05095","created_at":"2026-08-06T01:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"2608.05095v1","created_at":"2026-08-06T01:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05095","created_at":"2026-08-06T01:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"4NMKA5COY6UE","created_at":"2026-08-06T01:49:11Z"},{"alias_kind":"pith_short_16","alias_value":"4NMKA5COY6UESS67","created_at":"2026-08-06T01:49:11Z"},{"alias_kind":"pith_short_8","alias_value":"4NMKA5CO","created_at":"2026-08-06T01:49:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4NMKA5COY6UESS6722LCTP2HQ6","target":"record","payload":{"canonical_record":{"source":{"id":"2608.05095","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-05T17:32:43Z","cross_cats_sorted":[],"title_canon_sha256":"ff740ddf77f80a698a5a28a8c2b6662085667d93b54a319111cac3ca696ec3c2","abstract_canon_sha256":"b5da925fe8844eee4bb6cbaf853364bf34a81bad60aab640c61fa514ed751ff2"},"schema_version":"1.0"},"canonical_sha256":"e358a0744ec7a8494bdfd69629bf4787958e628846585038ae8d10914ebbbbca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:49:11.058940Z","signature_b64":"LHwkdTy9fqgcXCqzs3mWEsIZjENFgXxjFhHy9nRFEKzrCpkVpOrbjcqVmpjK4dcJG/6A99eC5qmFHv8bzFcoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e358a0744ec7a8494bdfd69629bf4787958e628846585038ae8d10914ebbbbca","last_reissued_at":"2026-08-06T01:49:11.057194Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:49:11.057194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.05095","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-08-06T01:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tcczn1jC6Rsk+MtvMecrqmAN028nWBt0L0EyrE66K8kgmMHCFYQtKpXAVYW9BA6xXdDXTvzAKIlybfQ3r8Z7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T19:06:17.195377Z"},"content_sha256":"155bbe9c32bb153a3b4903928a503e79970302172d32cd719acc59f7f3b71135","schema_version":"1.0","event_id":"sha256:155bbe9c32bb153a3b4903928a503e79970302172d32cd719acc59f7f3b71135"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4NMKA5COY6UESS6722LCTP2HQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Graph Memory for LLM Agents with Path-level Localization and Rewrite","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"BoRan Wang, Shuxin Zheng, Xiaoqing Zhang, Xiawei Yue, Ziwei Zhang","submitted_at":"2026-08-05T17:32:43Z","abstract_excerpt":"Agents for long term reasoning require a memory that can be efficiently and effectively updated over time, as new facts and external feedback continue to arrive. Recently, graph memory has been adopted to offer structural organization for multi-hop retrieval and reasoning. However, existing methods store all memories in a flat graph, and accumulated historical memories can introduce irrelevant contexts and increase the cost of evidence selection during retrieval. Moreover, they typically update memory units independently, requiring repeated unit-wise rewrite to cover related changes. To addres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05095","kind":"arxiv","version":1},"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/2608.05095/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-06T01:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jNWBIVPsiaK3HZl5dFaz02emtzbfkbXsySmcvV/KkzYSnFPOpiteo/PrhPVEOWoq4Hw7xzkpKI1dFfUP1Ua0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T19:06:17.259038Z"},"content_sha256":"64dde16f09a585037b15166ed7d16ccbabfe5203a7bbdba34583d6bc5debce0f","schema_version":"1.0","event_id":"sha256:64dde16f09a585037b15166ed7d16ccbabfe5203a7bbdba34583d6bc5debce0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NMKA5COY6UESS6722LCTP2HQ6/bundle.json","state_url":"https://pith.science/pith/4NMKA5COY6UESS6722LCTP2HQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NMKA5COY6UESS6722LCTP2HQ6/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-08-06T19:06:17Z","links":{"resolver":"https://pith.science/pith/4NMKA5COY6UESS6722LCTP2HQ6","bundle":"https://pith.science/pith/4NMKA5COY6UESS6722LCTP2HQ6/bundle.json","state":"https://pith.science/pith/4NMKA5COY6UESS6722LCTP2HQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NMKA5COY6UESS6722LCTP2HQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4NMKA5COY6UESS6722LCTP2HQ6","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":"b5da925fe8844eee4bb6cbaf853364bf34a81bad60aab640c61fa514ed751ff2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-05T17:32:43Z","title_canon_sha256":"ff740ddf77f80a698a5a28a8c2b6662085667d93b54a319111cac3ca696ec3c2"},"schema_version":"1.0","source":{"id":"2608.05095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.05095","created_at":"2026-08-06T01:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"2608.05095v1","created_at":"2026-08-06T01:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05095","created_at":"2026-08-06T01:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"4NMKA5COY6UE","created_at":"2026-08-06T01:49:11Z"},{"alias_kind":"pith_short_16","alias_value":"4NMKA5COY6UESS67","created_at":"2026-08-06T01:49:11Z"},{"alias_kind":"pith_short_8","alias_value":"4NMKA5CO","created_at":"2026-08-06T01:49:11Z"}],"graph_snapshots":[{"event_id":"sha256:64dde16f09a585037b15166ed7d16ccbabfe5203a7bbdba34583d6bc5debce0f","target":"graph","created_at":"2026-08-06T01:49: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.05095/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Agents for long term reasoning require a memory that can be efficiently and effectively updated over time, as new facts and external feedback continue to arrive. Recently, graph memory has been adopted to offer structural organization for multi-hop retrieval and reasoning. However, existing methods store all memories in a flat graph, and accumulated historical memories can introduce irrelevant contexts and increase the cost of evidence selection during retrieval. Moreover, they typically update memory units independently, requiring repeated unit-wise rewrite to cover related changes. To addres","authors_text":"BoRan Wang, Shuxin Zheng, Xiaoqing Zhang, Xiawei Yue, Ziwei Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-05T17:32:43Z","title":"Hierarchical Graph Memory for LLM Agents with Path-level Localization and Rewrite"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05095","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:155bbe9c32bb153a3b4903928a503e79970302172d32cd719acc59f7f3b71135","target":"record","created_at":"2026-08-06T01:49: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":"b5da925fe8844eee4bb6cbaf853364bf34a81bad60aab640c61fa514ed751ff2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-05T17:32:43Z","title_canon_sha256":"ff740ddf77f80a698a5a28a8c2b6662085667d93b54a319111cac3ca696ec3c2"},"schema_version":"1.0","source":{"id":"2608.05095","kind":"arxiv","version":1}},"canonical_sha256":"e358a0744ec7a8494bdfd69629bf4787958e628846585038ae8d10914ebbbbca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e358a0744ec7a8494bdfd69629bf4787958e628846585038ae8d10914ebbbbca","first_computed_at":"2026-08-06T01:49:11.057194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:49:11.057194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LHwkdTy9fqgcXCqzs3mWEsIZjENFgXxjFhHy9nRFEKzrCpkVpOrbjcqVmpjK4dcJG/6A99eC5qmFHv8bzFcoDA==","signature_status":"signed_v1","signed_at":"2026-08-06T01:49:11.058940Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.05095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:155bbe9c32bb153a3b4903928a503e79970302172d32cd719acc59f7f3b71135","sha256:64dde16f09a585037b15166ed7d16ccbabfe5203a7bbdba34583d6bc5debce0f"],"state_sha256":"6b4e7c991a3557259de149efe7a4676ed8df29a3fc24ac5b6a8a16dcda695545"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T02gO8mH2NSZCJDpGDqceu1V525/M3v98bwNtz1eZY2O0AOed50TqOtQJ4uzlzNMA2JDTACv21eq1bsf32RACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T19:06:17.384821Z","bundle_sha256":"14ce34425142213392663e46e494501626c45c16443f70b2dcb5c886e3c908b8"}}