{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FEUDN7XH7VQBGPML5CUPLZGBRV","short_pith_number":"pith:FEUDN7XH","canonical_record":{"source":{"id":"1901.03024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-01-10T05:59:52Z","cross_cats_sorted":[],"title_canon_sha256":"0839f7e05d1e4ae9b546b3c582a3a2963bc318ba423822ef26d274ec7d31e5e9","abstract_canon_sha256":"9bf5fb8ac7101bc49873c0610d8529176475c2c7e71c533c71cb671075238739"},"schema_version":"1.0"},"canonical_sha256":"292836fee7fd60133d8be8a8f5e4c18d5571e7c5530f6bac9950ab5b23cbcff5","source":{"kind":"arxiv","id":"1901.03024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03024","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03024v1","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03024","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"FEUDN7XH7VQB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEUDN7XH7VQBGPML","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEUDN7XH","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FEUDN7XH7VQBGPML5CUPLZGBRV","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-01-10T05:59:52Z","cross_cats_sorted":[],"title_canon_sha256":"0839f7e05d1e4ae9b546b3c582a3a2963bc318ba423822ef26d274ec7d31e5e9","abstract_canon_sha256":"9bf5fb8ac7101bc49873c0610d8529176475c2c7e71c533c71cb671075238739"},"schema_version":"1.0"},"canonical_sha256":"292836fee7fd60133d8be8a8f5e4c18d5571e7c5530f6bac9950ab5b23cbcff5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:35.780841Z","signature_b64":"PZ6qAiHlWYeEl6hSY02IM1iRSg4xKpBDWZ47OvnBjWKrsU3GcvrhPImZhbckYgjzAgpf/tlG19Aiu4Wp+LMzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"292836fee7fd60133d8be8a8f5e4c18d5571e7c5530f6bac9950ab5b23cbcff5","last_reissued_at":"2026-05-17T23:56:35.780252Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:35.780252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03024","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-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ruyrPWkSLAD9HjfRuVncVCx8rUi4OGRn/S1XB6FlQxUnvCKl+bWo8MRcnDjgnb9WIEDL6wHt33DkrRcLhM1mCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T16:59:47.361879Z"},"content_sha256":"522de6fcc8d131f7d07b76e3a41b61a80e84c60d4c6dc85336e1cf910ec9dbc3","schema_version":"1.0","event_id":"sha256:522de6fcc8d131f7d07b76e3a41b61a80e84c60d4c6dc85336e1cf910ec9dbc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FEUDN7XH7VQBGPML5CUPLZGBRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Computation of Koopman Operator from Sparse Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Enoch Yeung, Subhrajit Sinha","submitted_at":"2019-01-10T05:59:52Z","abstract_excerpt":"In this paper we propose a novel approach to compute the Koopman operator from sparse time series data. In recent years there has been considerable interests in operator theoretic methods for data-driven analysis of dynamical systems. Existing techniques for the approximation of the Koopman operator require sufficiently large data sets, but in many applications, the data set may not be large enough to approximate the operators to acceptable limits. In this paper, using ideas from robust optimization, we propose an algorithm to compute the Koopman operator from sparse data. We enrich the sparse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03024","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIfa1S0dPYiClPaWBbyXRoNzL/mIE7ke1tbKGO6/8GsRzja9zkJK/g9NdCnBtN/PXlLrrfUjf42gSinYKVYTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T16:59:47.362222Z"},"content_sha256":"797f3e62156183558c991d4f3adba30dc157497f3ce0f965880e705b4634f113","schema_version":"1.0","event_id":"sha256:797f3e62156183558c991d4f3adba30dc157497f3ce0f965880e705b4634f113"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEUDN7XH7VQBGPML5CUPLZGBRV/bundle.json","state_url":"https://pith.science/pith/FEUDN7XH7VQBGPML5CUPLZGBRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEUDN7XH7VQBGPML5CUPLZGBRV/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-07-01T16:59:47Z","links":{"resolver":"https://pith.science/pith/FEUDN7XH7VQBGPML5CUPLZGBRV","bundle":"https://pith.science/pith/FEUDN7XH7VQBGPML5CUPLZGBRV/bundle.json","state":"https://pith.science/pith/FEUDN7XH7VQBGPML5CUPLZGBRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEUDN7XH7VQBGPML5CUPLZGBRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FEUDN7XH7VQBGPML5CUPLZGBRV","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":"9bf5fb8ac7101bc49873c0610d8529176475c2c7e71c533c71cb671075238739","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-01-10T05:59:52Z","title_canon_sha256":"0839f7e05d1e4ae9b546b3c582a3a2963bc318ba423822ef26d274ec7d31e5e9"},"schema_version":"1.0","source":{"id":"1901.03024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03024","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03024v1","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03024","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"FEUDN7XH7VQB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEUDN7XH7VQBGPML","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEUDN7XH","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:797f3e62156183558c991d4f3adba30dc157497f3ce0f965880e705b4634f113","target":"graph","created_at":"2026-05-17T23:56:35Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we propose a novel approach to compute the Koopman operator from sparse time series data. In recent years there has been considerable interests in operator theoretic methods for data-driven analysis of dynamical systems. Existing techniques for the approximation of the Koopman operator require sufficiently large data sets, but in many applications, the data set may not be large enough to approximate the operators to acceptable limits. In this paper, using ideas from robust optimization, we propose an algorithm to compute the Koopman operator from sparse data. We enrich the sparse","authors_text":"Enoch Yeung, Subhrajit Sinha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-01-10T05:59:52Z","title":"On Computation of Koopman Operator from Sparse Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03024","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:522de6fcc8d131f7d07b76e3a41b61a80e84c60d4c6dc85336e1cf910ec9dbc3","target":"record","created_at":"2026-05-17T23:56:35Z","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":"9bf5fb8ac7101bc49873c0610d8529176475c2c7e71c533c71cb671075238739","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-01-10T05:59:52Z","title_canon_sha256":"0839f7e05d1e4ae9b546b3c582a3a2963bc318ba423822ef26d274ec7d31e5e9"},"schema_version":"1.0","source":{"id":"1901.03024","kind":"arxiv","version":1}},"canonical_sha256":"292836fee7fd60133d8be8a8f5e4c18d5571e7c5530f6bac9950ab5b23cbcff5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"292836fee7fd60133d8be8a8f5e4c18d5571e7c5530f6bac9950ab5b23cbcff5","first_computed_at":"2026-05-17T23:56:35.780252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:35.780252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PZ6qAiHlWYeEl6hSY02IM1iRSg4xKpBDWZ47OvnBjWKrsU3GcvrhPImZhbckYgjzAgpf/tlG19Aiu4Wp+LMzAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:35.780841Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:522de6fcc8d131f7d07b76e3a41b61a80e84c60d4c6dc85336e1cf910ec9dbc3","sha256:797f3e62156183558c991d4f3adba30dc157497f3ce0f965880e705b4634f113"],"state_sha256":"be6f53c35a8fffcb60ba2dfaa0ae4bf0c4d1fe34c086bdfd7529e56d6e528ddd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMZp41SPUsLKfEPI+rde5dzehFGxG9vMZ7ffsd7X3qG62bvgUM5crZuPFCGusHs80dMdAlc7ISQ4E2a5XPykBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T16:59:47.364454Z","bundle_sha256":"92b454ecfc6ea533520d28bd72a84c0fbc3f912345df9cc6d3dff7b2daab6c48"}}