{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:U6MNJV2KFLQU5KZRG7XA5IPJ6X","short_pith_number":"pith:U6MNJV2K","canonical_record":{"source":{"id":"2504.08525","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-11T13:38:36Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"3eaccfeca8211812805e6f300328721554a3f4dec7b40d21cc43de5a959b522c","abstract_canon_sha256":"4c5ab66558257256a220472fdbc1e5f6b9bd84dc408e98d9e34d0e77c8d5db9b"},"schema_version":"1.0"},"canonical_sha256":"a798d4d74a2ae14eab3137ee0ea1e9f5d7ec4ac9c15de51858f9785bde72499a","source":{"kind":"arxiv","id":"2504.08525","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.08525","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"arxiv_version","alias_value":"2504.08525v4","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08525","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"pith_short_12","alias_value":"U6MNJV2KFLQU","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"pith_short_16","alias_value":"U6MNJV2KFLQU5KZR","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"pith_short_8","alias_value":"U6MNJV2K","created_at":"2026-07-05T11:57:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:U6MNJV2KFLQU5KZRG7XA5IPJ6X","target":"record","payload":{"canonical_record":{"source":{"id":"2504.08525","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-11T13:38:36Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"3eaccfeca8211812805e6f300328721554a3f4dec7b40d21cc43de5a959b522c","abstract_canon_sha256":"4c5ab66558257256a220472fdbc1e5f6b9bd84dc408e98d9e34d0e77c8d5db9b"},"schema_version":"1.0"},"canonical_sha256":"a798d4d74a2ae14eab3137ee0ea1e9f5d7ec4ac9c15de51858f9785bde72499a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:55.950694Z","signature_b64":"TjBCUwrpRu5v1JdDmQsnLsb/mmClvpexWJiZG45GWJTEi+hvPeOw4Uv12HWbGoDYunt/T3LK28DQqUcnEanLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a798d4d74a2ae14eab3137ee0ea1e9f5d7ec4ac9c15de51858f9785bde72499a","last_reissued_at":"2026-07-05T11:57:55.950201Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:55.950201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.08525","source_version":4,"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-05T11:57:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDywnZvp3/mGpb5UgEckEuEPCbIKFBLsMzRpiQrjOGbARsjXf8A4bJaiilIUd08h2KIDvtXVBfInuFrjmfwnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:27:03.296690Z"},"content_sha256":"a9420b10d1ae9b6d6a7b4bf311395d387094456ed59dc1d3ad9bc7d1a20adba4","schema_version":"1.0","event_id":"sha256:a9420b10d1ae9b6d6a7b4bf311395d387094456ed59dc1d3ad9bc7d1a20adba4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:U6MNJV2KFLQU5KZRG7XA5IPJ6X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Task Memory Engine (TME): Enhancing State Awareness for Multi-Step LLM Agent Tasks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Ye Ye","submitted_at":"2025-04-11T13:38:36Z","abstract_excerpt":"Large Language Models (LLMs) are increasingly used as autonomous agents for multi-step tasks. However, most existing frameworks fail to maintain a structured understanding of the task state, often relying on linear prompt concatenation or shallow memory buffers. This leads to brittle performance, frequent hallucinations, and poor long-range coherence. In this work, we propose the Task Memory Engine (TME), a lightweight and structured memory module that tracks task execution using a hierarchical Task Memory Tree (TMT). Each node in the tree corresponds to a task step, storing relevant input, ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08525","kind":"arxiv","version":4},"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/2504.08525/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-05T11:57:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ATNW6sMG4cjzWpxPp/EzkRwAA48u+5uFNMDbrhlwGQ7Sk+hIRF1bGSwmYnbbLlCNEKNu0cMKj78zrZz59+LnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:27:03.297216Z"},"content_sha256":"8845c042a47fc379f2e9cf1e3c6c15a45edf3ad17cf285570491ca0afdb94df3","schema_version":"1.0","event_id":"sha256:8845c042a47fc379f2e9cf1e3c6c15a45edf3ad17cf285570491ca0afdb94df3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6MNJV2KFLQU5KZRG7XA5IPJ6X/bundle.json","state_url":"https://pith.science/pith/U6MNJV2KFLQU5KZRG7XA5IPJ6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6MNJV2KFLQU5KZRG7XA5IPJ6X/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-08T20:27:03Z","links":{"resolver":"https://pith.science/pith/U6MNJV2KFLQU5KZRG7XA5IPJ6X","bundle":"https://pith.science/pith/U6MNJV2KFLQU5KZRG7XA5IPJ6X/bundle.json","state":"https://pith.science/pith/U6MNJV2KFLQU5KZRG7XA5IPJ6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6MNJV2KFLQU5KZRG7XA5IPJ6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:U6MNJV2KFLQU5KZRG7XA5IPJ6X","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":"4c5ab66558257256a220472fdbc1e5f6b9bd84dc408e98d9e34d0e77c8d5db9b","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-11T13:38:36Z","title_canon_sha256":"3eaccfeca8211812805e6f300328721554a3f4dec7b40d21cc43de5a959b522c"},"schema_version":"1.0","source":{"id":"2504.08525","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.08525","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"arxiv_version","alias_value":"2504.08525v4","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08525","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"pith_short_12","alias_value":"U6MNJV2KFLQU","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"pith_short_16","alias_value":"U6MNJV2KFLQU5KZR","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"pith_short_8","alias_value":"U6MNJV2K","created_at":"2026-07-05T11:57:55Z"}],"graph_snapshots":[{"event_id":"sha256:8845c042a47fc379f2e9cf1e3c6c15a45edf3ad17cf285570491ca0afdb94df3","target":"graph","created_at":"2026-07-05T11:57:55Z","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/2504.08525/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large Language Models (LLMs) are increasingly used as autonomous agents for multi-step tasks. However, most existing frameworks fail to maintain a structured understanding of the task state, often relying on linear prompt concatenation or shallow memory buffers. This leads to brittle performance, frequent hallucinations, and poor long-range coherence. In this work, we propose the Task Memory Engine (TME), a lightweight and structured memory module that tracks task execution using a hierarchical Task Memory Tree (TMT). Each node in the tree corresponds to a task step, storing relevant input, ou","authors_text":"Ye Ye","cross_cats":["cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-11T13:38:36Z","title":"Task Memory Engine (TME): Enhancing State Awareness for Multi-Step LLM Agent Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08525","kind":"arxiv","version":4},"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:a9420b10d1ae9b6d6a7b4bf311395d387094456ed59dc1d3ad9bc7d1a20adba4","target":"record","created_at":"2026-07-05T11:57:55Z","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":"4c5ab66558257256a220472fdbc1e5f6b9bd84dc408e98d9e34d0e77c8d5db9b","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-11T13:38:36Z","title_canon_sha256":"3eaccfeca8211812805e6f300328721554a3f4dec7b40d21cc43de5a959b522c"},"schema_version":"1.0","source":{"id":"2504.08525","kind":"arxiv","version":4}},"canonical_sha256":"a798d4d74a2ae14eab3137ee0ea1e9f5d7ec4ac9c15de51858f9785bde72499a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a798d4d74a2ae14eab3137ee0ea1e9f5d7ec4ac9c15de51858f9785bde72499a","first_computed_at":"2026-07-05T11:57:55.950201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:57:55.950201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TjBCUwrpRu5v1JdDmQsnLsb/mmClvpexWJiZG45GWJTEi+hvPeOw4Uv12HWbGoDYunt/T3LK28DQqUcnEanLCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:57:55.950694Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.08525","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9420b10d1ae9b6d6a7b4bf311395d387094456ed59dc1d3ad9bc7d1a20adba4","sha256:8845c042a47fc379f2e9cf1e3c6c15a45edf3ad17cf285570491ca0afdb94df3"],"state_sha256":"58cec8680e7abdf4c9e8a24081d59546488d92b59978399c5b5f69c66131e360"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2kY14F/V0bqKdICVkSM/C5WulIceXypkZWzDiCFAWEwTjrqr28m1VfaJeKATKycbdhGwz5K+qXsrwxdVb4sQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:27:03.301940Z","bundle_sha256":"1e4df160fd9faf56e7b5c4bfbfea5001b44a2a0a866bb3a56f8d6551e3176c0a"}}