{"as_of":"2026-08-05T03:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9fd29ce7e3e62c523907f135648b494cb136c8c25da741c7a6c83734aabba1ec","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T23:39:48.095337Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2604.11811/citation-record","integrity":"/paper/2604.11811/integrity","json":"/paper/2604.11811/citation-record.json","paper":"/paper/2604.11811"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.19457","last_updated":"2026-02-14T11:42:30Z","snapshot_observed_at":"2026-07-06T22:02:56.216824Z","submitted_at":"2025-07-25T17:42:32Z","title":"GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.19457","snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"GEPA: Reflective prompt evolution can outperform reinforcement learning","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"cited_paper":"/paper/2507.19457","citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:eeba2247f03c5127303be6fe9a58facc51d7ab8c40f974ee2975d66b2a623a5a","observation_id":"3b84bcf3-3ce6-4548-b10b-1c7845fc9c6e","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.08775","last_updated":"2025-05-13T17:53:59Z","snapshot_observed_at":"2026-07-06T21:23:23.760393Z","submitted_at":"2025-05-13T17:53:59Z","title":"HealthBench: Evaluating Large Language Models Towards Improved Human Health","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.08775","snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"cited_paper":"/paper/2505.08775","citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:e5a60274547a13794db3921685947c35818489b97b7dbb9b841ae805477877a4","observation_id":"0fae46aa-fe9a-4bbd-abbd-a4f0e8eb5132","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"FLEX: Continuous agent evolution via forward learning from experience.arXiv preprint arXiv:2511.06449, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:5bc89a50aab9bbb7432557aa1aa6f32215fc75ba93e0e3ee8cad8aeb582e1959","observation_id":"9546cfb5-5336-4a4c-b806-36458ca2a21a","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"EvoPrompting: Language mod- els for code-level neural architecture search","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:c1d46cc6c928df25b609cf8c343c40f59e80bc5f737dbb9378643fc72ce8c0f5","observation_id":"d0c81aa8-d5e2-4d45-b9ab-4c284c1cfea3","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:5ef4aa8a2bd58fd158e3e0e5ec1452273b8eb9df3183f03897228c5dbd829a2b","observation_id":"3c0bae47-168b-446a-8713-0546be71d7ed","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"M3-embedding: Multi-linguality, multi-functionality, multi-granularity text embeddings through self-knowledge distillation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:2ac585b6fca86e63631b34deaf5199771a85df6208e1120ca0a3ec27f902a05e","observation_id":"04eb9a6d-4efb-4661-b377-cc45d9a0c146","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19413","last_updated":"2025-04-28T01:46:35Z","snapshot_observed_at":"2026-08-02T07:32:11.339534Z","submitted_at":"2025-04-28T01:46:35Z","title":"Mem0: Building Production-Ready AI Agents with Scalable Long-Term Memory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.19413","snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Mem0: Building production-ready AI agents with scalable long-term memory.arXiv preprint arXiv:2504.19413, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"cited_paper":"/paper/2504.19413","citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:82242367bfc468b4ec91d1aa4e0d20b4daf96bb9965eaaaae233235178270897","observation_id":"77237e82-d8eb-4db3-90c8-32f63bcee67e","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-24337-1_3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TextWorld: A learning environment for text-based games","venue":"Communications in computer and information science","work_id":"367c9ace-0b5c-49a0-a010-ddbb5200e35d","year":2019},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:3f4ccfd7a3f15cd940aab131eae002e995c6a319aafe71c9c21fd6aa934dcea8","observation_id":"a142f4c3-d179-4659-b022-ffb251773197","resolution":{"observed_at":"2026-07-12T23:49:08.675260Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Efraimidis and Paul G","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:f40558b5ef04c270a87a19e43f6936e3d3c1aebb817b74121d43b117650c0f8a","observation_id":"534599b0-b401-4e4a-bb4d-1c890f41cbd4","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.21046","last_updated":"2026-01-16T20:59:08Z","snapshot_observed_at":"2026-08-01T06:32:44.461162Z","submitted_at":"2025-07-28T17:59:05Z","title":"A Survey of Self-Evolving Agents: What, When, How, and Where to Evolve on the Path to Artificial Super Intelligence","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.21046","snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"A survey of self-evolving agents: What, when, how, and where to evolve on the path to artificial super intelligence.Transactions on Machine Learning Research, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"cited_paper":"/paper/2507.21046","citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:6ae7914e708754bf3e0cf44e5a538279d6304924f986740558e768c85fe9481c","observation_id":"77bfe344-7e0b-482c-81b0-1e394371cdaf","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Automated design of agentic systems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:f8200e6568237fc16ec143cd6c4eba2f509c443531c6aadbe9590d1b197221cb","observation_id":"dbc9a095-7bd4-4acf-9094-bc013af8e537","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Retrieval-augmented generation for knowledge-intensive NLP tasks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:331cc399bf6c04202aa3469af12bafbc824a1387b95d85290d911f6a6b3457ae","observation_id":"c92d8bbb-6cb2-4867-94b6-b48224d26265","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"MacQueen","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:b8684c947006839b4e41d6b5e6db293f3876837ea18096601808b1d7c3de7156","observation_id":"8d19897c-0394-4c12-8ef1-ad94ece84f9c","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Evaluating very long-term conversational memory of LLM agents","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:d5f8a7644b37b1e2b28a030c1bf3477c205804b2f2c72573e2f8347a1ac730b8","observation_id":"6d168822-dc24-4235-a93c-c95c62496339","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:2ad805101a3f81b928c2acbdfcc73e70de414a31d79326c41d152871f18c63d0","observation_id":"ec7bf586-8c62-4daa-ba16-819e0bdac8bc","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13131","last_updated":"2025-06-16T06:37:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-06-16T06:37:18Z","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13131","snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"cited_paper":"/paper/2506.13131","citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:d5a898e712c89abe0b2e9cc51c364a4015668e5ab521249c9058294322ade424","observation_id":"b3b96b22-50be-4326-9098-8b5e96e3fdec","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"GPT-5.3-Codex model","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:2aff9c49d544294a9f29182f8fa1747a2eefd40bd09d2917a0615e362bcc49f6","observation_id":"cbc606ef-bf29-4937-a3f5-c01c35c0a7c1","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"GPT-5.4 mini model","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:fff4625e5ce27f1f342c4f32707f67f4588fbd1cc73488f0b177fdb3826b1399","observation_id":"7050c95c-aeff-4093-9653-930d20d78ef5","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.25140","last_updated":"2026-03-16T20:49:28Z","snapshot_observed_at":"2026-08-02T12:08:17.149184Z","submitted_at":"2025-09-29T17:51:03Z","title":"ReasoningBank: Scaling Agent Self-Evolving with Reasoning Memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.25140","snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Le, Samira Daruki, Xiangru Tang, Vishy Tirumalashetty, George Lee, Mahsan Ro- fouei, Hangfei Lin, Jiawei Han, Chen-Yu Lee, and Tomas Pfister","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"cited_paper":"/paper/2509.25140","citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:7aabcfd10b269fe907cba97335d242daf2107e69f889f91e1de673efd572c981","observation_id":"173f5085-a2e2-48fc-8926-04dfdd927117","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Bernstein","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:6a92314aeb233c5a4311db5ab41d65149a7092c7094edb112a8f6a1f4fed8364","observation_id":"2652a15e-fdcf-4967-a956-8bdf2912fda4","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"SQuAD: 100,000+ questions for machine comprehension of text","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:95e34d4f79bda19a3f0699872b8352cc29cbf634ed07f99722d9a25884f45558","observation_id":"6d3a5eab-08a5-469b-835d-6fe2c30fb7f0","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Pawan Kumar, Emilien Dupont, Francisco J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:a25b55f18f407dc573f25461fb6e71f8df8f4af98257276e63797e4a88562ba1","observation_id":"228941ce-dd24-4744-8206-54fff8f1c10b","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Reflexion: language agents with verbal reinforcement learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:3a792084e81e28e36496fd297043a3623676024850d0811b96498da0b3b163d8","observation_id":"7ca760f1-252a-415d-8ac4-25a5e6dfa78a","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.03768","last_updated":"2021-03-14T22:44:38Z","snapshot_observed_at":"2026-07-06T10:02:33.297722Z","submitted_at":"2020-10-08T05:13:36Z","title":"ALFWorld: Aligning Text and Embodied Environments for Interactive Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.03768","snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"ALFWorld: Aligning text and embodied environments for inter- active learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"cited_paper":"/paper/2010.03768","citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:f707e54402e7d362bb58f0c3a023a6b8a23859470fc5df7859837511c2c4c5b6","observation_id":"9b49f7ca-4b89-497a-8fe7-0b52742a835a","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Visualizing data using t-SNE.Journal of Machine Learning Research, 9(86):2579–2605, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:42defa340c36fd0c3418e5aca01c2ab30a69be188e6923c95e8c0235aeb0eb0b","observation_id":"9bbec28a-eba4-4d11-9aae-5eefc8f13639","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"V oyager: An open-ended embodied agent with large language models.Transactions on Machine Learning Research, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:22bb5fb70c4c109383818c490c773684ffb8473ed976c471f8785fb0d850197a","observation_id":"1d5b5af9-3725-4c03-ab03-28f2368c5307","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Augmenting language models with long-term memory","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:c8b291f0962803277dbd855df0ef2881b45c1238658f26be0bb612fca596cb98","observation_id":"c30850eb-d80f-4705-b192-717cd132c054","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Agent workflow memory","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:e08d51232c60d7c9ccddea074cf6b63cce402cf019faa6f01db025af3e1d93e6","observation_id":"bae0c856-17b7-4c2a-962f-1d753da5ba4f","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Learning to continually learn via meta-learning agentic memory designs.arXiv preprint arXiv:2602.07755, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:2bdc6528e7dc3919f82de114e8c45ea9951b790c288757b1f712ac96373b555d","observation_id":"7419186a-874c-4855-8398-d127c4397de7","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.18746","last_updated":"2025-12-21T14:26:14Z","snapshot_observed_at":"2026-07-06T22:39:43.359149Z","submitted_at":"2025-12-21T14:26:14Z","title":"MemEvolve: Meta-Evolution of Agent Memory Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.18746","snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"MemEvolve: Meta-evolution of agent memory systems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"cited_paper":"/paper/2512.18746","citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:fe05e7c2b05e8931b9671809d71d8ad38a5a84de0d54e33ac84b81d61c175dd9","observation_id":"3d8689ac-3eac-49df-9504-c81e298aa07f","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.02474","last_updated":"2026-05-24T19:01:09Z","snapshot_observed_at":"2026-08-03T05:25:38.558727Z","submitted_at":"2026-02-02T18:53:28Z","title":"MemSkill: Learning and Evolving Memory Skills for Self-Evolving Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.02474","snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"MemSkill: Learning and evolving memory skills for self-evolving agents","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"cited_paper":"/paper/2602.02474","citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:c20ca2acdf056388c88a24f0f5d504d5cffb0a87bd565351b6f81d20fec7b522","observation_id":"72b4a436-a941-493a-9248-47d829d22900","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"A survey on the memory mechanism of large language model-based agents","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:dec1e860343305e957d7392819e2aa70dc4028e9d7f3aff236c93e68ba70cb01","observation_id":"09ac6089-5c96-4cd6-b494-ffbb359ad62e","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"ExpeL: LLM agents are experiential learners","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:6874efd1e872d712c7f9c1c3773a34428cd168f2a0ec580dab17cfb2a09bac8b","observation_id":"cc2af584-9615-468c-8f73-d2ead3c6a71c","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"\"\"Vanilla RAG: store text chunks in ChromaDB, retrieve by semantic similarity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:b7148632ccd349f0c307e52e0dbafb57af430e4cf37450291192393ea402df94","observation_id":"653c4283-fdf4-4f7b-89f5-c7b8937ed4ec","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"description","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:3916fd169e7c3e964cfc9b1e5445daa3b02320b819c135d233d3b5786ac34d80","observation_id":"20ef2e70-6ac7-475b-a4d0-c1ff2417760a","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"- Same constraints as KnowledgeItem","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:e569d6f8864130169692ba3680b74198ceea354f895ad63a9ead64b63ff2507f","observation_id":"9816d1b4-9936-404c-9a5f-40abc0cea35e","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:846173d108aeab2c515f0f17844021bebe0b3863c4fa767d7779a9660ed4f660","observation_id":"00bcc93b-353f-41f5-ad4e-a16deeef7aa8","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:e5907d2b3c479a59ea4e0b813fdd9a253333fdbedb2d6b6a6b23279937118cd8","observation_id":"b480bbec-2b5b-4917-a6e3-c968a4bbb806","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:0a295468afc180cb836e3adbafa1e5fe31f5e622f3123f0d53619ca78023e0cd","observation_id":"284f3d18-8f18-4ebb-bb5c-78807fffa327","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:3234eefb1d3b4c738d04e3931e5a46702e58a0f5a042072af2235092e81c7e75","observation_id":"ccf297b1-564b-431f-8310-902972f2126d","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:fcf67aad06e944af1d6624e8276866dc7afa9a3d3d3109fc0f275d8534eb879b","observation_id":"dd8c5a5d-5c33-4132-a04a-ea563d23a621","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Make minimal changes that generalize beyond the specific cases shown -- no hardcoded word lists or case-specific pattern rules","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:b4390c07700fbac93ebc715c8017b42621752509bf4e8d0fc7886894cb4194d9","observation_id":"7b28e1ce-53c2-44fd-9979-c522bb414c26","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:855d14344a96dc8f2db8b1585025b394c288dc0a9499bd59c2ee2c338c78196d","observation_id":"6bff4955-3c15-4dfb-9af3-864f255f772c","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:0820821f7c3f50a47833cf3c5e8bc6ba98133f24fd4e7e8d9150830c577ca5c8","observation_id":"c296d608-7934-4181-b4d5-1837c4c9986a","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"{iteration}","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:afb4308e8fe889fcffab2d0348ce90e85ce3290e0cb2166f6498b4b5b8258754","observation_id":"6f4eddbc-4e6a-4d3f-b506-5184e3957cc3","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:6c481ec669650ded69b7b4935bc91e4a65a87f0eb1e291230a67ec12b9e48d98","observation_id":"18bb8358-6cb1-4f36-99ab-f8b864568ea2","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:12504c5284b3d67a074d0a3cf42af72d72dfd67791658f5ca56884e346daed0f","observation_id":"db58e8a7-7003-4af6-b84c-8de06f9fe0e9","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"a”, “an”, “the","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:b8c85c4dd81914ebfcac33d715fbb4732a4aba9f6312958eb34b11af0f4dc442","observation_id":"54f1d078-6d7b-4fa5-8fec-24e144aa9340","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T23:39:48.095337Z","title":"Justification: No new human-subject study is conducted","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-12T23:39:48.095337Z"},"links":{"citing_paper":"/paper/2604.11811"},"observation_digest":"sha256:b8e22724a44792c359d7b2d2146da07069cfbdbce1541e8439ce7c140eb25a2e","observation_id":"c3e30497-565c-4567-b22e-b7aa650d8881","resolution":{"observed_at":"2026-07-12T23:39:48.095337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2604.11811","last_updated":"2026-05-23T08:43:43Z","latest_version":2,"primary_category":"cs.PL","snapshot_observed_at":"2026-07-12T23:39:45.091388Z","submitted_at":"2026-04-10T03:22:26Z","title":"M$^\\star$: Every Task Deserves Its Own Memory Harness"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":49},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2604.11811."}