{"as_of":"2026-08-10T00:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:51d7709495102456386e1950eb96b9c92add62b21de7b017a42d3a2271ad89f4","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T13:56:36.654708Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2606.11391/citation-record","integrity":"/paper/2606.11391/integrity","json":"/paper/2606.11391/citation-record.json","paper":"/paper/2606.11391"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T13:56:36.654708Z","title":"Cognitive Science , volume=","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:64d0273deb1f3753890304956c3cb3622aeb9d5a2891096744491bbabc1cbb1c","observation_id":"77917897-2114-4b23-9b46-ff21ec5e6d92","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Artificial Intelligence , volume=","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:8bf4c40f9e966cda70a39d3c484b03512cca12855f8e8a2855f6d67a717e8cfb","observation_id":"a9207ab0-88b6-4e2c-9d01-c53156f5dab3","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Cognitive Computation , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:52994f5245229f20dae877a95e0712475f9c233cc19ae9d5681e5172715e330d","observation_id":"72df03ab-76ff-4911-b42d-af2157c6e2c6","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"2001 , publisher=","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:6d30c49fbc51fdcbe7b4444378174ce920b633d2fdebf3eaeaea358788fed943","observation_id":"0182ddfe-7fdd-4129-b5b7-74032858040f","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:10fa61d9e2f8f6954a9502fba8beaf02cbd6fec227e1ad006d405553321cf0aa","observation_id":"a4847662-1de5-40f4-b516-4afaa8310126","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"2020 , publisher=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:f2cb70e1a0817706dec095f615b09a0481aa869c23039ea04645d2deb41c36b0","observation_id":"9abd043c-a03f-466d-a20c-82a3482456da","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2023.emnlp-main.194","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SLOG: A Structural Generalization Benchmark for Semantic Parsing","venue":null,"work_id":"0f90d11e-56fe-4ca5-af9d-332bba8b5a57","year":2023},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:97b5c4c43acb23c79449cf12c7ca4d803e9ada405ac866ee1284879301c9d7db","observation_id":"e718d474-f43c-41a6-9ec8-091f12554759","resolution":{"observed_at":"2026-06-27T14:00:59.541106Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T13:56:36.654708Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:2396462590dc4b7be5145284ad4ab7ed2e18a68bd47d16ef056001578b18dab5","observation_id":"752f4412-c384-4406-af6d-33b643c68b38","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0004-3702(90)90007-m","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tensor Product Variable Binding and the Representation of Symbolic Structures in Connectionist Systems , url =","venue":"Artificial Intelligence","work_id":"949e718e-f074-4a57-a572-f4555e229be7","year":1990},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:b73340aea36eb7a333758c277f7540e6ddd9ed92a03e4ad40d52c08a783f26bb","observation_id":"eb4a5e27-5b98-407f-b8b5-96e502f556a4","resolution":{"observed_at":"2026-06-27T14:00:59.545571Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T13:56:36.654708Z","title":"2023 , eprint=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:5babb4b4aebae01ba8608ba745879372b2c5d2629cc806abf06a864538cccf19","observation_id":"f519a60d-2b85-4b98-ad66-7f49723cd537","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:c86ef95bd7e8df8477fbdf49e2885437e57e26b043b1332ef305b1672bc42785","observation_id":"08449eb0-27c6-44eb-98fa-a1a36113c436","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1162/neco_a_01179","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Neural Computation , volume =","venue":"Neural Computation","work_id":"e6f1862d-b204-4660-8dac-a8924471cc9d","year":2019},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:98a1986c9d99eb21746e259e49e1ccba2ce4a65560450d5137e7f038b057c00c","observation_id":"297e4d39-d911-44bd-b5b7-c9c72364218a","resolution":{"observed_at":"2026-06-27T14:00:59.534388Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T13:56:36.654708Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:a045b1c3ee78b7a33b0c0b3aa0f303c56aebba4d760b6c811e79ceeaf202c328","observation_id":"d9f61b63-430d-49ad-ab21-c5857b7a9d2c","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10462-021-10110-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A comparison of vector symbolic architectures , volume=","venue":"Artificial Intelligence Review","work_id":"f01ed43e-665c-4185-8bb7-122cee986731","year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:67c550fb76ef91ae615b41e9e2ca2615519ce1b4d2e38edee9de5acedfab8a5e","observation_id":"24010324-e33a-498c-a398-46c165c257a5","resolution":{"observed_at":"2026-06-27T14:00:59.543361Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3538531","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Surv.55 130:1–130:40 ISSN 0360-0300 URLhttps://dl.acm.org/doi/10.1145/3538531","venue":"ACM Computing Surveys","work_id":"7c707552-6c33-42bb-8069-514ec7eacf5b","year":2022},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:095d0f7f307f6e29ab768daeed5775bdeb2c775fa3221b21c610a4b669115fe7","observation_id":"11b5af5f-edd8-4f90-b6c2-213e6e3e87fc","resolution":{"observed_at":"2026-06-27T14:00:59.529285Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T13:56:36.654708Z","title":"International Conference on Artificial Neural Networks , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:20e4228c2dcf4d3003935bfe3697e548f81e3a4f62c53b25ed89809c74f75c93","observation_id":"e9924e91-0682-45e5-951c-abe8509de8f7","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"2003 , publisher=","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:03a83071c365a7ccf0cf538d6ce7665a52e9d7f708408195ea88b17669a5fae2","observation_id":"f61ddf59-9f14-4fd3-b2a0-3d73264b0151","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"2015 , eprint=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:159a34425d0cc4c0038a685bb533276982bd9fbda98f6ac19556c5b00cb3c67b","observation_id":"946336bf-3742-4390-af72-5ef569d52b40","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"1998 , url=","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:8f388f3b0c9c4545f82b0c58109ad440f40bbe4466e1addce1aee19b0c9937f0","observation_id":"2d70c2f5-4cfa-4f04-b6fc-b1045d72be68","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.52202/079017-0089","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Walsh Hadamard Derived Linear Vector Symbolic Architecture , url =","venue":null,"work_id":"e73003ad-9c62-47c9-8ad0-47247b7f6f9e","year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:4fa3af36a2f69257490a9638f168e004ff470eca4479b86a0693782a64eb6315","observation_id":"fafd1860-fb77-4b48-9f4d-3d078ad65117","resolution":{"observed_at":"2026-06-27T14:00:59.531700Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T13:56:36.654708Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:d3e8046924dddf5e4953ad8a789ab3425ad83ea32b659c2f741a88c05228f7ac","observation_id":"88f0defd-ec45-4f1d-a093-5fe95361d694","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:62f2eb3f02761dedc6e1ca049d1473339f982f1285c645b6f09560b43c6fd25c","observation_id":"bdd3870d-710c-486b-b130-2e073920e155","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"IEEE transactions on Knowledge and Data Engineering , volume=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:eec211d892112475eceadda7d4482e56855a867278f21e56b0c7317f4f9a4854","observation_id":"6d49f6d6-1ecf-4a2f-9100-ba812833c016","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"2015 IEEE Biomedical Circuits and Systems Conference (BioCAS) , pages=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:08d82cb8bbab937461a552733bbc020dd552197f9c732c6de1a78c134f05884d","observation_id":"24c49c56-c771-4b14-8ec0-97c88273e6d4","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:10fa76cb19303f765a5a6693774c7b9a9fd3c182bc8c9edf93699992de1d12be","observation_id":"6104f45e-47ce-42d3-b8f4-b2cba63279ff","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:d354f4f4d21e4fb572b36a1d4eb15ee434fe13f06558892e62f727e02a96c8af","observation_id":"a27eb86f-15d6-475d-9def-a244ce111a0f","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"IEEE transactions on computers , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:e0052dcb3fc947f2a9f51074d9da88eef6a202794e46391f95d9e7a2de757e38","observation_id":"942e955a-50f2-4c78-b5eb-0fb406e49e9b","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0025-5564(72)90075-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"1972 , issn =","venue":"Mathematical Biosciences","work_id":"065c778f-8ccf-43d4-b9e0-c61b14990d92","year":1972},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:bd5a51714d61342a7b980ad752089ecddad41e3547d70f69313de499f0e61f05","observation_id":"cfea4341-3d9e-4c71-9950-addded6febd9","resolution":{"observed_at":"2026-06-27T14:00:59.539084Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T13:56:36.654708Z","title":"IEEE Transactions on Systems, Man, and Cybernetics , number=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:5485bde2ecfe81900be4233f76704d89ce26e003fcc8381645e2ad5b915a57d4","observation_id":"7c2cd0ec-23a1-435b-9098-a8ae6e527a2e","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"IEEE Transactions on Computers , volume=","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:54fa2e9a6d2c08d5958dd6f91992fa7e5486dfd896756e19ab0778cc78979490","observation_id":"7645ceb6-4c97-4f85-a3c4-4bf2bf79cb27","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:54893f629450e6d6166013a6411b4654faf440e5eec83638a4df18067d4860c8","observation_id":"515b5ff6-8f6c-475a-bb5b-d16447ac9818","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"IEEE transactions on Information Theory , volume=","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:cc6f0b6f0f3575f92f5fc66dc796d2e5f682bda6e0789fc74884a7b96d68f904","observation_id":"0c182c80-efab-423c-a425-daf1f4840bc4","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Physical Review Letters , volume=","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:b63bdc8c2c1334a3337f752445154bdd3ff8c1e6fd9bf4c87747d05855439358","observation_id":"7d7a2252-351f-43f1-9dd1-974eaf10df69","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:d83b861434007250d7790a248c6fd226f5d94077f942b81bdf4e363cb7d9a2ea","observation_id":"08679a04-5fb3-4cda-bc52-3f5273c5316a","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Journal of Statistical Physics , volume=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:e4283262f9eaf5f6e4700e052e91f98c9c9493ee2c8f0faad91753c1743b7e07","observation_id":"9746f486-bfe8-4fc5-9ffc-8bf21e1d8152","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Neural computation , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:d949408bb00f9807757a8f31cdb3c31b15c664691fc5ae76cbafba6da9662f95","observation_id":"2aad9d7c-9c14-4f39-94d7-4ea679a23c0a","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Physical Review Letters , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:3ab3bffa01d72479a37c1941ac94afa2f69b37ab58a19a54a8203910622aa603","observation_id":"72b3a5f9-c438-469b-aa0f-719cd90cc7c5","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:fe218c033d98d37d41f8a9584b44b8c90ae6971884dd1c5088879b23e51734a9","observation_id":"2ac65ba7-6282-45c4-8702-4022b92f7c6e","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03827","last_updated":"2024-11-10T19:25:40Z","snapshot_observed_at":"2026-07-06T17:55:53.304768Z","submitted_at":"2024-04-04T23:05:30Z","title":"Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models","version":3},"cited_work":{"arxiv_id":"2404.03827","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.03827","snapshot_observed_at":"2026-07-03T04:27:36.509893Z","title":"arXiv preprint arXiv:2404.03827 , year=","venue":null,"work_id":"659055a3-bb6e-4943-bc62-87c764ae1e0b","year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"cited_paper":"/paper/2404.03827","citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:296e8b29c84c1230086acd90f511ef73711185552caf3634983125042350d097","observation_id":"b39db54b-0f73-46da-a1c0-10022d27bac0","resolution":{"observed_at":"2026-07-03T04:27:36.511516Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1403.3369","last_updated":"2024-11-17T14:20:18Z","snapshot_observed_at":"2026-08-05T13:37:25.619175Z","submitted_at":"2014-03-13T18:58:37Z","title":"Controlling Recurrent Neural Networks by Conceptors","version":4},"cited_work":{"arxiv_id":"1403.3369","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1403.3369","snapshot_observed_at":"2026-07-03T04:27:36.507931Z","title":"Controlling recurrent neural networks by conceptors","venue":null,"work_id":"896d67a4-8063-4353-96a5-161bc1368971","year":2014},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"cited_paper":"/paper/1403.3369","citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:7544226e2819c93e9601a31d94c5e79fd414bc263e72b83505fcd0faf1a11c4d","observation_id":"417ac47f-6ccd-4000-966b-84ec8c96c86f","resolution":{"observed_at":"2026-07-03T04:27:36.509417Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T13:56:36.654708Z","title":"Journal of Machine Learning Research , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:80007ebfc565f9b98d96bc8b6df3680af84bcf852077c5c27b5ac624658aba3b","observation_id":"1f0b3b37-eea7-4f60-862b-bcc0c0d8f54a","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:d37def6da8632d5676276b4b4eb6421d3d46fec54e0dc19b4df940029bacdae0","observation_id":"6ef71052-8955-46ea-b355-3299b2f67653","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Nature Machine Intelligence , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:19290d5983c1451b0478de8fc8129cd48f2de0a0906cb9fa7bbdb8028130e128","observation_id":"6b3e25af-5078-43e5-95ee-6340187234e9","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"International conference on artificial intelligence and statistics , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:81d6aa2b9028a91936bf191e519a9ff769f9e8f2b9103e88ce96a7e5d2ce3017","observation_id":"4ee2cb09-1970-442d-aea6-fcb8ea22c7ae","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.09762","last_updated":"2021-03-17T16:31:29Z","snapshot_observed_at":"2026-08-07T22:26:17.816043Z","submitted_at":"2021-03-17T16:31:29Z","title":"Gradient Projection Memory for Continual Learning","version":1},"cited_work":{"arxiv_id":"2103.09762","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.09762","snapshot_observed_at":"2026-07-04T06:19:38.018427Z","title":"arXiv preprint arXiv:2103.09762 , year=","venue":null,"work_id":"c153a61d-0cc6-4da4-b9a8-ebb88319bd68","year":2021},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"cited_paper":"/paper/2103.09762","citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:d22fe4da34acc8a8cc910f6920cfaa83d56ee808ab42864aa440a9c29cbb2bd2","observation_id":"83ef4a51-5438-447b-9d7d-1ee9b448468b","resolution":{"observed_at":"2026-07-03T04:27:36.508725Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T13:56:36.654708Z","title":"Proceedings of the AAAI conference on artificial intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:8dc0e8c70e73aa35fa90e6666483fcd3e8bfd2c8caa2f7f6a75e9aae6001cd84","observation_id":"c8eec806-68ba-439d-b7df-cd3f2bd1bba2","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Proceedings of the 30th ACM International Conference on Multimedia , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:1a4848ae15b701977e6813f351d171e7fe452a3341077fd2257182e9352682f0","observation_id":"3fe1f4ec-48b6-4a00-bf24-2e89f0f17ede","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:bc095ebb143818a7d5286069e465dc08b8fbde22f124cb38bc070af1e0234709","observation_id":"191ff779-3607-4b46-8505-2fc1e7531dd5","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Findings of the Association for Computational Linguistics: EMNLP 2023 , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:773f58be82c3a42d964c8f4690fb3e9ab540f659890ba3f7cf7b940ac9dc892e","observation_id":"bc4e5ade-f188-474a-b6ba-5ced3ef74a16","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:443f7c8eeab50a0e935a7ac0898159a7ff520900c0d5fc9b9de668f9f1175c26","observation_id":"fd5bb9dd-a6c5-41d0-bf31-c440072c5f58","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"and Dahiya, K","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:7afb2df8e39b4e31f6c5b446382184d8cd277067c859c4398f3e9ee1eb689d8a","observation_id":"8af8811f-5685-4982-bb3c-d1dd3f688342","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"2003 , publisher=","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:3210b1aba19a218a19974394fd2766acd1a97c26f3425b3e9394d3fe2998ede6","observation_id":"a6467eff-b2cf-451f-a965-584281f1a2c4","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"2012 , eprint=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:04748c7b7b2543d606765b980cb5bc25dab5e2cc25fc34db88c9968823dd20b6","observation_id":"7be57d49-1f3f-4d91-9bf9-3a17b123b8da","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":", journal=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:7d94cdc48a63582b7d26bf68eb34b80fc241ec1ccf1f62722a5da18131095bc7","observation_id":"3912c863-3bdf-4418-812c-ae1b415a70ec","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Advances in Neural Information Processing Systems , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:b29feaba2a14b69b4890a276df5e48f5fa7256fa35f65764225b233f41ba909e","observation_id":"1a3f0619-91b5-4b57-8ee4-80cffd16e0a5","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"Transactions on machine learning research , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:4d43c2d1ba89bef808e1276204abfa67bfc42cea8ec70006ec331d862c77812b","observation_id":"50def2fc-4a7d-4ee9-80d0-51e3826884a9","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"and de Keninck, Steven and Welling, Max and Brandstetter, Johannes , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:787a3e49f1d0db31af2279465361c7427e39b32254524cb3fab4949f1337da94","observation_id":"8cd16eeb-a050-467b-bf3a-13b69df4ceda","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","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-06-27T13:56:36.654708Z","title":"International Conference on Machine Learning , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-06-27T13:56:36.654708Z"},"links":{"citing_paper":"/paper/2606.11391"},"observation_digest":"sha256:d2ecad7ed92674b311c3430c809d7d8a65b94e05811264cf3a4dda8162e419bc","observation_id":"6eef30c7-d77e-4514-9072-a0bb0e02d69a","resolution":{"observed_at":"2026-06-27T13:56:36.654708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.11391","last_updated":"2026-06-09T19:16:12Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T14:24:49.540209Z","submitted_at":"2026-06-09T19:16:12Z","title":"Recursive Binding on a Budget: Subspace Carving in Order-p Tensor Memories"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":48,"verified_exact":8,"verified_fuzzy":0},"total_outbound_references":58},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2606.11391."}