{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KQPSVYRICKYVTEMTOREI7QOUBV","short_pith_number":"pith:KQPSVYRI","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"},"canonical_sha256":"541f2ae22812b159919374488fc1d40d59d80228d1561c09036763c8601e47e8","source":{"kind":"arxiv","id":"2605.13135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13135","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13135v1","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13135","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"KQPSVYRICKYV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KQPSVYRICKYVTEMT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KQPSVYRI","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KQPSVYRICKYVTEMTOREI7QOUBV","target":"record","payload":{"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"},"canonical_sha256":"541f2ae22812b159919374488fc1d40d59d80228d1561c09036763c8601e47e8","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"},"source_kind":"arxiv","source_id":"2605.13135","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xsD1aTFw6n86YwKkIXJ7fKe5Nquz3c117Hjm+/LE2Je3vpQ/lcB0ldY35N2fAiJiraeiKcakzQ+sEakTt7vtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:57:38.172146Z"},"content_sha256":"3ac168a1f5c73b3b857b389217fbf583454ab64b072c92be0ce4a7c0a473381d","schema_version":"1.0","event_id":"sha256:3ac168a1f5c73b3b857b389217fbf583454ab64b072c92be0ce4a7c0a473381d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KQPSVYRICKYVTEMTOREI7QOUBV","target":"graph","payload":{"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"},"verdict_id":"b7090252-19bc-4972-bfe8-d1895ea025c3"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ixzv7PzwXaIdpneP1p9y7Y4SJD8nYFYvVq8phzPAIB2CIMxEJiNuMnKjGv5HzkoK+daH83633eqjhzFHpgnlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:57:38.173174Z"},"content_sha256":"e9d9d6dba8942c9e61053cee380982d87aede582550e425e4ffb1329c7743139","schema_version":"1.0","event_id":"sha256:e9d9d6dba8942c9e61053cee380982d87aede582550e425e4ffb1329c7743139"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV/bundle.json","state_url":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQPSVYRICKYVTEMTOREI7QOUBV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T06:57:38Z","links":{"resolver":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV","bundle":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV/bundle.json","state":"https://pith.science/pith/KQPSVYRICKYVTEMTOREI7QOUBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQPSVYRICKYVTEMTOREI7QOUBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KQPSVYRICKYVTEMTOREI7QOUBV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f56663f0735ea4992d17ac3b9b93369378cd1698da5b0bf77a5dfdb3bbb2caa4","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-13T08:04:38Z","title_canon_sha256":"8a411ea5a9d6daa8ed39621a4d125d2b68ae5d78072fc876712f867bac2b7eb7"},"schema_version":"1.0","source":{"id":"2605.13135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13135","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13135v1","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13135","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"KQPSVYRICKYV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KQPSVYRICKYVTEMT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KQPSVYRI","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e9d9d6dba8942c9e61053cee380982d87aede582550e425e4ffb1329c7743139","target":"graph","created_at":"2026-05-18T03:08:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A hybrid principal-vector pruning framework refines Koopman subspace invariance with error bounds and rank-one update efficiency for lifted linear prediction."}],"snapshot_sha256":"f8770d56de386337c2899322b120ef4bce64ba71a7fb5ccb7e1fda40c4b1e086"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d0080ea76305fcad04d7f969d5ff0be8776983fe28495ff294ad2ee0dec9e3c4"},"paper":{"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 ","authors_text":"Dhruv Shah, Jorge Cort\\'es","cross_cats":["cs.SY"],"headline":"A hybrid principal-vector pruning framework refines Koopman subspace invariance with error bounds and rank-one update efficiency for lifted linear prediction.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-13T08:04:38Z","title":"Subspace Pruning via Principal Vectors for Accurate Koopman-Based Approximations"},"references":{"count":50,"internal_anchors":1,"resolved_work":50,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"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","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"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","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"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","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"We employ these eigenfunctions as the ground truth for evaluating the accuracy of the pruning algorithms","work_id":"42294a03-60f6-4382-86e9-df03707b35b2","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"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","year":null}],"snapshot_sha256":"25b46c0bb9775c2c856a75dff6cb45e9190a38882688ed61651029e1a16d439b"},"source":{"id":"2605.13135","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:52:06.109846Z","id":"b7090252-19bc-4972-bfe8-d1895ea025c3","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"","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.","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."}},"verdict_id":"b7090252-19bc-4972-bfe8-d1895ea025c3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3ac168a1f5c73b3b857b389217fbf583454ab64b072c92be0ce4a7c0a473381d","target":"record","created_at":"2026-05-18T03:08:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f56663f0735ea4992d17ac3b9b93369378cd1698da5b0bf77a5dfdb3bbb2caa4","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-13T08:04:38Z","title_canon_sha256":"8a411ea5a9d6daa8ed39621a4d125d2b68ae5d78072fc876712f867bac2b7eb7"},"schema_version":"1.0","source":{"id":"2605.13135","kind":"arxiv","version":1}},"canonical_sha256":"541f2ae22812b159919374488fc1d40d59d80228d1561c09036763c8601e47e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"541f2ae22812b159919374488fc1d40d59d80228d1561c09036763c8601e47e8","first_computed_at":"2026-05-18T03:08:57.602853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:57.602853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+htuHwxf1Y8okSKfOKeWcU3QnvGQqj9LwsVy1tAtDh9bzAlhI3EZBsjQK0v7ug5hueRywkGloLBcnbEjqx0kAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:57.603713Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ac168a1f5c73b3b857b389217fbf583454ab64b072c92be0ce4a7c0a473381d","sha256:e9d9d6dba8942c9e61053cee380982d87aede582550e425e4ffb1329c7743139"],"state_sha256":"d137aaba1c66d067108ff74d871ea99e2999e3a47d33fe6a651932af2f43dca1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4R+4PK6MDlpiqSW8dv0nRFhaSSbTY6NfrBPEjmt9//My6rppDihEU2hZ4Xys+vqfXacmyjXw0/yPcNnkA0ijAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T06:57:38.177263Z","bundle_sha256":"dfbb7493695c9ddbf679a817b43fa0c874e7503bf57376ec48b6a7e2b874e930"}}