{"as_of":"2026-08-04T06:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bd10ddb1878727cf8b5cc9327b3d5e83e9b4f07e8f9a7d5ba8cc905809072d51","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T01:06:46.318590Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T06:11:14.605930Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.20117","snapshot_observed_at":"2026-07-14T06:11:14.605930Z","title":"To know is to construct: Schema-constrained generation for agent memory,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11226","last_updated":"2026-07-13T08:17:53Z","snapshot_observed_at":"2026-08-01T23:48:01.119958Z","submitted_at":"2026-07-13T08:17:53Z","title":"Heterogeneous Agent Cohorts for Safe Open-Ended Exploration with Runtime Constraint Memory","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T06:11:14.605930Z"},"links":{"cited_paper":"/paper/2604.20117","citing_paper":"/paper/2607.11226"},"observation_digest":"sha256:10b1570d512c01a4fd2c76a4478211dd958d11f87ae9cf2c493db4ce6e0cb428","observation_id":"67341a33-4520-4820-8a5f-da6bdb15b5f3","resolution":{"observed_at":"2026-07-14T06:11:14.605930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.20117/citation-record","integrity":"/paper/2604.20117/integrity","json":"/paper/2604.20117/citation-record.json","paper":"/paper/2604.20117"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.03216","last_updated":"2025-12-12T11:26:32Z","snapshot_observed_at":"2026-07-06T17:25:35.493362Z","submitted_at":"2024-02-05T17:26:49Z","title":"M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation","version":5},"cited_work":{"arxiv_id":"2402.03216","doi":"10.48550/arxiv.2402.03216","metadata_source":"pith","pith_arxiv_id":"2402.03216","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation","venue":"cs.CL","work_id":"a9435752-4e49-42bd-95b4-0fec975633c8","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2402.03216","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:30aa87456f2d15092b9d34458141f61ed716dc6ed3ec10ee5a100710d4d835d0","observation_id":"eebfb614-bed2-46ce-8baf-8eb05b6f7665","resolution":{"observed_at":"2026-05-11T22:39:03.722424Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16130","last_updated":"2025-02-19T10:49:41Z","snapshot_observed_at":"2026-07-06T18:05:11.700127Z","submitted_at":"2024-04-24T18:38:11Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","version":2},"cited_work":{"arxiv_id":"2404.16130","doi":"10.48550/arxiv.2404.16130","metadata_source":"pith","pith_arxiv_id":"2404.16130","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","venue":"cs.CL","work_id":"588618d7-fd41-4053-b34d-a981f8793039","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2404.16130","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:1f35d9b90cea75c1636aec79f27b8e77589a704895231ac17bb630bcb4536174","observation_id":"b796d614-5272-48b9-9e77-f0d82d5b1a06","resolution":{"observed_at":"2026-05-11T05:10:58.470966Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:49:57.694079+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:49:57.694079+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":"2407.21783","doi":"10.1016/s0749-0720(15","metadata_source":"pith","pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"The Llama 3 Herd of Models","venue":"cs.AI","work_id":"1549a635-88af-4ac1-acfe-51ae7bb53345","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:0553a877420a8c22d5b3d77354c940c3b905f2d9e4089b1dcd27b18af06679bc","observation_id":"d92d1d71-ee31-4314-ac13-e316f319292f","resolution":{"observed_at":"2026-05-10T01:10:09.340961Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.07138","last_updated":"2017-05-02T13:52:08Z","snapshot_observed_at":"2026-07-06T05:39:00.801211Z","submitted_at":"2017-04-24T10:55:20Z","title":"Lexically Constrained Decoding for Sequence Generation Using Grid Beam Search","version":2},"cited_work":{"arxiv_id":"1704.07138","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.07138","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lexically Constrained Decoding for Sequence Generation Using Grid Beam Search","venue":"cs.CL","work_id":"6af7c58f-95a6-46c1-95de-0c7a113a5d26","year":2017},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/1704.07138","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:a3399d3e0357caa305ace055959e309cb6c947afe8680a57d34f6259677642db","observation_id":"b026db59-466a-4a8b-80b7-ca9ef2530817","resolution":{"observed_at":"2026-05-10T01:10:09.346378Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"A survey on hallucination in large language models: Prin- ciples, taxonomy, challenges, and open questions.ACM Transactions on Information Systems, 43(2):1–55","venue":null,"work_id":"54c46648-6c82-4f67-bddc-3493d74b5173","year":2025},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:7d8858b7796496cf9c616ddf393d2a19678e48cf7cc7481e6aa53e8ecee86795","observation_id":"f4b7868f-c45b-4f42-a036-f4fd3a818d0a","resolution":{"observed_at":"2026-05-23T10:07:50.510227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":"2409.12186","doi":"10.48550/arxiv.2409.12186","metadata_source":"pith","pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-07-10T16:07:20.290468Z","title":"Qwen2.5-Coder Technical Report","venue":"cs.CL","work_id":"09ba463d-6377-4017-9801-444ffb94b056","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:5d387c782c83003566feea5809ffc54b376042ad0de95a460330228e84af8562","observation_id":"6ffb5e46-c412-40ef-800e-8ad472b221b3","resolution":{"observed_at":"2026-05-10T12:33:39.124611Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:18:55.772185+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:18:55.772185+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09727","last_updated":"2024-07-22T05:33:51Z","snapshot_observed_at":"2026-07-06T17:30:25.359458Z","submitted_at":"2024-02-15T05:40:21Z","title":"A Human-Inspired Reading Agent with Gist Memory of Very Long Contexts","version":3},"cited_work":{"arxiv_id":"2402.09727","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09727","snapshot_observed_at":"2026-07-03T08:07:45.066450Z","title":"A human- inspired reading agent with gist memory of very long contexts","venue":null,"work_id":"072fe48b-345d-4f4d-8de8-87adbfe72aa7","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2402.09727","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:a67a6741eb239692689bb1c5bc41e0cf66d7827c2cb2829ac7765371483e9e8d","observation_id":"09e0eacb-67ff-4cdf-815d-afe947d24439","resolution":{"observed_at":"2026-05-10T01:10:09.370724Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.05520","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cam: A constructivist view of agentic memory for llm-based reading comprehension","venue":null,"work_id":"38c07cc8-f361-4230-b523-c69651a5db7e","year":2025},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:ac46d1ec6e91dffc4bd951d323f8660c67fac312c6e88ab7a57304ea8a7a3dee","observation_id":"4b17c0da-7152-43f3-bb8b-1f7aabe56c79","resolution":{"observed_at":"2026-05-10T01:10:09.358797Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13080","last_updated":"2025-05-28T04:54:26Z","snapshot_observed_at":"2026-07-06T19:34:59.826604Z","submitted_at":"2024-10-16T22:55:17Z","title":"Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models","version":2},"cited_work":{"arxiv_id":"2410.13080","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13080","snapshot_observed_at":"2026-07-03T13:28:19.014303Z","title":"Graph- constrained reasoning: Faithful reasoning on knowledge graphs with large language models","venue":null,"work_id":"b062905d-7fe5-442d-8fe2-388c3a03436d","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2410.13080","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:2196d681b5053d44d5a654a81bd96d07122692440300b6f09bb9e20824f9c0b3","observation_id":"7d842096-2393-477f-ab3a-36409ce98261","resolution":{"observed_at":"2026-05-10T01:10:09.351723Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17753","last_updated":"2024-02-27T18:42:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-27T18:42:31Z","title":"Evaluating Very Long-Term Conversational Memory of LLM Agents","version":1},"cited_work":{"arxiv_id":"2402.17753","doi":"10.18653/v1/2024.acl-long.747arxiv:2402.17753","metadata_source":"pith","pith_arxiv_id":"2402.17753","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Evaluating Very Long-Term Conversational Memory of LLM Agents","venue":"cs.CL","work_id":"2d8c9fb7-9ace-4925-8fe1-f4e44625d04c","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2402.17753","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:07d06ff8e905037e797b4196c3cd0ca6aff1b3045ba6ae45391fa382a80ecaad","observation_id":"6a7bc653-ccb5-4740-b932-80a0e1f58477","resolution":{"observed_at":"2026-05-12T08:05:17.171076Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"Memgpt: Towards llms as operating systems","venue":null,"work_id":"28cd57a7-1925-4b5a-a77a-9a3dc4b36ab2","year":2023},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:c40645fd06935cf0f9ca108aba6638be1461d14d2b1afb6afa180cf8c24f93b1","observation_id":"f70e6979-976f-4f2a-a9d3-a112366bd5d5","resolution":{"observed_at":"2026-05-23T10:07:50.506301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"International Universities Press","venue":null,"work_id":"3d49c019-d313-42a9-a416-e8e7f5723768","year":1952},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:b56cc63652c23c3af43785b373388f4ea362d696189a19a9686bb5656932cef4","observation_id":"4bef2d65-2c8e-4ebd-b51b-27d5153d78ad","resolution":{"observed_at":"2026-05-23T10:07:50.498625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"Columbia University Press, New York","venue":null,"work_id":"c549a794-ac6c-4dca-8547-f9f0084eb2e5","year":1970},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:45f2e7261a02eae0fcaf6b173f3249431ab4b6fc6898ce7c464438c7779afeb6","observation_id":"8ea85354-dc61-4a0a-82a1-2bd4c859b439","resolution":{"observed_at":"2026-05-23T10:07:50.518083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.11227","last_updated":"2022-01-26T22:57:44Z","snapshot_observed_at":"2026-07-06T12:31:37.941737Z","submitted_at":"2022-01-26T22:57:44Z","title":"Synchromesh: Reliable code generation from pre-trained language models","version":1},"cited_work":{"arxiv_id":"2201.11227","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.11227","snapshot_observed_at":"2026-07-04T10:39:45.103322Z","title":"arXiv:2201.11227 [cs.LG] https: //arxiv.org/abs/2201.11227","venue":null,"work_id":"e2b94811-1631-4761-b9be-91430bfba001","year":2022},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2201.11227","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:8d1b2c7532d66c0ffc6b3b6d3a694ddc81d91eafd6794f7e7bde8b473eed3701","observation_id":"cfc48cf8-63f4-457a-9fe3-32fed3c843c2","resolution":{"observed_at":"2026-05-10T01:10:09.356550Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.06609","last_updated":"2018-11-09T21:40:15Z","snapshot_observed_at":"2026-07-06T06:34:04.456625Z","submitted_at":"2018-04-18T09:06:11Z","title":"Fast Lexically Constrained Decoding with Dynamic Beam Allocation for Neural Machine Translation","version":2},"cited_work":{"arxiv_id":"1804.06609","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.06609","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast Lexically Constrained Decoding with Dynamic Beam Allocation for Neural Machine Translation","venue":"cs.CL","work_id":"e466e3e2-344c-46a4-be21-b0d72a25a19a","year":2018},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/1804.06609","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:4d30e2fa6364282356dfe6212e2506715c88bdb6bc24cab6701cbfba92961437","observation_id":"2a507294-9969-4c38-8f18-764ee60dce09","resolution":{"observed_at":"2026-05-10T01:10:09.363562Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14052","last_updated":"2025-03-19T21:18:02Z","snapshot_observed_at":"2026-07-06T19:35:39.803671Z","submitted_at":"2024-10-17T21:47:11Z","title":"From Isolated Conversations to Hierarchical Schemas: Dynamic Tree Memory Representation for LLMs","version":3},"cited_work":{"arxiv_id":"2410.14052","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14052","snapshot_observed_at":"2026-07-02T08:16:47.932293Z","title":"Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Xiao Bi, Haowei Zhang, Mingchuan Zhang, Y","venue":null,"work_id":"26016223-a9f0-484c-a904-142b1c5a9b50","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2410.14052","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:a5f5dde36b0a110702e9c3a8b376290d1c57f02ca2303446ba44a331aa6de5e8","observation_id":"b8d6987c-3038-4ab9-9eba-4eb4a29b5ca1","resolution":{"observed_at":"2026-05-10T01:10:09.373081Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"Raptor: Recursive abstractive processing for tree-organized retrieval","venue":null,"work_id":"dc9e7a68-2587-4943-8cca-43ca67ca9bb4","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:9a496e1e632400194aa7eb82b655d53bec501dfc70b678752b1e2d327c0b1186","observation_id":"c5019e62-3143-45ba-a80c-cf758f23999f","resolution":{"observed_at":"2026-05-23T10:07:50.514370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05093","last_updated":"2021-09-10T20:14:08Z","snapshot_observed_at":"2026-08-03T16:19:20.026344Z","submitted_at":"2021-09-10T20:14:08Z","title":"PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Models","version":1},"cited_work":{"arxiv_id":"2109.05093","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05093","snapshot_observed_at":"2026-07-04T14:49:54.607890Z","title":"Picard: Parsing incremen- tally for constrained auto-regressive decoding from language models","venue":null,"work_id":"4b3bd21a-0035-496a-9316-b40ddccac25f","year":2021},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2109.05093","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:a04ec63bad47b9ce2b8f6ec273a04f4c10fb720b47041128869e027abece86b1","observation_id":"2e585ea1-e526-45c1-ac9f-b9734a9223d7","resolution":{"observed_at":"2026-05-10T01:10:09.361180Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.08592","last_updated":"2025-08-26T03:31:26Z","snapshot_observed_at":"2026-08-04T03:15:12.650873Z","submitted_at":"2025-06-10T09:00:33Z","title":"Dense Retrievers Can Fail on Simple Queries: Revealing The Granularity Dilemma of Embeddings","version":2},"cited_work":{"arxiv_id":"2506.08592","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.08592","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dense retrievers can fail on simple queries: Revealing the granularity dilemma of embeddings.arXiv preprint arXiv:2506.08592","venue":null,"work_id":"ba2f6bda-2c3e-46de-8ca2-0c1c56ab8b15","year":null},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2506.08592","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:046e669c1787c08c58c6e64ab3ace792c6ac6b5e6e617b05a33ae0e83b5768c0","observation_id":"8e4f89db-39c4-49de-a1b8-04fe1974054a","resolution":{"observed_at":"2026-05-10T01:10:09.368255Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2502.12110","doi":"10.48550/arxiv.2502.12110","metadata_source":"pith","pith_arxiv_id":"2502.12110","snapshot_observed_at":"2026-07-11T03:27:46.348461Z","title":"A-MEM: Agentic Memory for LLM Agents","venue":"cs.CL","work_id":"3b98feb2-fdb1-479a-bbe4-2c298a4592e2","year":2025},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"cited_paper":"/paper/2502.12110","citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:805ede6095e36da6de3a0f8a66c3f29a472ab25d3df23c0eed4352eab27f0eec","observation_id":"4d084c76-1b2d-48e6-b5b4-6dbf8623d37e","resolution":{"observed_at":"2026-05-11T00:47:29.054201Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"Memorybank: Enhancing large language models with long-term memory","venue":null,"work_id":"5122d1e0-d24f-4dee-b590-4d77910a463b","year":2024},"citing_paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T01:06:46.318590Z"},"links":{"citing_paper":"/paper/2604.20117"},"observation_digest":"sha256:fc9917ff4414cfe4ecf496b2d92814b144935782b733c22110a1ff1be50073e7","observation_id":"533bf95e-65dd-41d1-a0e7-6aa07e201daa","resolution":{"observed_at":"2026-05-23T10:07:50.502496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.20117","last_updated":"2026-04-22T02:27:50Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-02T15:30:16.055028Z","submitted_at":"2026-04-22T02:27:50Z","title":"To Know is to Construct: Schema-Constrained Generation for Agent Memory"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":0,"verified_exact":13,"verified_fuzzy":6},"total_outbound_references":21},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 1 inbound Pith citation observation for arXiv:2604.20117."}