{"as_of":"2026-08-07T18:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d1ef23a604e2ab94139146d0a44156493998350edad313de36ae1e17dfbe87e8","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T10:34:04.758410Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T07:30:42.104455Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T10:17:57.968323Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"cited_work":{"arxiv_id":"2509.03990","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.03990","snapshot_observed_at":"2026-07-03T10:17:57.968323Z","title":"arXiv preprint arXiv:2509.03990 , year=","venue":null,"work_id":"45ed7b8d-ac2e-420c-abc7-badb37e5e453","year":2025},"citing_paper":{"arxiv_id":"2604.21725","last_updated":"2026-04-23T14:29:25Z","snapshot_observed_at":"2026-07-06T23:08:14.631453Z","submitted_at":"2026-04-23T14:29:25Z","title":"AEL: Agent Evolving Learning for Open-Ended Environments","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-09T22:24:45.518871Z"},"links":{"cited_paper":"/paper/2509.03990","citing_paper":"/paper/2604.21725"},"observation_digest":"sha256:7ef214876510fd3aaad42fcf4205fe4b9098f52bd8009151f51f1c0c81b4ad9d","observation_id":"3bd367dd-0c9f-4c4f-8b4c-d29fff5c5291","resolution":{"observed_at":"2026-05-09T22:34:07.677158Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"cited_work":{"arxiv_id":"2509.03990","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.03990","snapshot_observed_at":"2026-07-03T10:17:57.968323Z","title":"arXiv preprint arXiv:2509.03990 , year=","venue":null,"work_id":"45ed7b8d-ac2e-420c-abc7-badb37e5e453","year":2025},"citing_paper":{"arxiv_id":"2605.29640","last_updated":"2026-05-29T02:43:30Z","snapshot_observed_at":"2026-07-06T23:39:01.234601Z","submitted_at":"2026-05-28T09:07:42Z","title":"VikingMem: A Memory Base Management System for Stateful LLM-based Applications","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-29T07:30:42.104455Z"},"links":{"cited_paper":"/paper/2509.03990","citing_paper":"/paper/2605.29640"},"observation_digest":"sha256:59d4abf29b041d2251ccb49280e589f0e8de5dbdbe9bdd4a6cea786dc92d01af","observation_id":"a83fe42d-83fe-44c0-9160-e4f93408707b","resolution":{"observed_at":"2026-06-29T07:33:13.618757Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"cited_work":{"arxiv_id":"2509.03990","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.03990","snapshot_observed_at":"2026-07-03T10:17:57.968323Z","title":"arXiv preprint arXiv:2509.03990 , year=","venue":null,"work_id":"45ed7b8d-ac2e-420c-abc7-badb37e5e453","year":2025},"citing_paper":{"arxiv_id":"2606.05513","last_updated":"2026-06-03T23:40:30Z","snapshot_observed_at":"2026-07-06T23:45:28.379468Z","submitted_at":"2026-06-03T23:40:30Z","title":"EpiEvolve: Self-Evolving Agents for Streaming Pandemic Forecasting under Regime Shifts","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-28T05:40:18.458584Z"},"links":{"cited_paper":"/paper/2509.03990","citing_paper":"/paper/2606.05513"},"observation_digest":"sha256:8734884d95069c6f44a80e210bc11e197b44486cbef50875da70f052c56ae8cc","observation_id":"c149badf-58ac-4888-ae9e-02f8c778cc32","resolution":{"observed_at":"2026-07-02T09:06:49.108546Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"cited_work":{"arxiv_id":"2509.03990","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.03990","snapshot_observed_at":"2026-07-03T10:17:57.968323Z","title":"arXiv preprint arXiv:2509.03990 , year=","venue":null,"work_id":"45ed7b8d-ac2e-420c-abc7-badb37e5e453","year":2025},"citing_paper":{"arxiv_id":"2606.12329","last_updated":"2026-06-10T17:02:56Z","snapshot_observed_at":"2026-08-07T00:58:13.943057Z","submitted_at":"2026-06-10T17:02:56Z","title":"PROJECTMEM: A Local-First, Event-Sourced Memory and Judgment Layer for AI Coding Agents","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T10:06:26.351938Z"},"links":{"cited_paper":"/paper/2509.03990","citing_paper":"/paper/2606.12329"},"observation_digest":"sha256:e62d8036e0ec486118cae4426605691283ff18df16799669d5fa7fc66dd43a53","observation_id":"c5c44a64-af60-40ff-b837-fa10c76e8e3a","resolution":{"observed_at":"2026-07-03T10:17:57.969787Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.03990/citation-record","integrity":"/paper/2509.03990/integrity","json":"/paper/2509.03990/citation-record.json","paper":"/paper/2509.03990"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.13501","last_updated":"2024-04-21T01:49:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-04-21T01:49:46Z","title":"A Survey on the Memory Mechanism of Large Language Model based Agents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.13501","snapshot_observed_at":"2026-08-05T10:34:03.335639Z","title":"Wen, J.-R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:03.335639Z"},"links":{"cited_paper":"/paper/2404.13501","citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:5e7782b01b53d29c188de06053c158bc7680cbf8aed2fa4fcb672fc96cd721b8","observation_id":"862d85d1-36a2-4d55-a5af-88dabd6a2ef2","resolution":{"observed_at":"2026-08-05T10:34:03.335639Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:34:06.605594Z","title":null,"venue":null,"work_id":"2017e431-78ce-4f81-a385-30b44be8600c","year":2025},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:03.425531Z"},"links":{"citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:e2b225cc880c7556308649ba86a9c9d96366d0a4a5f90b08344a8a7a8186250e","observation_id":"b0275fe7-3589-4385-aad4-97b9580f12ad","resolution":{"observed_at":"2026-08-05T10:34:06.719344Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.19828","last_updated":"2026-01-14T14:21:21Z","snapshot_observed_at":"2026-07-06T22:19:28.487854Z","submitted_at":"2025-08-27T12:26:55Z","title":"Memory-R1: Enhancing Large Language Model Agents to Manage and Utilize Memories via Reinforcement Learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.19828","snapshot_observed_at":"2026-08-05T10:34:03.521505Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:03.521505Z"},"links":{"cited_paper":"/paper/2508.19828","citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:760e0c1658e59047c608ef9fdff5e21aba4eb0c571eadc2e76d0f55a3aef7257","observation_id":"c04c6522-a41e-4a81-ae55-7fab9d86ac7e","resolution":{"observed_at":"2026-08-05T10:34:03.521505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12110","last_updated":"2025-10-08T01:46:37Z","snapshot_observed_at":"2026-08-03T02:27:06.991396Z","submitted_at":"2025-02-17T18:36:14Z","title":"A-MEM: Agentic Memory for LLM Agents","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12110","snapshot_observed_at":"2026-08-05T10:34:03.608757Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:03.608757Z"},"links":{"cited_paper":"/paper/2502.12110","citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:347ad505727f7cd47b10b95bb4f1ab316b2db011fb94d8fc7d6fa476b9c3f0ba","observation_id":"a64462f7-3a55-48a5-bf76-ca2acded8179","resolution":{"observed_at":"2026-08-05T10:34:03.608757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.07398","last_updated":"2025-06-16T08:45:10Z","snapshot_observed_at":"2026-08-07T05:32:29.009208Z","submitted_at":"2025-06-09T03:43:46Z","title":"G-Memory: Tracing Hierarchical Memory for Multi-Agent Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.07398","snapshot_observed_at":"2026-08-05T10:34:03.725609Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:03.725609Z"},"links":{"cited_paper":"/paper/2506.07398","citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:6b919a5df89cd6b88e7af1f14b44bae3deeac1857cc6c69768b0c7bcec3c5b07","observation_id":"78a4b77c-2a02-4a0b-b2b6-56e9729b33ad","resolution":{"observed_at":"2026-08-05T10:34:03.725609Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:34:06.387075Z","title":null,"venue":null,"work_id":"470cac5b-7bee-4ce4-a121-48f7a53b52f0","year":2023},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:03.819238Z"},"links":{"citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:ccfa23a7ede76c83fef62094dd43c05ec24aed251604b4e608cedcb197d0cb2e","observation_id":"d010dd77-520f-4c8d-817b-643179e55848","resolution":{"observed_at":"2026-08-05T10:34:06.503164Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:34:06.201076Z","title":null,"venue":null,"work_id":"5f9e4ec4-0f6f-4ff3-a01b-003dc7bcf051","year":2022},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:03.932875Z"},"links":{"citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:4368d0e705a0f862f620c995536258fa8d6f0bc17cf6d0061ac86a2b7e808b79","observation_id":"04c1d77c-81ea-4ae5-83c7-167d3a344b70","resolution":{"observed_at":"2026-08-05T10:34:06.274856Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00430","last_updated":"2025-01-03T02:50:59Z","snapshot_observed_at":"2026-08-06T12:25:14.100007Z","submitted_at":"2024-12-31T13:11:20Z","title":"Enhancing LLM Reasoning with Multi-Path Collaborative Reactive and Reflection agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.00430","snapshot_observed_at":"2026-08-05T10:34:04.035580Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:04.035580Z"},"links":{"cited_paper":"/paper/2501.00430","citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:6449135f476b9c8bdf356ecd861b5045afec8bc16e21b2825fc714a04be48913","observation_id":"9d415cac-e65a-45ad-a78c-1ce4a1a36764","resolution":{"observed_at":"2026-08-05T10:34:04.035580Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:34:06.001059Z","title":null,"venue":null,"work_id":"6ee97798-1b9f-48fe-b9b2-949ecdf4485a","year":2025},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:04.112550Z"},"links":{"citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:25473adb57a65ee0cd237b123db9f0fa4ee5c8732c6a3585c6338b0689a9bed9","observation_id":"40d4670b-8db2-41f3-89cd-7816b64e60db","resolution":{"observed_at":"2026-08-05T10:34:06.069002Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:34:05.808135Z","title":null,"venue":null,"work_id":"cb049e70-491f-4aec-bb56-7bf5105ece18","year":2024},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:04.226264Z"},"links":{"citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:c866038c3d433ff651837fef66fcdde97cd1f955d9b5181682f31689345ffd91","observation_id":"cc89c608-0ddf-400e-8493-e59ff6729c35","resolution":{"observed_at":"2026-08-05T10:34:05.894041Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:34:05.616429Z","title":null,"venue":null,"work_id":"d99d0f45-03ed-46c6-a3ad-5951a1ce81f9","year":2024},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:04.327102Z"},"links":{"citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:e6fe369f3e3fb4e85794d213f08936e830a24e3191b845ff39fc81fa3105751b","observation_id":"47d39d04-6175-40e5-8903-fe10a3fdf07a","resolution":{"observed_at":"2026-08-05T10:34:05.721399Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:34:05.428578Z","title":null,"venue":null,"work_id":"19c3a916-b513-4c20-9de5-afad6565a8b2","year":2024},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:04.442899Z"},"links":{"citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:e422372cc0a02f547cb52f322e26a9850de47ae674a59ffd723446170d4cf725","observation_id":"f26dc4ed-18a9-4865-a251-8a20e5edfd2d","resolution":{"observed_at":"2026-08-05T10:34:05.536190Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:34:05.289967Z","title":null,"venue":null,"work_id":"9988c239-4afe-4b06-a940-9d608a7f81e6","year":2025},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:04.541556Z"},"links":{"citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:65ce181e91de12e60579b4b96ec0692b9f430fe3e8eda81ad19949e8bcdc04fd","observation_id":"25492f69-5e1b-4c21-ac87-1b6d1fc88378","resolution":{"observed_at":"2026-08-05T10:34:05.362700Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:34:05.082198Z","title":null,"venue":null,"work_id":"a5d12e5d-33fd-41c5-aaff-8cdbbb89d710","year":2025},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:04.650979Z"},"links":{"citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:0ae0268fa9f64d302d23dfdb93b766b7a42d7cf7e0468fe1ea9ff24fc5e99e78","observation_id":"53f49bf9-817e-4d63-9001-33e37de88017","resolution":{"observed_at":"2026-08-05T10:34:05.190447Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T10:34:04.937685Z","title":null,"venue":null,"work_id":"6a751d3d-445b-49b1-a956-1d034a1633a1","year":2020},"citing_paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T10:34:04.758410Z"},"links":{"citing_paper":"/paper/2509.03990"},"observation_digest":"sha256:e8ad7f2a32b5abe2e5b7cc426f708e8b04689f1aa8e85298763e16d07a964f3c","observation_id":"caa37770-f302-43fe-8387-a2fbc0d05066","resolution":{"observed_at":"2026-08-05T10:34:04.999000Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.03990","last_updated":"2025-09-08T07:40:58Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-05T10:34:02.977599Z","submitted_at":"2025-09-04T08:18:39Z","title":"Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agent"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":15},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 4 inbound Pith citation observations for arXiv:2509.03990."}