{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KQPSVYRICKYVTEMTOREI7QOUBV","short_pith_number":"pith:KQPSVYRI","schema_version":"1.0","canonical_sha256":"541f2ae22812b159919374488fc1d40d59d80228d1561c09036763c8601e47e8","source":{"kind":"arxiv","id":"2605.13135","version":1},"attestation_state":"computed","paper":{"title":"Subspace Pruning via Principal Vectors for Accurate Koopman-Based Approximations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A hybrid principal-vector pruning framework refines Koopman subspace invariance with error bounds and rank-one update efficiency for lifted linear prediction.","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Dhruv Shah, Jorge Cort\\'es","submitted_at":"2026-05-13T08:04:38Z","abstract_excerpt":"The accuracy of Koopman operator approximations over\n  finite-dimensional spaces relies critically on their invariance\n  properties. These can be rigorously quantified via the principal\n  angles between a candidate subspace and its image under the Koopman\n  operator. This paper proposes a unified algebraic framework for\n  subspace pruning designed to systematically refine the invariance\n  error. We establish the geometric equivalence between\n  consistency-based methods and principal-vector pruning, and build on\n  this insight to introduce a hybrid strategy that balances between\n  multiple and "},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.13135","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-13T08:04:38Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"8a411ea5a9d6daa8ed39621a4d125d2b68ae5d78072fc876712f867bac2b7eb7","abstract_canon_sha256":"f56663f0735ea4992d17ac3b9b93369378cd1698da5b0bf77a5dfdb3bbb2caa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:57.603713Z","signature_b64":"+htuHwxf1Y8okSKfOKeWcU3QnvGQqj9LwsVy1tAtDh9bzAlhI3EZBsjQK0v7ug5hueRywkGloLBcnbEjqx0kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"541f2ae22812b159919374488fc1d40d59d80228d1561c09036763c8601e47e8","last_reissued_at":"2026-05-18T03:08:57.602853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:57.602853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace Pruning via Principal Vectors for Accurate Koopman-Based Approximations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A hybrid principal-vector pruning framework refines Koopman subspace invariance with error bounds and rank-one update efficiency for lifted linear prediction.","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Dhruv Shah, Jorge Cort\\'es","submitted_at":"2026-05-13T08:04:38Z","abstract_excerpt":"The accuracy of Koopman operator approximations over\n  finite-dimensional spaces relies critically on their invariance\n  properties. These can be rigorously quantified via the principal\n  angles between a candidate subspace and its image under the Koopman\n  operator. This paper proposes a unified algebraic framework for\n  subspace pruning designed to systematically refine the invariance\n  error. We establish the geometric equivalence between\n  consistency-based methods and principal-vector pruning, and build on\n  this insight to introduce a hybrid strategy that balances between\n  multiple and "},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"We establish the geometric equivalence between consistency-based methods and principal-vector pruning, and build on this insight to introduce a hybrid strategy that balances between multiple and single principal vector pruning for improved numerical stability and scalability.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the principal angles between a candidate subspace and its image under the Koopman operator provide a sufficient and refinable measure of invariance error that can be systematically reduced by pruning without losing essential dynamical information.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A hybrid principal-vector pruning framework refines Koopman subspace invariance with error bounds and rank-one update efficiency for lifted linear prediction.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"f8770d56de386337c2899322b120ef4bce64ba71a7fb5ccb7e1fda40c4b1e086"},"source":{"id":"2605.13135","kind":"arxiv","version":1},"verdict":{"id":"b7090252-19bc-4972-bfe8-d1895ea025c3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:52:06.109846Z","strongest_claim":"We establish the geometric equivalence between consistency-based methods and principal-vector pruning, and build on this insight to introduce a hybrid strategy that balances between multiple and single principal vector pruning for improved numerical stability and scalability.","one_line_summary":"A hybrid principal-vector pruning framework refines Koopman subspace invariance with error bounds and rank-one update efficiency for lifted linear prediction.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the principal angles between a candidate subspace and its image under the Koopman operator provide a sufficient and refinable measure of invariance error that can be systematically reduced by pruning without losing essential dynamical information.","pith_extraction_headline":""},"references":{"count":50,"sample":[{"doi":"","year":null,"title":"We construct a transformation matrixT∈R s×(s−k) by padding Ewith zeros to align with the originals-dimensional space: T= E 0k×(s−k) .(25)","work_id":"f385af87-08a1-473d-bc87-5108b21a864c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"We then perform a QR decomposition ofCas C=Q CRC,(26) whereQ C ∈R s×(s−k) is orthogonal andR new =R C ∈ R(s−k)×(s−k) is the new upper triangular factor","work_id":"88c34ff8-fa4f-478a-a493-2f540a2741c2","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The matricesW new andR new are a valid QR decomposition ofKU new, i.e., KU new =W newRC","work_id":"9cdd8e5f-c1df-4a95-8e95-36f8b8f2e78c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"We employ these eigenfunctions as the ground truth for evaluating the accuracy of the pruning algorithms","work_id":"42294a03-60f6-4382-86e9-df03707b35b2","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Note that kernel EDMD performs the orthogonal projection using the kernel inner product, which is different from the standard L2(µX)inner product used in our other examples","work_id":"71ebac14-bb5a-4883-bd80-4d88c923743c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":50,"snapshot_sha256":"25b46c0bb9775c2c856a75dff6cb45e9190a38882688ed61651029e1a16d439b","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d0080ea76305fcad04d7f969d5ff0be8776983fe28495ff294ad2ee0dec9e3c4"},"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":"2605.13135","created_at":"2026-05-18T03:08:57.602993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13135v1","created_at":"2026-05-18T03:08:57.602993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13135","created_at":"2026-05-18T03:08:57.602993+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQPSVYRICKYV","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQPSVYRICKYVTEMT","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQPSVYRI","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV","json":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV.json","graph_json":"https://pith.science/api/pith-number/KQPSVYRICKYVTEMTOREI7QOUBV/graph.json","events_json":"https://pith.science/api/pith-number/KQPSVYRICKYVTEMTOREI7QOUBV/events.json","paper":"https://pith.science/paper/KQPSVYRI"},"agent_actions":{"view_html":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV","download_json":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV.json","view_paper":"https://pith.science/paper/KQPSVYRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13135&json=true","fetch_graph":"https://pith.science/api/pith-number/KQPSVYRICKYVTEMTOREI7QOUBV/graph.json","fetch_events":"https://pith.science/api/pith-number/KQPSVYRICKYVTEMTOREI7QOUBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV/action/storage_attestation","attest_author":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV/action/author_attestation","sign_citation":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV/action/citation_signature","submit_replication":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV/action/replication_record"}},"created_at":"2026-05-18T03:08:57.602993+00:00","updated_at":"2026-05-18T03:08:57.602993+00:00"}