{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WTC3UJSYIUBHMWCUUNQEEHCI6T","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":"37a797d7a53969ad7ef243d5dfefb403596f2fa835b9a053de00bea5c7a233d8","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2026-05-14T08:35:20Z","title_canon_sha256":"d141483ca9ee10b298580f479484a43a61f4089b2ee2b06db5564932157153f0"},"schema_version":"1.0","source":{"id":"2605.14563","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14563","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14563v1","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14563","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"WTC3UJSYIUBH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WTC3UJSYIUBHMWCU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WTC3UJSY","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:1e63e5c8adc44802600478b74480b445eb621ec26aa21e106d3ff9afa8a6ac14","target":"graph","created_at":"2026-05-17T23:39:05Z","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":"MemDocAgent achieves the best performance over both open and closed-source baselines and demonstrates practical applicability in real software development workflows."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the Dependency-Aware Traversal Guiding and interactions with RepoMemory will reliably produce consistent and hierarchical documentation without introducing new conflicts or requiring extensive manual correction."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"MemDocAgent generates consistent hierarchical repository-level code documentation by combining dependency-aware traversal with memory-guided agent interactions that accumulate work traces."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"MemDocAgent generates consistent hierarchical documentation for entire repositories by planning dependency order and consulting a shared memory of prior work traces."}],"snapshot_sha256":"ce51a3ebba7b39233cfdf22c2d2f8bddae71cf3adac5fd3f12eecca6b534965e"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5a2cad01d62fbe69213a052cfd2bdb6e4042f6a2d2d3059cd92dc7ee4027ac5e"},"paper":{"abstract_excerpt":"Automated code documentation is essential for modern software development, providing the contextual grounding that both human developers and coding agents rely on to navigate large codebases. Existing repository-level approaches process components independently, causing redundant retrieval and conflicting descriptions across documents while producing outputs that lack hierarchical structure. Therefore, we propose MemDocAgent, a long-horizon agentic framework that generates documentation within a single, integrated context spanning the entire repository. It combines two components: (i) Dependen","authors_text":"Changkyu Choi, Jaehoon Lee, Jee-Hyong Lee, Suyoung Bae, YunSeok Choi","cross_cats":["cs.CL"],"headline":"MemDocAgent generates consistent hierarchical documentation for entire repositories by planning dependency order and consulting a shared memory of prior work traces.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2026-05-14T08:35:20Z","title":"Remember Your Trace: Memory-Guided Long-Horizon Agentic Framework for Consistent and Hierarchical Repository-Level Code Documentation"},"references":{"count":91,"internal_anchors":7,"resolved_work":91,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"DocAgent: A multi-agent system for automated code documentation generation","work_id":"bd4961ba-13cc-4969-b569-4a4311b8de9d","year":2025},{"cited_arxiv_id":"2510.24428","doi":"","is_internal_anchor":true,"ref_index":2,"title":"CodeWiki: Evaluating AI's Ability to Generate Holistic Documentation for Large-Scale Codebases","work_id":"63d67cc9-9977-469d-b4d1-7f1fd3b4ce84","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"RepoAgent: An LLM-powered open-source framework for repository-level code documentation generation","work_id":"807776a6-5142-4381-b717-13c2638f7ee5","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Precise documentation: The key to better software","work_id":"d73aca9b-4efb-4e33-9fdc-20dc8fe821d9","year":2010},{"cited_arxiv_id":"","doi":"10.1016/j.infsof.2014.08.003","is_internal_anchor":false,"ref_index":5,"title":"Usage and usefulness of technical software documentation: An industrial case study.Information and Software Technology, 57:664–682, 2015","work_id":"975376a6-29b7-415c-8f28-d828b36b96c1","year":2015}],"snapshot_sha256":"062244a979b34839f86912e98e72b08b1c362d09437a9edff66b352a64cf1a08"},"source":{"id":"2605.14563","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:34:03.872531Z","id":"bc807989-1179-4204-b8eb-c0d7ae0aac81","model_set":{"reader":"grok-4.3"},"one_line_summary":"MemDocAgent generates consistent hierarchical repository-level code documentation by combining dependency-aware traversal with memory-guided agent interactions that accumulate work traces.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"MemDocAgent generates consistent hierarchical documentation for entire repositories by planning dependency order and consulting a shared memory of prior work traces.","strongest_claim":"MemDocAgent achieves the best performance over both open and closed-source baselines and demonstrates practical applicability in real software development workflows.","weakest_assumption":"That the Dependency-Aware Traversal Guiding and interactions with RepoMemory will reliably produce consistent and hierarchical documentation without introducing new conflicts or requiring extensive manual correction."}},"verdict_id":"bc807989-1179-4204-b8eb-c0d7ae0aac81"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e9f2eae0befecd18c60de5bc61076bb61dddf9e4d58a4aaf68912dfa4f4f9a5f","target":"record","created_at":"2026-05-17T23:39:05Z","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":"37a797d7a53969ad7ef243d5dfefb403596f2fa835b9a053de00bea5c7a233d8","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2026-05-14T08:35:20Z","title_canon_sha256":"d141483ca9ee10b298580f479484a43a61f4089b2ee2b06db5564932157153f0"},"schema_version":"1.0","source":{"id":"2605.14563","kind":"arxiv","version":1}},"canonical_sha256":"b4c5ba26584502765854a360421c48f4eb46cc805b48cbbafc3f03dfbf423247","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4c5ba26584502765854a360421c48f4eb46cc805b48cbbafc3f03dfbf423247","first_computed_at":"2026-05-17T23:39:05.567333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:05.567333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AI+JdCxJ7j7BshE5Hz2dL9WK0/DATjkyu2++fuPlFkkJuurKlLXsFaLSQPUfRWQBtFHosZTSRaXhNv8XDoHaCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:05.568142Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14563","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9f2eae0befecd18c60de5bc61076bb61dddf9e4d58a4aaf68912dfa4f4f9a5f","sha256:1e63e5c8adc44802600478b74480b445eb621ec26aa21e106d3ff9afa8a6ac14"],"state_sha256":"cfa9a7502e50c019344736b52706bc0297aaca7db597ef2f0d95adcf6ddd04ac"}