{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UQPZBDI4AB4WJBDNPRDT5ET4KL","short_pith_number":"pith:UQPZBDI4","schema_version":"1.0","canonical_sha256":"a41f908d1c007964846d7c473e927c52fd792b169f4bc4378d5b2d1119433286","source":{"kind":"arxiv","id":"2512.18471","version":2},"attestation_state":"computed","paper":{"title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["q-bio.NC"],"primary_cat":"cs.LG","authors_text":"Xin Li","submitted_at":"2025-12-20T19:10:38Z","abstract_excerpt":"Continual learning systems face a fundamental geometric obstacle: as experience accumulates on a fixed-capacity manifold, covering numbers grow linearly with time, eventually forcing representational overlap and catastrophic interference. Prevailing approaches attack this problem by \\emph{expansion} - projecting into higher-dimensional spaces via kernels, overparameterization, or replay. We argue the solution is the opposite: \\emph{contraction}. We formalize abstraction as the \\textbf{Urysohn Ladder}, a hierarchy of quotient maps that recursively collapse validated metric neighborhoods into co"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2512.18471","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-12-20T19:10:38Z","cross_cats_sorted":["q-bio.NC"],"title_canon_sha256":"fa811c74ea1319683c5f300e4856ce405d987571161f4a1771bfbb7f8793db4d","abstract_canon_sha256":"14acbe5f8ebc6398e3aeeafc08ea4c7ef2affc8c04a808cf4d9104c5db9add2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:18:12.075083Z","signature_b64":"mVBwS8nUOUtaKfYp/rwf1/DkRMWbKDqSPHxKU4BtuPhyew8ohK80AV1M2y6yKVdz+0QmblY3dJ8kJ0QPgQpFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a41f908d1c007964846d7c473e927c52fd792b169f4bc4378d5b2d1119433286","last_reissued_at":"2026-06-25T00:18:12.074579Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:18:12.074579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Urysohn Ladder: Recursive Metric Contraction for Scalable Continual Learning","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["q-bio.NC"],"primary_cat":"cs.LG","authors_text":"Xin Li","submitted_at":"2025-12-20T19:10:38Z","abstract_excerpt":"Continual learning systems face a fundamental geometric obstacle: as experience accumulates on a fixed-capacity manifold, covering numbers grow linearly with time, eventually forcing representational overlap and catastrophic interference. Prevailing approaches attack this problem by \\emph{expansion} - projecting into higher-dimensional spaces via kernels, overparameterization, or replay. We argue the solution is the opposite: \\emph{contraction}. We formalize abstraction as the \\textbf{Urysohn Ladder}, a hierarchy of quotient maps that recursively collapse validated metric neighborhoods into co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.18471","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.18471/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2512.18471","created_at":"2026-06-25T00:18:12.074639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.18471v2","created_at":"2026-06-25T00:18:12.074639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.18471","created_at":"2026-06-25T00:18:12.074639+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQPZBDI4AB4W","created_at":"2026-06-25T00:18:12.074639+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQPZBDI4AB4WJBDN","created_at":"2026-06-25T00:18:12.074639+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQPZBDI4","created_at":"2026-06-25T00:18:12.074639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQPZBDI4AB4WJBDNPRDT5ET4KL","json":"https://pith.science/pith/UQPZBDI4AB4WJBDNPRDT5ET4KL.json","graph_json":"https://pith.science/api/pith-number/UQPZBDI4AB4WJBDNPRDT5ET4KL/graph.json","events_json":"https://pith.science/api/pith-number/UQPZBDI4AB4WJBDNPRDT5ET4KL/events.json","paper":"https://pith.science/paper/UQPZBDI4"},"agent_actions":{"view_html":"https://pith.science/pith/UQPZBDI4AB4WJBDNPRDT5ET4KL","download_json":"https://pith.science/pith/UQPZBDI4AB4WJBDNPRDT5ET4KL.json","view_paper":"https://pith.science/paper/UQPZBDI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.18471&json=true","fetch_graph":"https://pith.science/api/pith-number/UQPZBDI4AB4WJBDNPRDT5ET4KL/graph.json","fetch_events":"https://pith.science/api/pith-number/UQPZBDI4AB4WJBDNPRDT5ET4KL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQPZBDI4AB4WJBDNPRDT5ET4KL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQPZBDI4AB4WJBDNPRDT5ET4KL/action/storage_attestation","attest_author":"https://pith.science/pith/UQPZBDI4AB4WJBDNPRDT5ET4KL/action/author_attestation","sign_citation":"https://pith.science/pith/UQPZBDI4AB4WJBDNPRDT5ET4KL/action/citation_signature","submit_replication":"https://pith.science/pith/UQPZBDI4AB4WJBDNPRDT5ET4KL/action/replication_record"}},"created_at":"2026-06-25T00:18:12.074639+00:00","updated_at":"2026-06-25T00:18:12.074639+00:00"}