{"as_of":"2026-08-16T14:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0dcf6fa75a69872c1b145f36420de526fddf1501bade8347bc198e00c1bcfdd3","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T15:27:16.869983Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2607.23702/citation-record","integrity":"/paper/2607.23702/integrity","json":"/paper/2607.23702/citation-record.json","paper":"/paper/2607.23702"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.09040","last_updated":"2025-08-25T00:15:27Z","snapshot_observed_at":"2026-08-15T21:39:33.960551Z","submitted_at":"2025-05-14T00:41:44Z","title":"RT-Cache: Training-Free Retrieval for Real-Time Manipulation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09040","snapshot_observed_at":"2026-07-30T15:27:16.528128Z","title":"Rt-cache: Training-free retrieval for real-time manipulation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.528128Z"},"links":{"cited_paper":"/paper/2505.09040","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:df54ced8bf9fc41206a03ed67904fa6ecb4979f1264e0f97ab4897a935cc27f6","observation_id":"60debc18-fe51-47ae-9d62-f8051c20fc5e","resolution":{"observed_at":"2026-07-30T15:27:16.528128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.10094","last_updated":"2026-05-12T11:39:28Z","snapshot_observed_at":"2026-08-06T05:38:04.446908Z","submitted_at":"2026-05-11T07:11:10Z","title":"Retrieve-then-Steer: Online Success Memory for Test-Time Adaptation of Generative VLAs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.10094","snapshot_observed_at":"2026-07-30T15:27:16.535962Z","title":"Retrieve-then-steer: Online success memory for test-time adaptation of generative vlas,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.535962Z"},"links":{"cited_paper":"/paper/2605.10094","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:952610b2921528f1e48b638198bcbf556581a02186aec84961012ca309e4e2af","observation_id":"97a527dd-ee27-4300-95ef-ec5541a67cd7","resolution":{"observed_at":"2026-07-30T15:27:16.535962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11124","last_updated":"2025-02-16T13:45:10Z","snapshot_observed_at":"2026-08-16T12:58:00.907914Z","submitted_at":"2025-02-16T13:45:10Z","title":"AdaManip: Adaptive Articulated Object Manipulation Environments and Policy Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11124","snapshot_observed_at":"2026-07-30T15:27:16.547410Z","title":"Adamanip: Adaptive articulated object manipulation environments and policy learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.547410Z"},"links":{"cited_paper":"/paper/2502.11124","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:0559f690af4f93ae0a8bef917010eb17080b4679b2cfc79524ca03c8b537e3ee","observation_id":"c8e485a8-85bf-44a9-9e48-147b466a0956","resolution":{"observed_at":"2026-07-30T15:27:16.547410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.00246","last_updated":"2023-05-04T14:47:16Z","snapshot_observed_at":"2026-08-09T15:57:08.584155Z","submitted_at":"2021-12-01T03:00:05Z","title":"AdaAfford: Learning to Adapt Manipulation Affordance for 3D Articulated Objects via Few-shot Interactions","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.00246","snapshot_observed_at":"2026-07-30T15:27:16.555447Z","title":"Adaafford: Learning to adapt manipulation affordance for 3d articulated objects via few-shot interactions,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.555447Z"},"links":{"cited_paper":"/paper/2112.00246","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:fa2ad9548768930daaec6c344cd96ca72aa92358e547da86f648f85df18fc81b","observation_id":"a08336ca-9878-4bdb-a9e4-57be37f8e2f6","resolution":{"observed_at":"2026-07-30T15:27:16.555447Z","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-30T15:27:16.569667Z","title":"Map-vla: Memory-augmented prompting for vision-language-action model in robotic manipulation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.569667Z"},"links":{"citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:d5e4656095920b75ea925431be211529443083935fc3ac52da1d7a418ae2d2c5","observation_id":"ef461fe3-d44f-4b05-889e-e4f13dbc862c","resolution":{"observed_at":"2026-07-30T15:27:16.569667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.20014","last_updated":"2026-06-18T10:41:20Z","snapshot_observed_at":"2026-08-16T07:57:27.702172Z","submitted_at":"2025-12-23T03:13:39Z","title":"Bring My Cup! Personalizing Vision-Language-Action Models with Visual Attentive Prompting","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.20014","snapshot_observed_at":"2026-07-30T15:27:16.574618Z","title":"Bring my cup! personalizing vision-language-action models with visual attentive prompting,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.574618Z"},"links":{"cited_paper":"/paper/2512.20014","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:f978ae673aa7820f519bdc0c067c1d9e3c8a6a9ab7c939b238b33770f26fef8f","observation_id":"eae41c6c-e566-4aa8-9083-dab419e62c1e","resolution":{"observed_at":"2026-07-30T15:27:16.574618Z","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-30T15:27:16.582008Z","title":"Memer: Scaling up memory for robot control via experience retrieval,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.582008Z"},"links":{"citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:c0abc27eda395dc841462b3be5c392d45bdfa381fbfd4be18112da4297bf9bb9","observation_id":"a2087ec0-2a4c-42cb-affb-1d4e905481fa","resolution":{"observed_at":"2026-07-30T15:27:16.582008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.13910","last_updated":"2022-05-23T02:53:18Z","snapshot_observed_at":"2026-08-15T03:31:37.294335Z","submitted_at":"2021-09-28T17:56:01Z","title":"Online Object Model Reconstruction and Reuse for Lifelong Improvement of Robot Manipulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.13910","snapshot_observed_at":"2026-07-30T15:27:16.587587Z","title":"Online object model reconstruction and reuse for lifelong improvement of robot manipulation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.587587Z"},"links":{"cited_paper":"/paper/2109.13910","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:cf0769e6cdbd45e76cf887389f834285fd60260e876c021e2e89df076a86b3ca","observation_id":"c818c55f-3e61-457b-b08b-92ff4aa200fc","resolution":{"observed_at":"2026-07-30T15:27:16.587587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.18276","last_updated":"2025-07-24T10:25:58Z","snapshot_observed_at":"2026-08-16T07:23:27.627383Z","submitted_at":"2025-07-24T10:25:58Z","title":"Adaptive Articulated Object Manipulation On The Fly with Foundation Model Reasoning and Part Grounding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.18276","snapshot_observed_at":"2026-07-30T15:27:16.597847Z","title":"Adaptive articulated object manipulation on the fly with foundation model reasoning and part grounding,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.597847Z"},"links":{"cited_paper":"/paper/2507.18276","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:6fb51d66641e1fa2d5934d818bde443bdf5b6871b9ee9dadf82677b3d0e4e4db","observation_id":"b8796252-2af4-4aa9-bf86-d26d2c5de7b2","resolution":{"observed_at":"2026-07-30T15:27:16.597847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.14440","last_updated":"2022-04-01T13:31:19Z","snapshot_observed_at":"2026-08-14T10:44:39.748300Z","submitted_at":"2021-06-28T07:47:31Z","title":"VAT-Mart: Learning Visual Action Trajectory Proposals for Manipulating 3D ARTiculated Objects","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.14440","snapshot_observed_at":"2026-07-30T15:27:16.604972Z","title":"Vat-mart: Learning visual action trajectory proposals for manipulating 3d articulated objects,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.604972Z"},"links":{"cited_paper":"/paper/2106.14440","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:7a3a1acf6f1722b82aa1149a950a0c39edb13fdcd456695123664491352ea1b8","observation_id":"7dfb9f6d-177a-477b-bb52-84cf068d20df","resolution":{"observed_at":"2026-07-30T15:27:16.604972Z","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-30T15:27:16.613261Z","title":"Beyond short-horizon: Vq-memory for robust long- horizon manipulation in non-markovian simulation benchmarks,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.613261Z"},"links":{"citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:865d4e90a7c95ee239205a7634094493c792ae86389b58150359f982642513f1","observation_id":"bc474ff9-164a-4d30-aa7f-67811fc33fb8","resolution":{"observed_at":"2026-07-30T15:27:16.613261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15182","last_updated":"2025-08-18T16:14:04Z","snapshot_observed_at":"2026-08-15T06:59:17.540864Z","submitted_at":"2024-12-19T18:54:06Z","title":"STRAP: Robot Sub-Trajectory Retrieval for Augmented Policy Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15182","snapshot_observed_at":"2026-07-30T15:27:16.620705Z","title":"Strap: Robot sub-trajectory retrieval for augmented policy learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.620705Z"},"links":{"cited_paper":"/paper/2412.15182","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:2597c63bac4a1a0149dbcadb3592d1fe135b7a53a118ce6eb719a543521def80","observation_id":"f48055be-372f-445d-b4c2-2722dead7344","resolution":{"observed_at":"2026-07-30T15:27:16.620705Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.11435","last_updated":"2022-11-15T00:13:24Z","snapshot_observed_at":"2026-08-14T10:34:13.990174Z","submitted_at":"2022-10-20T17:34:59Z","title":"Learning and Retrieval from Prior Data for Skill-based Imitation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.11435","snapshot_observed_at":"2026-07-30T15:27:16.628939Z","title":"Learning and retrieval from prior data for skill-based imitation learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.628939Z"},"links":{"cited_paper":"/paper/2210.11435","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:54326eafcd6285818a13a0ab851ab7bcc07a4fe46d13bd702a033510f8c386d6","observation_id":"d2463ca1-8692-4acc-95f8-94b4f4f42514","resolution":{"observed_at":"2026-07-30T15:27:16.628939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.19578","last_updated":"2024-10-17T19:31:39Z","snapshot_observed_at":"2026-08-16T14:05:26.633797Z","submitted_at":"2024-03-28T17:04:00Z","title":"Keypoint Action Tokens Enable In-Context Imitation Learning in Robotics","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19578","snapshot_observed_at":"2026-07-30T15:27:16.634787Z","title":"Keypoint action tokens enable in-context imitation learning in robotics,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.634787Z"},"links":{"cited_paper":"/paper/2403.19578","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:1d3063dfff262c744bc9732d8153d8f20ebc6d6144394435f065a49f78093bea","observation_id":"2a863e97-9df3-43cb-abb7-df2dad263c7d","resolution":{"observed_at":"2026-07-30T15:27:16.634787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15980","last_updated":"2024-09-27T20:10:08Z","snapshot_observed_at":"2026-08-16T13:23:07.878277Z","submitted_at":"2024-08-28T17:50:19Z","title":"In-Context Imitation Learning via Next-Token Prediction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15980","snapshot_observed_at":"2026-07-30T15:27:16.640989Z","title":"In-context imitation learning via next-token prediction,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.640989Z"},"links":{"cited_paper":"/paper/2408.15980","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:472b54178c0420e4bfe70c4148874d72281d2f0fe36790c94d850069ad60c39f","observation_id":"003a2846-797b-4833-9fb3-6f0a28fe6f08","resolution":{"observed_at":"2026-07-30T15:27:16.640989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12633","last_updated":"2025-04-25T15:22:45Z","snapshot_observed_at":"2026-08-15T02:39:56.502074Z","submitted_at":"2024-11-19T16:45:52Z","title":"Instant Policy: In-Context Imitation Learning via Graph Diffusion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.12633","snapshot_observed_at":"2026-07-30T15:27:16.652920Z","title":"Instant policy: In-context imitation learning via graph diffusion,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.652920Z"},"links":{"cited_paper":"/paper/2411.12633","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:c0c719110b40bcac8a5c203e74ba71567f017d7b7eb399e4ca16c838b95e5b86","observation_id":"3039ad2f-5de8-4112-bbd9-3bf61879f57a","resolution":{"observed_at":"2026-07-30T15:27:16.652920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11366","last_updated":"2023-10-10T05:21:45Z","snapshot_observed_at":"2026-08-15T16:12:25.059113Z","submitted_at":"2023-03-20T18:08:50Z","title":"Reflexion: Language Agents with Verbal Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11366","snapshot_observed_at":"2026-07-30T15:27:16.663063Z","title":"Reflexion: Language agents with verbal reinforcement learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.663063Z"},"links":{"cited_paper":"/paper/2303.11366","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:b491ef9d5e6488ac2658b385f1f76edfe0e0b37483fb3697672379aae7d66004","observation_id":"33c531c6-4639-4fba-bc55-da23058cad2e","resolution":{"observed_at":"2026-07-30T15:27:16.663063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.10144","last_updated":"2024-12-20T06:14:53Z","snapshot_observed_at":"2026-08-16T04:03:07.955545Z","submitted_at":"2023-08-20T03:03:34Z","title":"ExpeL: LLM Agents Are Experiential Learners","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.10144","snapshot_observed_at":"2026-07-30T15:27:16.670293Z","title":"Expel: Llm agents are experiential learners,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.670293Z"},"links":{"cited_paper":"/paper/2308.10144","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:a65e2f48fd61ef76978701e87c1a21b7dfda37cd89df699123205a20550ee435","observation_id":"50742533-34c6-4308-97d1-ec586a451e2e","resolution":{"observed_at":"2026-07-30T15:27:16.670293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.03442","last_updated":"2023-08-06T00:21:19Z","snapshot_observed_at":"2026-08-16T03:49:04.888755Z","submitted_at":"2023-04-07T01:55:19Z","title":"Generative Agents: Interactive Simulacra of Human Behavior","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.03442","snapshot_observed_at":"2026-07-30T15:27:16.676609Z","title":"Generative agents: Interactive simulacra of human behavior,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.676609Z"},"links":{"cited_paper":"/paper/2304.03442","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:a0c938b4a362bc337807ed6a79fe0220623b504aa4597bc07ba9e7547c36865e","observation_id":"b408618d-c012-4c76-ae1c-11f4c44abeb6","resolution":{"observed_at":"2026-07-30T15:27:16.676609Z","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-30T15:27:16.685393Z","title":"Experiential reflec- tive learning for self-improving llm agents,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.685393Z"},"links":{"citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:b0be52cf6d3da7c333997707a69766bbcb119bff80953641d962148a8583d291","observation_id":"3bcf18b1-55d9-456f-8548-24f8ee963a52","resolution":{"observed_at":"2026-07-30T15:27:16.685393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06975","last_updated":"2025-02-10T19:14:51Z","snapshot_observed_at":"2026-08-14T08:32:12.525435Z","submitted_at":"2025-02-10T19:14:51Z","title":"Position: Episodic Memory is the Missing Piece for Long-Term LLM Agents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06975","snapshot_observed_at":"2026-07-30T15:27:16.699822Z","title":"Position: Episodic memory is the missing piece for long-term llm agents,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.699822Z"},"links":{"cited_paper":"/paper/2502.06975","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:57f902a71c1c3946820eb7f8ae5f669442447670be1af704a51194c0f1d34389","observation_id":"cf195554-bcd4-4a9c-a888-e64612a2d908","resolution":{"observed_at":"2026-07-30T15:27:16.699822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10678","last_updated":"2024-03-21T05:47:22Z","snapshot_observed_at":"2026-08-13T05:23:00.741238Z","submitted_at":"2023-11-17T18:00:20Z","title":"Distilling and Retrieving Generalizable Knowledge for Robot Manipulation via Language Corrections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.10678","snapshot_observed_at":"2026-07-30T15:27:16.712272Z","title":"Distilling and retrieving generalizable knowledge for robot manipulation via language corrections,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.712272Z"},"links":{"cited_paper":"/paper/2311.10678","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:4f6583c4081ccb594616639a4a434c5d13bc52b2ca529798a70490cf7e56647a","observation_id":"ad51d543-cb7b-4f4d-b96a-9c793f269662","resolution":{"observed_at":"2026-07-30T15:27:16.712272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18746","last_updated":"2024-07-15T14:16:25Z","snapshot_observed_at":"2026-08-16T13:39:17.305501Z","submitted_at":"2024-06-26T20:25:30Z","title":"Lifelong Robot Library Learning: Bootstrapping Composable and Generalizable Skills for Embodied Control with Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18746","snapshot_observed_at":"2026-07-30T15:27:16.727455Z","title":"Lifelong robot library learning: Bootstrap- ping composable and generalizable skills for embodied control with language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.727455Z"},"links":{"cited_paper":"/paper/2406.18746","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:f33386b1725535f0c466b95cb034203478145a0d28f403ce742406c2486f3517","observation_id":"65891a07-22c4-4c18-a296-f5f585445bd1","resolution":{"observed_at":"2026-07-30T15:27:16.727455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.15127","last_updated":"2023-11-20T18:51:29Z","snapshot_observed_at":"2026-08-13T05:42:54.352149Z","submitted_at":"2023-10-23T17:31:55Z","title":"Open-Ended Instructable Embodied Agents with Memory-Augmented Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.15127","snapshot_observed_at":"2026-07-30T15:27:16.736013Z","title":"Open-ended in- structable embodied agents with memory-augmented large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.736013Z"},"links":{"cited_paper":"/paper/2310.15127","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:55d9201bb2d2103a5120cb478001950ac7c824d3301b398265673a2e5fce8c1b","observation_id":"5baeeff0-e11b-4ecc-9d3b-ded02f2271be","resolution":{"observed_at":"2026-07-30T15:27:16.736013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16291","last_updated":"2023-10-19T16:27:03Z","snapshot_observed_at":"2026-08-13T16:55:46.498156Z","submitted_at":"2023-05-25T17:46:38Z","title":"Voyager: An Open-Ended Embodied Agent with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16291","snapshot_observed_at":"2026-07-30T15:27:16.745048Z","title":"V oyager: An open-ended embodied agent with large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.745048Z"},"links":{"cited_paper":"/paper/2305.16291","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:3abcc7933710e09ee456e53f003018e21ef8ef3faaae3f7ec3afa19e3ac1ccc7","observation_id":"b901174f-e64f-41f8-9e79-96eb8712af20","resolution":{"observed_at":"2026-07-30T15:27:16.745048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.15724","last_updated":"2023-10-16T21:04:57Z","snapshot_observed_at":"2026-08-13T11:08:08.791270Z","submitted_at":"2023-06-27T18:03:15Z","title":"REFLECT: Summarizing Robot Experiences for Failure Explanation and Correction","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.15724","snapshot_observed_at":"2026-07-30T15:27:16.751493Z","title":"Reflect: Summarizing robot experiences for failure explanation and correction,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.751493Z"},"links":{"cited_paper":"/paper/2306.15724","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:c2a8e8ed8a88c41cf63ca9483063d03d9ec84d5e6ca2674097ab38ab3f23a333","observation_id":"233af07c-050f-4986-86b5-b046173aa463","resolution":{"observed_at":"2026-07-30T15:27:16.751493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.19236","last_updated":"2026-01-30T13:36:22Z","snapshot_observed_at":"2026-07-06T22:19:00.152099Z","submitted_at":"2025-08-26T17:57:16Z","title":"MemoryVLA: Perceptual-Cognitive Memory in Vision-Language-Action Models for Robotic Manipulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.19236","snapshot_observed_at":"2026-07-30T15:27:16.759580Z","title":"Memoryvla: Perceptual-cognitive memory in vision-language-action models for robotic manipulation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.759580Z"},"links":{"cited_paper":"/paper/2508.19236","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:4075b6050af1225dfa3114198934e0f7745f78dc76639625cb09158ccb0f7b92","observation_id":"ce1da489-6e3a-440a-9e2c-abea2a18104d","resolution":{"observed_at":"2026-07-30T15:27:16.759580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.20092","last_updated":"2026-06-29T12:49:53Z","snapshot_observed_at":"2026-08-03T01:42:23.549465Z","submitted_at":"2026-06-18T11:11:37Z","title":"EventVLA: Event-Driven Visual Evidence Memory for Long-Horizon Vision-Language-Action Policies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.20092","snapshot_observed_at":"2026-07-30T15:27:16.779291Z","title":"Eventvla: Event-driven visual evidence memory for long-horizon vision-language-action policies,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.779291Z"},"links":{"cited_paper":"/paper/2606.20092","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:2378f44952cc57652e798021765b57d73062597a3c3a5596ff769cb3252da67b","observation_id":"7f47db78-409e-4571-b29e-d2a191c19ad3","resolution":{"observed_at":"2026-07-30T15:27:16.779291Z","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-30T15:27:16.789129Z","title":"Mem: Multi-scale embodied memory for vision language action models,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.789129Z"},"links":{"citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:66d8132de96c9acbf3999ab19d42ac26b592341803e92fbbd7415052bbaa3e46","observation_id":"031d20b2-0085-4233-b1a2-5260c5271d8a","resolution":{"observed_at":"2026-07-30T15:27:16.789129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11706","last_updated":"2023-12-22T13:55:42Z","snapshot_observed_at":"2026-08-14T11:48:54.453482Z","submitted_at":"2023-06-20T17:35:20Z","title":"RoboCat: A Self-Improving Generalist Agent for Robotic Manipulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11706","snapshot_observed_at":"2026-07-30T15:27:16.804741Z","title":"Robocat: A self-improving generalist agent for robotic manipulation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.804741Z"},"links":{"cited_paper":"/paper/2306.11706","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:74a755afcf862a4d57a753495406320c28cd300892ab7da117eaf690196cd0d7","observation_id":"1c29fbd1-c399-4d2d-821b-86aa976c9bdc","resolution":{"observed_at":"2026-07-30T15:27:16.804741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.01488","last_updated":"2023-03-02T18:51:38Z","snapshot_observed_at":"2026-08-14T16:33:12.573795Z","submitted_at":"2023-03-02T18:51:38Z","title":"Self-Improving Robots: End-to-End Autonomous Visuomotor Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.01488","snapshot_observed_at":"2026-07-30T15:27:16.820824Z","title":"Self-improving robots: End-to-end autonomous visuomotor reinforcement learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.820824Z"},"links":{"cited_paper":"/paper/2303.01488","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:9e9118fff5b2278822ef1dab638f503b5888e1c702c34c162a33964b4a71570b","observation_id":"6b74c874-491d-4805-93b7-6d6604e54b54","resolution":{"observed_at":"2026-07-30T15:27:16.820824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.10921","last_updated":"2026-05-11T17:54:49Z","snapshot_observed_at":"2026-07-06T23:22:47.781940Z","submitted_at":"2026-05-11T17:54:49Z","title":"RoboMemArena: A Comprehensive and Challenging Robotic Memory Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.10921","snapshot_observed_at":"2026-07-30T15:27:16.826555Z","title":"Robomemarena: A comprehensive and challenging robotic memory benchmark,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.826555Z"},"links":{"cited_paper":"/paper/2605.10921","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:8f8842f3f641283512d8ea5c5f54ddfe758f9ca17d7a250235b760d27f5502b0","observation_id":"e894de6f-3c13-4eaa-a8da-e6563e021ba6","resolution":{"observed_at":"2026-07-30T15:27:16.826555Z","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-30T15:27:16.833639Z","title":"Meta-memory for large language models,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.833639Z"},"links":{"citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:d6ad5d870f811150b2449426d3ad082ceff74d2ecf63c0484ac2b07ee93c9a09","observation_id":"3884da90-0450-426e-80e9-847e8deb4462","resolution":{"observed_at":"2026-07-30T15:27:16.833639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.13705","last_updated":"2023-04-23T19:10:53Z","snapshot_observed_at":"2026-08-03T01:22:01.078078Z","submitted_at":"2023-04-23T19:10:53Z","title":"Learning Fine-Grained Bimanual Manipulation with Low-Cost Hardware","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.13705","snapshot_observed_at":"2026-07-30T15:27:16.843302Z","title":"Learning fine-grained bimanual manipulation with low-cost hardware,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.843302Z"},"links":{"cited_paper":"/paper/2304.13705","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:c8cf1b5e40f0dfa36b3d7b5257f7852a7ecedc1089cd61ae7522b87ddef1935d","observation_id":"7c94d588-2212-45f3-b822-e293a5facd77","resolution":{"observed_at":"2026-07-30T15:27:16.843302Z","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-30T15:27:16.853266Z","title":"M3e: Moka massive mixed embedding model,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.853266Z"},"links":{"citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:eacea829385b5d22d3ec5c697902ab61cfd96036f0b0d3aa449fecbace2a1f18","observation_id":"b8a65170-295d-430b-92ef-0b1492253cd5","resolution":{"observed_at":"2026-07-30T15:27:16.853266Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.27295","last_updated":"2026-06-26T13:05:58Z","snapshot_observed_at":"2026-08-15T04:27:25.784339Z","submitted_at":"2026-06-25T17:13:02Z","title":"LA4VLA: Learning to Act without Seeing via Language-Action Pretraining","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.27295","snapshot_observed_at":"2026-07-30T15:27:16.859104Z","title":"LA4VLA: Learning to act without seeing via language-action pretraining,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.859104Z"},"links":{"cited_paper":"/paper/2606.27295","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:b47a9bf97b9e86b9f4d8b2c6dd5acc0a1bcd47df6328487a0a9bcc30ea4a20f4","observation_id":"4ac59985-d49d-4684-beca-c75e53620a84","resolution":{"observed_at":"2026-07-30T15:27:16.859104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.24576","last_updated":"2026-06-05T10:03:57Z","snapshot_observed_at":"2026-08-14T10:56:34.636058Z","submitted_at":"2026-03-25T17:52:43Z","title":"Chameleon: Control-Indexed Prospective Memory for Visuomotor Manipulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.24576","snapshot_observed_at":"2026-07-30T15:27:16.869983Z","title":"Chameleon: Control-indexed prospective memory for visuomotor manipulation,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-30T15:27:16.869983Z"},"links":{"cited_paper":"/paper/2603.24576","citing_paper":"/paper/2607.23702"},"observation_digest":"sha256:45da032a1f7baeb82450c4d79853a47d5c550f6161e11324d6d89163de792cdf","observation_id":"3514071e-4f04-45d1-ad58-0d5d51e780a7","resolution":{"observed_at":"2026-07-30T15:27:16.869983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23702","last_updated":"2026-07-26T14:49:07Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-15T09:24:47.931213Z","submitted_at":"2026-07-26T14:49:07Z","title":"Try Once, Then Optimal: De-Redundified Procedure Memory for Cross-Episode Exploration Amortization"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":37},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.23702."}