{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SWQSPFVDFHLEKJOBRARXCCBAOO","short_pith_number":"pith:SWQSPFVD","canonical_record":{"source":{"id":"2607.19359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-01T09:48:16Z","cross_cats_sorted":[],"title_canon_sha256":"ee57dd308b52226d8cb4099914487356c05533c80df6869f4217703140a6e897","abstract_canon_sha256":"d63e83d312d28a99465119a138853e5283e4c4f942bfd18f70fbbb96b0f4aaf1"},"schema_version":"1.0"},"canonical_sha256":"95a12796a329d64525c1882371082073b03c670c2ee21ba9cbe15c7b6e4d6cd7","source":{"kind":"arxiv","id":"2607.19359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.19359","created_at":"2026-07-23T00:23:44Z"},{"alias_kind":"arxiv_version","alias_value":"2607.19359v1","created_at":"2026-07-23T00:23:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19359","created_at":"2026-07-23T00:23:44Z"},{"alias_kind":"pith_short_12","alias_value":"SWQSPFVDFHLE","created_at":"2026-07-23T00:23:44Z"},{"alias_kind":"pith_short_16","alias_value":"SWQSPFVDFHLEKJOB","created_at":"2026-07-23T00:23:44Z"},{"alias_kind":"pith_short_8","alias_value":"SWQSPFVD","created_at":"2026-07-23T00:23:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SWQSPFVDFHLEKJOBRARXCCBAOO","target":"record","payload":{"canonical_record":{"source":{"id":"2607.19359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-01T09:48:16Z","cross_cats_sorted":[],"title_canon_sha256":"ee57dd308b52226d8cb4099914487356c05533c80df6869f4217703140a6e897","abstract_canon_sha256":"d63e83d312d28a99465119a138853e5283e4c4f942bfd18f70fbbb96b0f4aaf1"},"schema_version":"1.0"},"canonical_sha256":"95a12796a329d64525c1882371082073b03c670c2ee21ba9cbe15c7b6e4d6cd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T00:23:44.696170Z","signature_b64":"T3WUdAiqqAXPR5bm/phdXe7+LvgXWwQl1PrSfT2Y1H82e7nfjWfTcCD6mg5BxLn8IyKoN7pruBWlM20MKYjOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95a12796a329d64525c1882371082073b03c670c2ee21ba9cbe15c7b6e4d6cd7","last_reissued_at":"2026-07-23T00:23:44.695232Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T00:23:44.695232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.19359","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-07-23T00:23:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLYznS35j+2mryvCcFGXyxzKF6VN+yCwQ5s0pzcagYmL6PF/gDSfTCAcQl5Y7AaMgOksDXtgDseUpv+DaJjAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:01:03.327444Z"},"content_sha256":"0fa230c1cebfc3bd1a5590f6529c1d8f56803d236faeb2ead0d6442458696839","schema_version":"1.0","event_id":"sha256:0fa230c1cebfc3bd1a5590f6529c1d8f56803d236faeb2ead0d6442458696839"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SWQSPFVDFHLEKJOBRARXCCBAOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Profile-Graph Memory for LLM Agents: Implicit Cross-Entity Traversal through Narrative Profiles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Shengtong Zhu","submitted_at":"2026-06-01T09:48:16Z","abstract_excerpt":"Long-term memory is essential for LLM agents that interact across sessions, yet current memory benchmarks primarily evaluate single-hop recall, leaving multi-hop association largely unmeasured. We make three contributions. First, we introduce MemHop, a multi-hop memory benchmark of 1,000 questions at hop depths 1-5 across 10 social-network scenarios, with per-hop evidence annotations. Second, we present Profile-Graph Memory (ProGraph), a two-layer memory architecture combining (i) profile expansion -- substring-matched traversal of entity names that naturally appear in LLM-written profile narr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19359","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/2607.19359/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-07-23T00:23:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LBBtdhKTN6nEpoJSqReQNvr9Bp+nSVwN7grS5GaHuz3o4nBw3SCNSdTkfEXmRQ0fXV3mJChkrsjspJUrlBkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:01:03.328170Z"},"content_sha256":"7e63cf71743f891ca7a7614795bfb5774094fe21ab8ddd442b80c481ee1d0dc3","schema_version":"1.0","event_id":"sha256:7e63cf71743f891ca7a7614795bfb5774094fe21ab8ddd442b80c481ee1d0dc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWQSPFVDFHLEKJOBRARXCCBAOO/bundle.json","state_url":"https://pith.science/pith/SWQSPFVDFHLEKJOBRARXCCBAOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWQSPFVDFHLEKJOBRARXCCBAOO/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-04T11:01:03Z","links":{"resolver":"https://pith.science/pith/SWQSPFVDFHLEKJOBRARXCCBAOO","bundle":"https://pith.science/pith/SWQSPFVDFHLEKJOBRARXCCBAOO/bundle.json","state":"https://pith.science/pith/SWQSPFVDFHLEKJOBRARXCCBAOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWQSPFVDFHLEKJOBRARXCCBAOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SWQSPFVDFHLEKJOBRARXCCBAOO","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":"d63e83d312d28a99465119a138853e5283e4c4f942bfd18f70fbbb96b0f4aaf1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-01T09:48:16Z","title_canon_sha256":"ee57dd308b52226d8cb4099914487356c05533c80df6869f4217703140a6e897"},"schema_version":"1.0","source":{"id":"2607.19359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.19359","created_at":"2026-07-23T00:23:44Z"},{"alias_kind":"arxiv_version","alias_value":"2607.19359v1","created_at":"2026-07-23T00:23:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19359","created_at":"2026-07-23T00:23:44Z"},{"alias_kind":"pith_short_12","alias_value":"SWQSPFVDFHLE","created_at":"2026-07-23T00:23:44Z"},{"alias_kind":"pith_short_16","alias_value":"SWQSPFVDFHLEKJOB","created_at":"2026-07-23T00:23:44Z"},{"alias_kind":"pith_short_8","alias_value":"SWQSPFVD","created_at":"2026-07-23T00:23:44Z"}],"graph_snapshots":[{"event_id":"sha256:7e63cf71743f891ca7a7614795bfb5774094fe21ab8ddd442b80c481ee1d0dc3","target":"graph","created_at":"2026-07-23T00:23:44Z","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/2607.19359/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Long-term memory is essential for LLM agents that interact across sessions, yet current memory benchmarks primarily evaluate single-hop recall, leaving multi-hop association largely unmeasured. We make three contributions. First, we introduce MemHop, a multi-hop memory benchmark of 1,000 questions at hop depths 1-5 across 10 social-network scenarios, with per-hop evidence annotations. Second, we present Profile-Graph Memory (ProGraph), a two-layer memory architecture combining (i) profile expansion -- substring-matched traversal of entity names that naturally appear in LLM-written profile narr","authors_text":"Shengtong Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-01T09:48:16Z","title":"Profile-Graph Memory for LLM Agents: Implicit Cross-Entity Traversal through Narrative Profiles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19359","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:0fa230c1cebfc3bd1a5590f6529c1d8f56803d236faeb2ead0d6442458696839","target":"record","created_at":"2026-07-23T00:23:44Z","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":"d63e83d312d28a99465119a138853e5283e4c4f942bfd18f70fbbb96b0f4aaf1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-01T09:48:16Z","title_canon_sha256":"ee57dd308b52226d8cb4099914487356c05533c80df6869f4217703140a6e897"},"schema_version":"1.0","source":{"id":"2607.19359","kind":"arxiv","version":1}},"canonical_sha256":"95a12796a329d64525c1882371082073b03c670c2ee21ba9cbe15c7b6e4d6cd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95a12796a329d64525c1882371082073b03c670c2ee21ba9cbe15c7b6e4d6cd7","first_computed_at":"2026-07-23T00:23:44.695232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T00:23:44.695232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T3WUdAiqqAXPR5bm/phdXe7+LvgXWwQl1PrSfT2Y1H82e7nfjWfTcCD6mg5BxLn8IyKoN7pruBWlM20MKYjOBA==","signature_status":"signed_v1","signed_at":"2026-07-23T00:23:44.696170Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.19359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fa230c1cebfc3bd1a5590f6529c1d8f56803d236faeb2ead0d6442458696839","sha256:7e63cf71743f891ca7a7614795bfb5774094fe21ab8ddd442b80c481ee1d0dc3"],"state_sha256":"7c9f282bba67bace437441da8f39c15086a9cb331cdcfd78055b02146367c60e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QHYL2ELpXJdNQlLlqhE9chDvEgH5l+p0lgBnm7yn1kiP6UZutKwFywRiSyb+Flclv9t/sZ1QSZWfa+v0lqCPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T11:01:03.332127Z","bundle_sha256":"913b6863ee5b9f578f03998f2f7cf73867a5a842b4e7fb712de14b981d9068f5"}}