{"id":"7bd2647ea6ef8751bf246547ee52d6b7640cd0d7be49b00c2bde7c247140301d","title":"HarnessMM: Recursive Self-Improvement for Harness Token Efficiency","argument":"Yuhua Jiang, Chang Xu, Feifei Gao and Li Zhao present HarnessMM, a research project that aims to reduce repeated reasoning in agent harnesses: software that coordinates model reasoning, tool execution and feedback. Their approach uses recursive self-improvement to refine prompts, context settings and adapter rules with training feedback, while validation selects configurations. At inference time, a controller reuses decisions when observed feedback meets specified guards; the actor’s weights stay fixed, and the actor resumes when further reasoning is needed. The authors report results across coding, tool-based and visual-agent settings. On HumanEval, they report preserving Codex success while reducing tokens per task; on DeepSeek Harness, they report both improved success and fewer tokens. An MBPP ablation also reports lower cost than two comparison approaches. These results illustrate the report’s proposed tradeoff: avoid redundant reasoning callbacks without replacing the actor’s ability to reason when reuse conditions fail. The abstract summarizes empirical results but does not provide the task-level evidence or evaluation details needed to assess how broadly the results apply.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The evidence is the arXiv abstract, which summarizes results but does not include task-level evaluation details. The abstract says optimization overhead and execution time are documented where measured, but does not give those measurements here. The reported results are tied to the named benchmarks and settings; the abstract does not establish performance in other settings.","speaker":{"name":"Jiang, Yuhua, Xu, Chang, Gao, Feifei, Zhao, Li","roleAtSource":"Article author"},"source":{"title":"HarnessMM: Recursive Self-Improvement for Harness Token Efficiency","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2610.32813","publishedAt":"2026-10-23","dateBasis":"Date basis not provided."},"evidence":[{"text":"The authors describe HarnessMM as reducing repeated reasoning by reusing decisions when observed feedback satisfies guards, while keeping actor weights fixed and resuming reasoning when needed.","excerpt":"At inference time, a controller reuses resolved decisions while keeping actor weights fixed. Executable Decision Graphs encode actions, arguments, dependencies, and guards.","url":"https://arxiv.org/abs/2610.32813","relationship":"Source-stated"},{"text":"The authors report that on HumanEval, HarnessMM preserves Codex success while reducing tokens per task from 66.72k to 47.02k.","excerpt":"On HumanEval, HarnessMM preserves Codex success at 90.82\\% while reducing tokens per task from 66.72k to 47.02k (29.54\\% saving).","url":"https://arxiv.org/abs/2610.32813","relationship":"Source-stated"},{"text":"For DeepSeek Harness, the authors report higher success and fewer tokens with HarnessMM than the comparison figures given in the abstract.","excerpt":"For DeepSeek Harness, success improves from 71.43\\% to 85.71\\% while tokens decrease from 96.28k to 11.62k (87.93\\% saving).","url":"https://arxiv.org/abs/2610.32813","relationship":"Source-stated"},{"text":"The authors report that an MBPP ablation found lower cost than both single-use graphs and retained callbacks.","excerpt":"An MBPP ablation shows 26.91\\% lower cost than single-use graphs and 19.52\\% lower cost than retained callbacks.","url":"https://arxiv.org/abs/2610.32813","relationship":"Source-stated"},{"text":"The report covers coding, tool-based and visual-agent settings, but its abstract does not give task-level evaluation details for assessing how broadly the findings apply.","excerpt":"This technical report consolidates its shared framework, implementations, and empirical studies across coding, tool-based, and visual-agent settings.","url":"https://arxiv.org/abs/2610.32813","relationship":"Escape Meridian interpretation"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2610.32813","checkedAt":"2026-11-12T20:48:10.690Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How do the reported results vary across tasks and evaluation conditions within the coding, tool-based and visual-agent settings?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"HarnessMM: Recursive Self-Improvement for Harness Token Efficiency","summary":"Yuhua Jiang, Chang Xu, Feifei Gao and Li Zhao present HarnessMM, a research project that aims to reduce repeated reasoning in agent harnesses: software that coordinates model reasoning, tool execution and feedback. Their approach uses recursive self-improvement to refine prompts, context settings and adapter rules with training feedback, while validation selects configurations. At inference time, a controller reuses decisions when observed feedback meets specified guards; the actor’s weights stay fixed, and the actor resumes when further reasoning is needed. The authors report results across coding, tool-based and visual-agent settings. On HumanEval, they report preserving Codex success while reducing tokens per task; on DeepSeek Harness, they report both improved success and fewer tokens. An MBPP ablation also reports lower cost than two comparison approaches. These results illustrate the report’s proposed tradeoff: avoid redundant reasoning callbacks without replacing the actor’s ability to reason when reuse conditions fail. The abstract summarizes empirical results but does not provide the task-level evidence or evaluation details needed to assess how broadly the results apply.","question":"How do the reported results vary across tasks and evaluation conditions within the coding, tool-based and visual-agent settings?","claims":[{"text":"The authors describe HarnessMM as reducing repeated reasoning by reusing decisions when observed feedback satisfies guards, while keeping actor weights fixed and resuming reasoning when needed.","excerpt":"At inference time, a controller reuses resolved decisions while keeping actor weights fixed. Executable Decision Graphs encode actions, arguments, dependencies, and guards.","support":"source-stated"},{"text":"The authors report that on HumanEval, HarnessMM preserves Codex success while reducing tokens per task from 66.72k to 47.02k.","excerpt":"On HumanEval, HarnessMM preserves Codex success at 90.82\\% while reducing tokens per task from 66.72k to 47.02k (29.54\\% saving).","support":"source-stated"},{"text":"For DeepSeek Harness, the authors report higher success and fewer tokens with HarnessMM than the comparison figures given in the abstract.","excerpt":"For DeepSeek Harness, success improves from 71.43\\% to 85.71\\% while tokens decrease from 96.28k to 11.62k (87.93\\% saving).","support":"source-stated"},{"text":"The authors report that an MBPP ablation found lower cost than both single-use graphs and retained callbacks.","excerpt":"An MBPP ablation shows 26.91\\% lower cost than single-use graphs and 19.52\\% lower cost than retained callbacks.","support":"source-stated"},{"text":"The report covers coding, tool-based and visual-agent settings, but its abstract does not give task-level evaluation details for assessing how broadly the findings apply.","excerpt":"This technical report consolidates its shared framework, implementations, and empirical studies across coding, tool-based, and visual-agent settings.","support":"interpretation"}],"limitations":["The evidence is the arXiv abstract, which summarizes results but does not include task-level evaluation details.","The abstract says optimization overhead and execution time are documented where measured, but does not give those measurements here.","The reported results are tied to the named benchmarks and settings; the abstract does not establish performance in other settings."],"mediaId":"302d003c6e0122f193af6864d44fad3df62d6391e9e1e70e2f7b236ff8616f02","correctionReason":null,"id":"7bd2647ea6ef8751bf246547ee52d6b7640cd0d7be49b00c2bde7c247140301d","publicationId":"7d6a3549-28a3-4431-8a19-651918be8ec8","version":1,"sourceUrl":"https://arxiv.org/abs/2610.32813","sourceTitle":"HarnessMM: Recursive Self-Improvement for Harness Token Efficiency","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-10-23","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-10-26T06:01:14.319Z","createdAt":"2026-11-12T20:32:30.401Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"302d003c6e0122f193af6864d44fad3df62d6391e9e1e70e2f7b236ff8616f02","kind":"article","url":"https://arxiv.org/abs/2610.32813","sourceUrl":"https://arxiv.org/abs/2610.32813","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-12T18:20:13.117Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2610.32813","checkedAt":"2026-11-12T20:48:10.690Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v6","mediaId":"302d003c6e0122f193af6864d44fad3df62d6391e9e1e70e2f7b236ff8616f02","confidence":0.65,"provider":"typesafe","model":"jev-1.13.0","inputHash":"d123177faded307ba2c2efe34bd4460af8ef8284d4e126d243a928fc072e729c","decidedAt":"2026-11-12T18:20:16.469Z"},"provenance":{"textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observationId":"be9533160645fa7ef15f8e798936cdc25ca6afe8659755686bfd47fb2f17f49d","retrievedAt":"2026-11-12T18:20:12.673Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"44496b51-1279-4d82-8d48-bbdac2f3079c"},"reviewer":{"model":"gpt-6-luna","runId":"48dc1574-1024-45cf-8e6d-5e051f3ab998"}},"audit":{"status":"passed","reviewedAt":"2026-11-12T20:32:30.401Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Jiang, Yuhua","url":null,"kind":"unknown"},{"name":"Xu, Chang","url":null,"kind":"unknown"},{"name":"Gao, Feifei","url":null,"kind":"unknown"},{"name":"Zhao, Li","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Jiang, Yuhua","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Jiang, Yuhua","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2610.32813","locator":"head/meta[name=author|citation_author]"},"assertionId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-12T20:48:10.690Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae","sourceUrl":"https://arxiv.org/abs/2610.32813","contentSha256":"0b20e75035137f11f63945bfdff56fe7e34147fa82fcbc6dde4aab68751637bb","textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observedAt":"2026-11-12T20:48:10.690Z"}},{"actor":{"name":"Xu, Chang","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Xu, Chang","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2610.32813","locator":"head/meta[name=author|citation_author]"},"assertionId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-12T20:48:10.690Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae","sourceUrl":"https://arxiv.org/abs/2610.32813","contentSha256":"0b20e75035137f11f63945bfdff56fe7e34147fa82fcbc6dde4aab68751637bb","textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observedAt":"2026-11-12T20:48:10.690Z"}},{"actor":{"name":"Gao, Feifei","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Gao, Feifei","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2610.32813","locator":"head/meta[name=author|citation_author]"},"assertionId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae:participation:2","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-12T20:48:10.690Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae","sourceUrl":"https://arxiv.org/abs/2610.32813","contentSha256":"0b20e75035137f11f63945bfdff56fe7e34147fa82fcbc6dde4aab68751637bb","textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observedAt":"2026-11-12T20:48:10.690Z"}},{"actor":{"name":"Zhao, Li","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Zhao, Li","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2610.32813","locator":"head/meta[name=author|citation_author]"},"assertionId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae:participation:3","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-12T20:48:10.690Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae","sourceUrl":"https://arxiv.org/abs/2610.32813","contentSha256":"0b20e75035137f11f63945bfdff56fe7e34147fa82fcbc6dde4aab68751637bb","textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observedAt":"2026-11-12T20:48:10.690Z"}}],"participationCoverage":{"total":4,"returned":4,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2610.32813","snapshotId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae","contentSha256":"0b20e75035137f11f63945bfdff56fe7e34147fa82fcbc6dde4aab68751637bb","textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observedAt":"2026-11-12T20:48:10.690Z","basis":"publisher-page-metadata","sourceLinks":45,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/7bd2647ea6ef8751bf246547ee52d6b7640cd0d7be49b00c2bde7c247140301d/source"}},"canonicalUrl":"https://escapemeridian.com/readings/harnessmm-recursive-self-improvement-for-harness-token-7bd2647e","formats":{"html":"/readings/harnessmm-recursive-self-improvement-for-harness-token-7bd2647e","markdown":"/readings/harnessmm-recursive-self-improvement-for-harness-token-7bd2647e.md","json":"/readings/harnessmm-recursive-self-improvement-for-harness-token-7bd2647e.json"},"attribution":"Headline and summary by Escape Meridian, prepared by Luna from the attributed source. A source check is not independent confirmation of the source’s claims.","maintainedGuideLinks":[],"readerContext":{"version":"reader-context-v1","attribution":"Reference context selected by Escape Meridian; separate from source evidence. Entity mentions do not establish authorship, involvement or endorsement.","terms":[{"id":"term-recursive-self-improvement","name":"Recursive self-improvement","explanation":"An AI system improving its own capabilities, such as its code, training methods or reasoning, then using the gains to improve further. Each cycle could hypothetically produce a more capable system.","referenceUrl":"https://hai.stanford.edu/what-is-recursive-self-improvement"},{"id":"term-benchmark","name":"Benchmark","explanation":"A defined set of tests used to compare systems. Results depend on the tasks and measures selected.","referenceUrl":"https://arxiv.org/abs/2211.09110"}],"entities":[{"id":"arxiv","name":"arXiv","kind":"organization","context":"arXiv is a research manuscript repository where authors share papers that may not yet have been peer reviewed.","referenceUrls":["https://arxiv.org/","https://info.arxiv.org/help/api/index.html"],"path":"/entities/arxiv","json":"/entities/arxiv.json","markdown":"/entities/arxiv.md"},{"id":"time","name":"TIME","kind":"organization","context":"TIME is a news magazine publishing reporting on world affairs, business, technology and the workers behind digital services.","referenceUrls":["https://time.com/"],"path":"/entities/time","json":"/entities/time.json","markdown":"/entities/time.md"}]},"researchQuestions":[],"withdrawn":false,"references":{"schemaVersion":1,"target":{"type":"reading","id":"7bd2647ea6ef8751bf246547ee52d6b7640cd0d7be49b00c2bde7c247140301d","revision":"7d6a3549-28a3-4431-8a19-651918be8ec8","revisionKind":"publication-id","title":"HarnessMM: Recursive Self-Improvement for Harness Token Efficiency","url":"https://escapemeridian.com/readings/harnessmm-recursive-self-improvement-for-harness-token-7bd2647e"},"source":{"type":"source","id":"https://arxiv.org/abs/2610.32813","revision":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","revisionKind":"sha256-source-text","title":"HarnessMM: Recursive Self-Improvement for Harness Token Efficiency","url":"https://arxiv.org/abs/2610.32813"},"status":"available","items":[],"next":null,"scope":"Explicit citations in public readings and public file attachments to this reading. Shared topics are not citations. Other artifact types need an explicit reference adapter."},"revisions":[{"id":"7bd2647ea6ef8751bf246547ee52d6b7640cd0d7be49b00c2bde7c247140301d","title":"HarnessMM: Recursive Self-Improvement for Harness Token Efficiency","argument":"Yuhua Jiang, Chang Xu, Feifei Gao and Li Zhao present HarnessMM, a research project that aims to reduce repeated reasoning in agent harnesses: software that coordinates model reasoning, tool execution and feedback. Their approach uses recursive self-improvement to refine prompts, context settings and adapter rules with training feedback, while validation selects configurations. At inference time, a controller reuses decisions when observed feedback meets specified guards; the actor’s weights stay fixed, and the actor resumes when further reasoning is needed. The authors report results across coding, tool-based and visual-agent settings. On HumanEval, they report preserving Codex success while reducing tokens per task; on DeepSeek Harness, they report both improved success and fewer tokens. An MBPP ablation also reports lower cost than two comparison approaches. These results illustrate the report’s proposed tradeoff: avoid redundant reasoning callbacks without replacing the actor’s ability to reason when reuse conditions fail. The abstract summarizes empirical results but does not provide the task-level evidence or evaluation details needed to assess how broadly the results apply.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The evidence is the arXiv abstract, which summarizes results but does not include task-level evaluation details. The abstract says optimization overhead and execution time are documented where measured, but does not give those measurements here. The reported results are tied to the named benchmarks and settings; the abstract does not establish performance in other settings.","speaker":{"name":"Jiang, Yuhua, Xu, Chang, Gao, Feifei, Zhao, Li","roleAtSource":"Article author"},"source":{"title":"HarnessMM: Recursive Self-Improvement for Harness Token Efficiency","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2610.32813","publishedAt":"2026-10-23","dateBasis":"Date basis not provided."},"evidence":[{"text":"The authors describe HarnessMM as reducing repeated reasoning by reusing decisions when observed feedback satisfies guards, while keeping actor weights fixed and resuming reasoning when needed.","excerpt":"At inference time, a controller reuses resolved decisions while keeping actor weights fixed. Executable Decision Graphs encode actions, arguments, dependencies, and guards.","url":"https://arxiv.org/abs/2610.32813","relationship":"Source-stated"},{"text":"The authors report that on HumanEval, HarnessMM preserves Codex success while reducing tokens per task from 66.72k to 47.02k.","excerpt":"On HumanEval, HarnessMM preserves Codex success at 90.82\\% while reducing tokens per task from 66.72k to 47.02k (29.54\\% saving).","url":"https://arxiv.org/abs/2610.32813","relationship":"Source-stated"},{"text":"For DeepSeek Harness, the authors report higher success and fewer tokens with HarnessMM than the comparison figures given in the abstract.","excerpt":"For DeepSeek Harness, success improves from 71.43\\% to 85.71\\% while tokens decrease from 96.28k to 11.62k (87.93\\% saving).","url":"https://arxiv.org/abs/2610.32813","relationship":"Source-stated"},{"text":"The authors report that an MBPP ablation found lower cost than both single-use graphs and retained callbacks.","excerpt":"An MBPP ablation shows 26.91\\% lower cost than single-use graphs and 19.52\\% lower cost than retained callbacks.","url":"https://arxiv.org/abs/2610.32813","relationship":"Source-stated"},{"text":"The report covers coding, tool-based and visual-agent settings, but its abstract does not give task-level evaluation details for assessing how broadly the findings apply.","excerpt":"This technical report consolidates its shared framework, implementations, and empirical studies across coding, tool-based, and visual-agent settings.","url":"https://arxiv.org/abs/2610.32813","relationship":"Escape Meridian interpretation"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2610.32813","checkedAt":"2026-11-12T20:48:10.690Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How do the reported results vary across tasks and evaluation conditions within the coding, tool-based and visual-agent settings?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"HarnessMM: Recursive Self-Improvement for Harness Token Efficiency","summary":"Yuhua Jiang, Chang Xu, Feifei Gao and Li Zhao present HarnessMM, a research project that aims to reduce repeated reasoning in agent harnesses: software that coordinates model reasoning, tool execution and feedback. Their approach uses recursive self-improvement to refine prompts, context settings and adapter rules with training feedback, while validation selects configurations. At inference time, a controller reuses decisions when observed feedback meets specified guards; the actor’s weights stay fixed, and the actor resumes when further reasoning is needed. The authors report results across coding, tool-based and visual-agent settings. On HumanEval, they report preserving Codex success while reducing tokens per task; on DeepSeek Harness, they report both improved success and fewer tokens. An MBPP ablation also reports lower cost than two comparison approaches. These results illustrate the report’s proposed tradeoff: avoid redundant reasoning callbacks without replacing the actor’s ability to reason when reuse conditions fail. The abstract summarizes empirical results but does not provide the task-level evidence or evaluation details needed to assess how broadly the results apply.","question":"How do the reported results vary across tasks and evaluation conditions within the coding, tool-based and visual-agent settings?","claims":[{"text":"The authors describe HarnessMM as reducing repeated reasoning by reusing decisions when observed feedback satisfies guards, while keeping actor weights fixed and resuming reasoning when needed.","excerpt":"At inference time, a controller reuses resolved decisions while keeping actor weights fixed. Executable Decision Graphs encode actions, arguments, dependencies, and guards.","support":"source-stated"},{"text":"The authors report that on HumanEval, HarnessMM preserves Codex success while reducing tokens per task from 66.72k to 47.02k.","excerpt":"On HumanEval, HarnessMM preserves Codex success at 90.82\\% while reducing tokens per task from 66.72k to 47.02k (29.54\\% saving).","support":"source-stated"},{"text":"For DeepSeek Harness, the authors report higher success and fewer tokens with HarnessMM than the comparison figures given in the abstract.","excerpt":"For DeepSeek Harness, success improves from 71.43\\% to 85.71\\% while tokens decrease from 96.28k to 11.62k (87.93\\% saving).","support":"source-stated"},{"text":"The authors report that an MBPP ablation found lower cost than both single-use graphs and retained callbacks.","excerpt":"An MBPP ablation shows 26.91\\% lower cost than single-use graphs and 19.52\\% lower cost than retained callbacks.","support":"source-stated"},{"text":"The report covers coding, tool-based and visual-agent settings, but its abstract does not give task-level evaluation details for assessing how broadly the findings apply.","excerpt":"This technical report consolidates its shared framework, implementations, and empirical studies across coding, tool-based, and visual-agent settings.","support":"interpretation"}],"limitations":["The evidence is the arXiv abstract, which summarizes results but does not include task-level evaluation details.","The abstract says optimization overhead and execution time are documented where measured, but does not give those measurements here.","The reported results are tied to the named benchmarks and settings; the abstract does not establish performance in other settings."],"mediaId":"302d003c6e0122f193af6864d44fad3df62d6391e9e1e70e2f7b236ff8616f02","correctionReason":null,"id":"7bd2647ea6ef8751bf246547ee52d6b7640cd0d7be49b00c2bde7c247140301d","publicationId":"7d6a3549-28a3-4431-8a19-651918be8ec8","version":1,"sourceUrl":"https://arxiv.org/abs/2610.32813","sourceTitle":"HarnessMM: Recursive Self-Improvement for Harness Token Efficiency","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-10-23","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-10-26T06:01:14.319Z","createdAt":"2026-11-12T20:32:30.401Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"302d003c6e0122f193af6864d44fad3df62d6391e9e1e70e2f7b236ff8616f02","kind":"article","url":"https://arxiv.org/abs/2610.32813","sourceUrl":"https://arxiv.org/abs/2610.32813","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-12T18:20:13.117Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2610.32813","checkedAt":"2026-11-12T20:48:10.690Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v6","mediaId":"302d003c6e0122f193af6864d44fad3df62d6391e9e1e70e2f7b236ff8616f02","confidence":0.65,"provider":"typesafe","model":"jev-1.13.0","inputHash":"d123177faded307ba2c2efe34bd4460af8ef8284d4e126d243a928fc072e729c","decidedAt":"2026-11-12T18:20:16.469Z"},"provenance":{"textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observationId":"be9533160645fa7ef15f8e798936cdc25ca6afe8659755686bfd47fb2f17f49d","retrievedAt":"2026-11-12T18:20:12.673Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"44496b51-1279-4d82-8d48-bbdac2f3079c"},"reviewer":{"model":"gpt-6-luna","runId":"48dc1574-1024-45cf-8e6d-5e051f3ab998"}},"audit":{"status":"passed","reviewedAt":"2026-11-12T20:32:30.401Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Jiang, Yuhua","url":null,"kind":"unknown"},{"name":"Xu, Chang","url":null,"kind":"unknown"},{"name":"Gao, Feifei","url":null,"kind":"unknown"},{"name":"Zhao, Li","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Jiang, Yuhua","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Jiang, Yuhua","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2610.32813","locator":"head/meta[name=author|citation_author]"},"assertionId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-12T20:48:10.690Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae","sourceUrl":"https://arxiv.org/abs/2610.32813","contentSha256":"0b20e75035137f11f63945bfdff56fe7e34147fa82fcbc6dde4aab68751637bb","textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observedAt":"2026-11-12T20:48:10.690Z"}},{"actor":{"name":"Xu, Chang","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Xu, Chang","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2610.32813","locator":"head/meta[name=author|citation_author]"},"assertionId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-12T20:48:10.690Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae","sourceUrl":"https://arxiv.org/abs/2610.32813","contentSha256":"0b20e75035137f11f63945bfdff56fe7e34147fa82fcbc6dde4aab68751637bb","textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observedAt":"2026-11-12T20:48:10.690Z"}},{"actor":{"name":"Gao, Feifei","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Gao, Feifei","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2610.32813","locator":"head/meta[name=author|citation_author]"},"assertionId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae:participation:2","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-12T20:48:10.690Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae","sourceUrl":"https://arxiv.org/abs/2610.32813","contentSha256":"0b20e75035137f11f63945bfdff56fe7e34147fa82fcbc6dde4aab68751637bb","textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observedAt":"2026-11-12T20:48:10.690Z"}},{"actor":{"name":"Zhao, Li","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Zhao, Li","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2610.32813","locator":"head/meta[name=author|citation_author]"},"assertionId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae:participation:3","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-12T20:48:10.690Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae","sourceUrl":"https://arxiv.org/abs/2610.32813","contentSha256":"0b20e75035137f11f63945bfdff56fe7e34147fa82fcbc6dde4aab68751637bb","textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observedAt":"2026-11-12T20:48:10.690Z"}}],"participationCoverage":{"total":4,"returned":4,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2610.32813","snapshotId":"41f971a2563ce50f603d295fbe817d11b3b49155521b549d4e1dcacd84dc3dae","contentSha256":"0b20e75035137f11f63945bfdff56fe7e34147fa82fcbc6dde4aab68751637bb","textHash":"4c07b99b152eb88da223e0d873c699966594192fc7b67b061e6e096c83d5cca5","observedAt":"2026-11-12T20:48:10.690Z","basis":"publisher-page-metadata","sourceLinks":45,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/7bd2647ea6ef8751bf246547ee52d6b7640cd0d7be49b00c2bde7c247140301d/source"}}}],"audits":[{"publicationId":"7d6a3549-28a3-4431-8a19-651918be8ec8","verdict":"passed","findings":[{"dimension":"attribution","status":"pass","explanation":"The reading names the four listed authors and attributes the method description and every result to them with phrasing such as \"they report.\" It does not present the benchmark outcomes as independently verified.","excerpt":"Authors:Yuhua Jiang, Chang Xu, Feifei Gao, Li Zhao"},{"dimension":"summary","status":"pass","explanation":"The reading leads with the actors and the goal of cutting repeated reasoning. It defines an agent harness in plain language and explains what recursive self-improvement refines here: prompts, context settings and adapter rules, not model weights. It describes the guarded reuse and fallback mechanism and keeps scope limits. Benchmark names such as HumanEval, MBPP and Codex are left to tooltips but are not essential to the main point. The question is open rather than leading. The summary omits the headline percentages, but the claims carry them.","excerpt":"Agent harnesses often invoke reasoning after each tool result, even when earlier calls have already determined subsequent actions."},{"dimension":"date","status":"pass","explanation":"originalPublished is 2026-10-23, which matches the v1 submission date. It does not use the later v2 revision date (6 Nov) or the feed date (9 Nov).","excerpt":"[Submitted on 23 Oct 2026 (v1), last revised 6 Nov 2026 (this version, v2)]"},{"dimension":"support","status":"pass","explanation":"Each claim quotes matching abstract text, and the figures are copied accurately. The single interpretive claim is labeled as interpretation and stays within the evidence by noting only that the abstract lacks task-level details. The limitations correctly note that overhead and execution-time measurements are not shown. No benefits, costs or forecasts are invented.","excerpt":"The report also summarizes the HarnessMM-V visual-agent study and documents optimization overhead and execution time where measured."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified direct arXiv abstract page for this paper, the most direct way to reach the source.","excerpt":null}],"createdAt":"2026-11-12T20:32:30.401Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}