{"as_of":"2026-08-09T14:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f058a5e083efc9c2a7d7bee67b353e6b94e2c063939d9d36754f4708c4e5ac30","coverage":[{"denominator":70,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":70,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T15:02:53.641160Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"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/2512.18471/citation-record","integrity":"/paper/2512.18471/integrity","json":"/paper/2512.18471/citation-record.json","paper":"/paper/2512.18471"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T15:02:45.586658Z","title":"Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition,","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:45.586658Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:d40f6468923ba8656cc5fb462d07837b236808779aef57f93ea5549c72491228","observation_id":"87c359e7-fa03-4ae5-83f8-e96a7cfc49f0","resolution":{"observed_at":"2026-08-03T15:02:45.586658Z","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-08-03T15:02:45.761714Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:45.761714Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:db6dcd8ccfe46b11c55be0bf154240bce65bb2707dfcc04388707874e9290efd","observation_id":"c916fa1a-fdb2-4067-9928-a02683f06eb7","resolution":{"observed_at":"2026-08-03T15:02:45.761714Z","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-08-03T15:02:46.006472Z","title":"Understanding machine learning: From theory to algorithms,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:46.006472Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:95c92d0098a226c8e14e3f4a99bb21c86e7dd8e8521055bb4bb9e0849d90c43f","observation_id":"f389d9a2-3b33-4003-915e-48af6f8a5cdb","resolution":{"observed_at":"2026-08-03T15:02:46.006472Z","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-08-03T15:02:46.166077Z","title":"Catastrophic interference in connection- ist networks: The sequential learning problem,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:46.166077Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:1e99a84dee89e43f9043c69e21326012eb5f3f4a3df92d11825bc58ade8db29e","observation_id":"71a4810a-1077-4720-9510-f39dcea2ab8e","resolution":{"observed_at":"2026-08-03T15:02:46.166077Z","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-08-03T15:02:46.410325Z","title":"Catastrophic forgetting in connectionist networks,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:46.410325Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:b3fc101ee0f8fce68af3e53f2f067567b71d493138add1c6b738fefa44cfa3d9","observation_id":"9307bb0d-1741-4777-8a79-90f4aa853915","resolution":{"observed_at":"2026-08-03T15:02:46.410325Z","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-08-03T15:02:46.583567Z","title":"Continual lifelong learning with neural networks: A review,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:46.583567Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:86d83ae678b9057d1c37dcfaba9e6061916087c586b47b2fbda68dcc9677dbbd","observation_id":"56225271-5d5f-413a-b527-58886acd1754","resolution":{"observed_at":"2026-08-03T15:02:46.583567Z","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-08-03T15:02:46.650100Z","title":"Buzs ´aki,Rhythms of the Brain","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:46.650100Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:cf8260b86daece73c5558c7a0cc9fcea266d49963d4e6c585b068580235c3b9d","observation_id":"a0b74834-ff55-4200-b95b-c05d6fb76fc7","resolution":{"observed_at":"2026-08-03T15:02:46.650100Z","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-08-03T15:02:46.750476Z","title":"The columnar organization of the neocortex,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:46.750476Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:b386790252e1fb77f1f41dce9e03e28b667f0d53dc14727ad3fb1d8f9470a2bf","observation_id":"0e45a919-8399-4bbc-b865-81350111fa0c","resolution":{"observed_at":"2026-08-03T15:02:46.750476Z","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-08-03T15:02:46.844353Z","title":"A hierarchy of temporal receptive windows in human cortex,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:46.844353Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:35576b4a8f57b16a4d01cdcf5bee72c776d86407b17aa40f98eb229a7d28bea9","observation_id":"14cf011f-3ef2-4ccf-aa88-b0aaaef099ad","resolution":{"observed_at":"2026-08-03T15:02:46.844353Z","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-08-03T15:02:47.007516Z","title":"The architecture of complexity,","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:47.007516Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:1779f36afd93d82d48e7e426a81d520b4fdfe4137da104a1516afbb0ead334b9","observation_id":"0f707aa9-3979-4487-9630-b92fb8dbf247","resolution":{"observed_at":"2026-08-03T15:02:47.007516Z","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-08-03T15:02:47.160605Z","title":"A global geometric framework for nonlinear dimensionality reduction,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:47.160605Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:f17bcde267d54f7f6671b92b4b1da7bdac1685301703562e280ea251b26942e6","observation_id":"8f8e7d39-c944-458f-a287-f202fddf36fb","resolution":{"observed_at":"2026-08-03T15:02:47.160605Z","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-08-03T15:02:47.263470Z","title":"Testing the manifold hypothesis,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:47.263470Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:c6f6790eb6f3033e52297cba04f81056c816db04cd5d10db2bf3dad001d6246f","observation_id":"a01f5611-fc4a-4806-9f92-8fd57b4a0129","resolution":{"observed_at":"2026-08-03T15:02:47.263470Z","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-08-03T15:02:47.377575Z","title":"Gromov,Metric Structures for Riemannian and Non-Riemannian Spaces","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:47.377575Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:793016bed2bbc417e8d0ac7fb2acafea05b85a40c9721afe10780a95e2d5b33a","observation_id":"f503b3fa-c357-45c9-9d9d-283b1f40eacd","resolution":{"observed_at":"2026-08-03T15:02:47.377575Z","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-08-03T15:02:47.483843Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:47.483843Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:6b8437d867d10c22432eef832e42e01b801a3157827d5c5f81f62d53e73ab33e","observation_id":"e757a384-6989-4e5e-9fb2-def6b898e813","resolution":{"observed_at":"2026-08-03T15:02:47.483843Z","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-08-03T15:02:47.609063Z","title":"Catastrophic forgetting, rehearsal and pseudorehearsal,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:47.609063Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:186672405a1e01dee2272d9b7f226e42f0c41f560d371eaeb0fdfaa675adc5bd","observation_id":"e813f956-fa22-44ad-b324-fb8fc52392d9","resolution":{"observed_at":"2026-08-03T15:02:47.609063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.05952","last_updated":"2016-02-25T17:55:31Z","snapshot_observed_at":"2026-07-06T04:37:00.543211Z","submitted_at":"2015-11-18T20:54:44Z","title":"Prioritized Experience Replay","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.05952","snapshot_observed_at":"2026-08-03T15:02:47.770642Z","title":"Prioritized experience replay,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:47.770642Z"},"links":{"cited_paper":"/paper/1511.05952","citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:36f30c27079ae91e81b0c7b74bda6220b3e3a61b5c6866de2521942eb1c073a5","observation_id":"68f57b12-9e4c-409c-8ca8-a9c5ef5e9b45","resolution":{"observed_at":"2026-08-03T15:02:47.770642Z","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-08-03T15:02:47.939639Z","title":"Overcoming catas- trophic forgetting in neural networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:47.939639Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:195f0158e724044ccedbb796442d8906bad67a99d3c9679e96880bf6c92056e0","observation_id":"31009171-07b8-4bb5-9d35-b3631d43058e","resolution":{"observed_at":"2026-08-03T15:02:47.939639Z","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-08-03T15:02:48.093171Z","title":"Feudal reinforcement learning,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:48.093171Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:bea402573dfc8d4fe428d03df2de1c99a694a61f33d75b47dc9d9a6bdd0e47a6","observation_id":"44e5c350-39cc-4f55-a7e7-dfeda3e0f1c1","resolution":{"observed_at":"2026-08-03T15:02:48.093171Z","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-08-03T15:02:48.202529Z","title":"Hierarchical reinforcement learning with the maxq value function decomposition,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:48.202529Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:b509668258ea1580603b2e8daafdfadce12f71c53fb0f793b11b7563a9a9e73d","observation_id":"6c5fc5a4-0ff4-42a7-bddf-7368cbcabf39","resolution":{"observed_at":"2026-08-03T15:02:48.202529Z","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-08-03T15:02:48.372386Z","title":"Benefits of depth in neural networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:48.372386Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:56c630e695638ea801941846f3c80dc357a93d171367731aa2d62ac12129c21a","observation_id":"bc1494ae-7d21-47f7-ab81-4c0c58900b84","resolution":{"observed_at":"2026-08-03T15:02:48.372386Z","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-08-03T15:02:48.501522Z","title":"Proto-value functions: A laplacian framework for learning representation and control in markov decision processes,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:48.501522Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:16c7311aef772be2c0c9657ee81136a6e5d7e61f9200d45835011c934fccf72b","observation_id":"1fa681e0-2540-440a-8f31-5c17634dd878","resolution":{"observed_at":"2026-08-03T15:02:48.501522Z","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-08-03T15:02:48.587376Z","title":"A comprehensive survey of continual learning: Theory, method and application,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:48.587376Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:99ff440a876fcf2fc0aab67a80c47451752484a34aa37c1ac6e17ef59df257af","observation_id":"2bf48162-642f-48bd-b1e9-b673009cd650","resolution":{"observed_at":"2026-08-03T15:02:48.587376Z","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-08-03T15:02:48.706698Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:48.706698Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:003623e191f1de8aa24080046bd32479c898ca5538a8b609b8273b7d574beec6","observation_id":"034647c3-0fb5-4908-9941-0f7d7734da6b","resolution":{"observed_at":"2026-08-03T15:02:48.706698Z","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-08-03T15:02:48.809653Z","title":"Vershynin,High-Dimensional Probability: An Introduction with Applications in Data Science","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:48.809653Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:5eaab2d0899d7c8b163152bfdd961d1efe604715927606f6daa2af938f35c79d","observation_id":"50f4a7f2-a14e-47de-b94a-47c1c99c2921","resolution":{"observed_at":"2026-08-03T15:02:48.809653Z","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-08-03T15:02:48.953417Z","title":null,"venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:48.953417Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:00bab071d6934b31cfbde4f5c8ac2e15074c3961effc29b31f99c1bb417a81c6","observation_id":"bca98fb7-927d-4b46-b2cd-485870e54b2e","resolution":{"observed_at":"2026-08-03T15:02:48.953417Z","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-08-03T15:02:49.061479Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:49.061479Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:0894f95caca5479b091653847f61eb2908df05e65d2735bfd2edc58be9ed8d82","observation_id":"30f50604-895c-4168-bead-705ef7e4d4e0","resolution":{"observed_at":"2026-08-03T15:02:49.061479Z","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-08-03T15:02:49.164867Z","title":"Gromov,Metric Structures for Riemannian and Non-Riemannian Spaces","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:49.164867Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:0cf1898d35289fc63d5b8d5cfd64b639321ed08dd8010efec7ef9e56c05c6fca","observation_id":"17566e0e-16fb-4b23-838e-096aeafd2856","resolution":{"observed_at":"2026-08-03T15:02:49.164867Z","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-08-03T15:02:49.289287Z","title":"On the gromov–hausdorff distance,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:49.289287Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:c1058cd3301274c2743a7da4e20a92847239a2e615ccb7c357885ef9cf661df0","observation_id":"fa65b970-6400-43cc-b08c-8f371c1716a3","resolution":{"observed_at":"2026-08-03T15:02:49.289287Z","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-08-03T15:02:49.407468Z","title":"Diffusion maps,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:49.407468Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:68c1f8855aa3ef7089325564536b6df5ce2b8e04fa3c187a5d8f3a8d8c2ece57","observation_id":"d80f63a0-df53-4bb4-8948-83306d90f313","resolution":{"observed_at":"2026-08-03T15:02:49.407468Z","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-08-03T15:02:49.466366Z","title":"Burago, Y","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:49.466366Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:0bd91346179111487ccfa7e45229da5e181a3268f5430b46c3792151ff361882","observation_id":"c0f8495a-86c5-4981-ab13-1d41f7bb8d71","resolution":{"observed_at":"2026-08-03T15:02:49.466366Z","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-08-03T15:02:49.536216Z","title":"The hippocampus as a cognitive graph","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:49.536216Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:44c823bbcc16d33366f560ea02ad10f879b9be72855ad7f2bda374b7946256e2","observation_id":"54bfcaf5-3deb-4c37-9df3-3631c79ab88b","resolution":{"observed_at":"2026-08-03T15:02:49.536216Z","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-08-03T15:02:49.612370Z","title":"Memory, navigation and theta rhythm in the hippocampal-entorhinal system,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:49.612370Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:b1f30d147f97d86ccdb3439f3b9ec56cf107ba21f0d135968f883bcaeade1bae","observation_id":"c417f06f-7d9f-4e86-a3b1-b1474d7a8fd1","resolution":{"observed_at":"2026-08-03T15:02:49.612370Z","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-08-03T15:02:49.665038Z","title":"Simplified neuron model as a principal component analyzer,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:49.665038Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:a9fbcd2354dc4ae8e863a13f58383ae8b822f08071616981988951af8a89a9c5","observation_id":"0480e7ca-db8f-41d4-b918-45125c48cee2","resolution":{"observed_at":"2026-08-03T15:02:49.665038Z","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-08-03T15:02:49.782703Z","title":"Optimal unsupervised learning in a single-layer linear feedforward neural network,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:49.782703Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:e99d61b2d52886cf3a72c3b2247777b48656733d2af8d566fde257db845778f8","observation_id":"5b3b11e1-e5bd-4822-8769-381467fadad4","resolution":{"observed_at":"2026-08-03T15:02:49.782703Z","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-08-03T15:02:49.861059Z","title":"Reactivation of hippocampal ensemble memories during sleep,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:49.861059Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:52cb688d58d6c2ff87f6f418ff85124024fea8dc0f0e7965aaf2ee16fafd9e1e","observation_id":"3f404564-2056-40ad-803c-a217e51704db","resolution":{"observed_at":"2026-08-03T15:02:49.861059Z","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-08-03T15:02:50.008069Z","title":"Hierarchical process memory: memory as an integral component of information processing,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:50.008069Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:5e01f324ee930aa7fdd5e013c6811cc336088039ee69e45e2a442a74f8458dc4","observation_id":"3d87dec5-1cbc-42fc-b857-f7be6f70b2fc","resolution":{"observed_at":"2026-08-03T15:02:50.008069Z","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-08-03T15:02:50.141989Z","title":"A continual learning survey: Defying forgetting in classification tasks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:50.141989Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:19c5b77b5d1e725531c581805f15358359f45787c93a7d3773c9278bd379c9f8","observation_id":"2ac6198b-0926-40e4-9d6f-d6726a829133","resolution":{"observed_at":"2026-08-03T15:02:50.141989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.10976","last_updated":"2026-05-08T19:25:17Z","snapshot_observed_at":"2026-07-06T22:38:45.907386Z","submitted_at":"2025-12-03T00:51:25Z","title":"The Homological Brain: Parity Principle and Amortized Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.10976","snapshot_observed_at":"2026-08-03T15:02:50.255939Z","title":"The homological brain: Parity principle and amortized inference,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:50.255939Z"},"links":{"cited_paper":"/paper/2512.10976","citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:0af2307ed637f6c79d1d19ef2908627cd413deb17de0ef654a8c7a6dcc60cfd3","observation_id":"b9459fe4-d97c-4889-9256-2a51c17d8ec4","resolution":{"observed_at":"2026-08-03T15:02:50.255939Z","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-08-03T15:02:50.406322Z","title":"Active inference: a process theory,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:50.406322Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:f99e61eb82e47df16d553c035538307164e8a8a70bde1dbe825918d048099887","observation_id":"4bb05a04-f9cb-4c1e-b3aa-83e3f2db75ed","resolution":{"observed_at":"2026-08-03T15:02:50.406322Z","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-08-03T15:02:50.564236Z","title":"Memory consolidation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:50.564236Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:147fd44911d866d362c5fb6d5d1e0749a8ec29a32d1718422c23fa5cd8311f0e","observation_id":"b4becc62-f718-478f-ab94-dcce1afb04a9","resolution":{"observed_at":"2026-08-03T15:02:50.564236Z","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-08-03T15:02:50.645587Z","title":"Relationships between nondeterministic and deterministic tape complexities,","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:50.645587Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:a252d0b2b9bff3c9f24bf95e3a330bc72a5dce0a45f8d8bec48c9656e70eadf1","observation_id":"7e21813f-afca-4a01-8905-1b9bc1da9a58","resolution":{"observed_at":"2026-08-03T15:02:50.645587Z","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-08-03T15:02:50.814298Z","title":"Shawe-Taylor and N","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:50.814298Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:243031d6ab457a0639a574296d44276dd9c7262a5f4684226b2c0ff22ed07156","observation_id":"ac3c856d-4dd8-4586-ae32-c1fa842e18fc","resolution":{"observed_at":"2026-08-03T15:02:50.814298Z","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-08-03T15:02:50.962435Z","title":"Willard,General topology","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:50.962435Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:768a3ea6980be7725db342542e2f9ca6bf098d338ea8c98e0a5890ba4e048b96","observation_id":"5263b9b7-234d-48cb-a822-33f9ef80f2c7","resolution":{"observed_at":"2026-08-03T15:02:50.962435Z","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-08-03T15:02:51.070727Z","title":"Bellman,Dynamic Programming","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:51.070727Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:ddce293e26d19004d39e1ec0c551906123fb880ff4d08d63e19f8c570ae5bcc2","observation_id":"437e7f6f-2368-4011-acaa-95eab114fcbf","resolution":{"observed_at":"2026-08-03T15:02:51.070727Z","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-08-03T15:02:51.210170Z","title":"The theta-gamma neural code,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:51.210170Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:170779fae13d87e0b2e9b179080205b6b42b1a4e6c38ece3f8fd8f30622fb528","observation_id":"dd355730-2046-4025-96d0-3bc61206d3db","resolution":{"observed_at":"2026-08-03T15:02:51.210170Z","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-08-03T15:02:51.286465Z","title":"The hippocampo-neocortical dialogue,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:51.286465Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:bb3591026c2f37b8b6e46397de325cee6d93372c4aa97c203dcbe073f1c3bae7","observation_id":"968599b9-da6d-47a2-bc46-a5065be801c5","resolution":{"observed_at":"2026-08-03T15:02:51.286465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.00173","last_updated":"2018-01-16T08:54:12Z","snapshot_observed_at":"2026-08-08T10:21:14.704361Z","submitted_at":"2017-12-30T18:27:35Z","title":"Theory of Deep Learning III: explaining the non-overfitting puzzle","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.00173","snapshot_observed_at":"2026-08-03T15:02:51.402132Z","title":"Theory of deep learning iii: Explaining the non-overfitting puzzle,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:51.402132Z"},"links":{"cited_paper":"/paper/1801.00173","citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:4f955791237449834985e1b3d0d9ec1e9f550248a6ba0d55a3709833751a0952","observation_id":"45591153-5370-4639-b4a9-67541276db72","resolution":{"observed_at":"2026-08-03T15:02:51.402132Z","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-08-03T15:02:51.500247Z","title":"Hatcher,Algebraic topology, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:51.500247Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:621287aad3a9ea4d2e990a3a967d95f2593deb212a9dace5721d6ce0ec1ac8f6","observation_id":"e6ccd7e4-c49e-49c5-b445-19ce51144afb","resolution":{"observed_at":"2026-08-03T15:02:51.500247Z","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-08-03T15:02:51.560896Z","title":"Kahneman,Thinking, fast and slow","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:51.560896Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:f59bd4d228155a4d8d6ac3803153ab52ebbade9f63b59a159285eb7498566ce4","observation_id":"fed5ce68-d56f-42ae-a309-902deba26ce9","resolution":{"observed_at":"2026-08-03T15:02:51.560896Z","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-08-03T15:02:51.613900Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:51.613900Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:229d9a0df97d27381a8b758893d5f2c9d9c9988df52a1efcc8dbab4eacb7e56c","observation_id":"953eaf3d-4cd7-4299-ba5f-bfcb269e284f","resolution":{"observed_at":"2026-08-03T15:02:51.613900Z","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-08-03T15:02:51.722054Z","title":"Nakahara,Geometry, topology and physics","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:51.722054Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:ea365c36350e08c5cf9d9209728ce36e60442627c8a8092202f7839510c0134d","observation_id":"a9f5fd20-cb13-4a0b-8c58-3dadc4a874b7","resolution":{"observed_at":"2026-08-03T15:02:51.722054Z","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-08-03T15:02:51.783909Z","title":"Amortized inference in probabilistic reasoning,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:51.783909Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:3d2084a6620223fd2c5899474da1251b85acedf730b7ec4447af6b71fff8ede0","observation_id":"be149ce9-c1a2-4a6b-945c-9ce3576216b3","resolution":{"observed_at":"2026-08-03T15:02:51.783909Z","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-08-03T15:02:51.915899Z","title":"The magical number seven, plus or minus two: Some limits on our capacity for processing information","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:51.915899Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:78eb2268094cf66794cffbaca59f0e4902d772c17863ef90a6f5ed838745857b","observation_id":"ab776e95-654a-4b2d-aea9-c1ed7f89f13e","resolution":{"observed_at":"2026-08-03T15:02:51.915899Z","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-08-03T15:02:52.083468Z","title":"Canonical microcircuits for predictive coding,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.083468Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:a3bf5ab56cc66c5d608758bc9f45e3f29ec7c2830b430d0dc3aca7d5403dcc04","observation_id":"ef8c3666-07d8-463b-a09f-650ba0b807b6","resolution":{"observed_at":"2026-08-03T15:02:52.083468Z","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-08-03T15:02:52.174189Z","title":"The “wake-sleep","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.174189Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:e577f3430e4260d220dfe988441cb747edef8133b3a92b1721a31d5ead2897de","observation_id":"ef24c3df-0e4c-41f6-a678-9b7a5aae8db0","resolution":{"observed_at":"2026-08-03T15:02:52.174189Z","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-08-03T15:02:52.233536Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.233536Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:4a30a6a08941340af267e204542c98e774360daf052f4970051d3734ec5c1411","observation_id":"ad9e5013-5455-4940-94a4-b4fd2c817fc4","resolution":{"observed_at":"2026-08-03T15:02:52.233536Z","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-08-03T15:02:52.286416Z","title":"Pearl,Causality","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.286416Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:40c8aae87012ca580aef337dcd69ac6f74dcb14356505f979923288a71fdea69","observation_id":"7a4b5f7c-401c-4c7c-bd1c-bf8c312170da","resolution":{"observed_at":"2026-08-03T15:02:52.286416Z","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-08-03T15:02:52.323107Z","title":"Hippocampal place-cell sequences depict future paths to remembered goals,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.323107Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:fb1caa95cf8a5b9272842e2e78e599e8ef6a1a0bd47ee6bac28273682d48997d","observation_id":"1b8f829c-cfe7-446f-b02f-046fe4b0e3b5","resolution":{"observed_at":"2026-08-03T15:02:52.323107Z","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-08-03T15:02:52.408450Z","title":"The mechanisms for pattern completion and pattern separation in the hippocampus,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.408450Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:314f111004d96d5a8160594820a56cb67bfe35c679a8afdbc9d675c174da1cd4","observation_id":"68bfc725-2bb7-45bb-88e5-b3d824689d90","resolution":{"observed_at":"2026-08-03T15:02:52.408450Z","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-08-03T15:02:52.486470Z","title":"The importance of mixed selectivity in complex cognitive tasks,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.486470Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:5343cd812e27278d1bc30265b2935913d94e58317e08cc15e4f22cc85faa8bc5","observation_id":"9d2fad0c-ec09-44d9-adca-6869f058b10b","resolution":{"observed_at":"2026-08-03T15:02:52.486470Z","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-08-03T15:02:52.564775Z","title":"Linking connectivity, dynamics, and computations in low-rank recurrent neural networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.564775Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:97c602b179f238cb4b81238d64b8d4a2b5f13ad30c04e9d79d7e4dafa2f43239","observation_id":"6b1f2402-aec3-4ceb-9f3a-733f836ab67d","resolution":{"observed_at":"2026-08-03T15:02:52.564775Z","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-08-03T15:02:52.673678Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.673678Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:f6ac85695cb820ae58004c0490a180562087c3af44fca8fa46e8a0cd8533ca50","observation_id":"d681becc-2c42-4c62-a540-b101286498ab","resolution":{"observed_at":"2026-08-03T15:02:52.673678Z","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-08-03T15:02:52.834485Z","title":"Building machines that learn and think like people,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.834485Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:050f9e3da0f1930628734cbb0dde1a1d63b2efa1ec1a41ac55ebc8eb6a883365","observation_id":"c311f8c9-9abd-44fa-b4d5-671ddb2e6caa","resolution":{"observed_at":"2026-08-03T15:02:52.834485Z","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-08-03T15:02:52.946134Z","title":"How does the brain solve visual object recognition?","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:52.946134Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:cbf35f238ce8635091b3dc361eb67772f58f708de245f47cd191097517404df2","observation_id":"43bf53f5-fea6-41f5-8e7e-0c853ad95230","resolution":{"observed_at":"2026-08-03T15:02:52.946134Z","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-08-03T15:02:53.054471Z","title":"Predictive reward signal of dopamine neurons,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:53.054471Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:98ee1cc1e96832359a82a9e82e1fbe05d914e44cab44176e25bd53b09f626789","observation_id":"ccdbd48d-da8b-43cd-959d-839996904ee1","resolution":{"observed_at":"2026-08-03T15:02:53.054471Z","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-08-03T15:02:53.168467Z","title":"Prefrontal phase locking to hippocampal theta oscillations,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:53.168467Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:ef10a408eb127556eba9ff65a40f1ea7ae9b96d9bbc69c5a3a76a879da9e256e","observation_id":"9b5a5b4e-66a1-4ee8-829f-62a0dbaf4513","resolution":{"observed_at":"2026-08-03T15:02:53.168467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12712","last_updated":"2023-04-13T20:41:31Z","snapshot_observed_at":"2026-08-03T04:49:15.195814Z","submitted_at":"2023-03-22T16:51:28Z","title":"Sparks of Artificial General Intelligence: Early experiments with GPT-4","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.12712","snapshot_observed_at":"2026-08-03T15:02:53.301077Z","title":"Sparks of artificial general intelligence: Early experiments with gpt-4,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:53.301077Z"},"links":{"cited_paper":"/paper/2303.12712","citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:7e0e0f7d812abe014e91ef6cf02c34eb68d30c6c6d09755caaee52fc9cf39581","observation_id":"c05e28be-7775-4cf7-9ebe-279136ea2658","resolution":{"observed_at":"2026-08-03T15:02:53.301077Z","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-08-03T15:02:53.432158Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:53.432158Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:e2774c306ae690aee964a28f69cdc6a2e594c2929ff02721331336c8fd1fbb49","observation_id":"59798aff-ba17-46d0-a175-d149326a1a96","resolution":{"observed_at":"2026-08-03T15:02:53.432158Z","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-08-03T15:02:53.537887Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:53.537887Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:44d1d7f887e41a9cfef964c591d215b3a93fc3a088138dabc485c9e057129f92","observation_id":"c37b68f1-867b-4827-b039-3a07093fa1b2","resolution":{"observed_at":"2026-08-03T15:02:53.537887Z","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-08-03T15:02:53.641160Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-03T15:02:53.641160Z"},"links":{"citing_paper":"/paper/2512.18471"},"observation_digest":"sha256:161ffb3d141f214fd098b3b48e3a837fb899d5905d8922697b92a1df8e33e8a9","observation_id":"06bb7b55-df65-48aa-b420-66e95cbff7e0","resolution":{"observed_at":"2026-08-03T15:02:53.641160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.18471","last_updated":"2026-06-23T21:30:15Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T15:24:59.125196Z","submitted_at":"2025-12-20T19:10:38Z","title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning"},"reference_resolution":{"displayed":70,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":70,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":70},"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 9 August 2026, this Paper Citation Record lists 70 of 70 outbound references and 0 inbound Pith citation observations for arXiv:2512.18471."}