{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MPPK7R7H5VT35XD2FNDNWQTKWN","short_pith_number":"pith:MPPK7R7H","canonical_record":{"source":{"id":"2308.10864","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"nlin.CD","submitted_at":"2023-08-21T17:08:37Z","cross_cats_sorted":[],"title_canon_sha256":"946eb6cbade9622c0f6ea30b827c8f250c24e9c7f4e8c4980cedf90ab56af788","abstract_canon_sha256":"abbe1b2ddeef87640cb55cd8bb4639bdcbb2b86ea3f5ba83a2b7d4dd2fe85a03"},"schema_version":"1.0"},"canonical_sha256":"63deafc7e7ed67bedc7a2b46db426ab3664e75ac217e6d7e52095adf6b116a66","source":{"kind":"arxiv","id":"2308.10864","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.10864","created_at":"2026-07-05T08:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"2308.10864v2","created_at":"2026-07-05T08:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10864","created_at":"2026-07-05T08:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"MPPK7R7H5VT3","created_at":"2026-07-05T08:17:59Z"},{"alias_kind":"pith_short_16","alias_value":"MPPK7R7H5VT35XD2","created_at":"2026-07-05T08:17:59Z"},{"alias_kind":"pith_short_8","alias_value":"MPPK7R7H","created_at":"2026-07-05T08:17:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MPPK7R7H5VT35XD2FNDNWQTKWN","target":"record","payload":{"canonical_record":{"source":{"id":"2308.10864","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"nlin.CD","submitted_at":"2023-08-21T17:08:37Z","cross_cats_sorted":[],"title_canon_sha256":"946eb6cbade9622c0f6ea30b827c8f250c24e9c7f4e8c4980cedf90ab56af788","abstract_canon_sha256":"abbe1b2ddeef87640cb55cd8bb4639bdcbb2b86ea3f5ba83a2b7d4dd2fe85a03"},"schema_version":"1.0"},"canonical_sha256":"63deafc7e7ed67bedc7a2b46db426ab3664e75ac217e6d7e52095adf6b116a66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:17:59.012386Z","signature_b64":"L24SKv2aGWLYC6Ux0jCLghJ/wF30SHf19UkUtqMqW69N2Fpui2e0eZzTpx13J5Wm6/PPjsVkaspH1BoeUpu4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63deafc7e7ed67bedc7a2b46db426ab3664e75ac217e6d7e52095adf6b116a66","last_reissued_at":"2026-07-05T08:17:59.011931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:17:59.011931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.10864","source_version":2,"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-07-05T08:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2UhFYaWwMzTDaviH20RPAT0aCxY9G4AoePnxLztcELDArFGZk4FKsFIMqySsgGDrvjzflTQA7UQGm0sG55CMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:37:47.441388Z"},"content_sha256":"d788b9f33fd49caed037b97bc1481f655540f47ca8be44c1bf10895c55dedc69","schema_version":"1.0","event_id":"sha256:d788b9f33fd49caed037b97bc1481f655540f47ca8be44c1bf10895c55dedc69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MPPK7R7H5VT35XD2FNDNWQTKWN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduced Markovian Models of Dynamical Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CD","authors_text":"Andre N. Souza, Ludovico Theo Giorgini, Peter J. Schmid","submitted_at":"2023-08-21T17:08:37Z","abstract_excerpt":"Leveraging recent work on data-driven methods for constructing a finite state space Markov process from dynamical systems, we address two problems for obtaining further reduced statistical representations. The first problem is to extract the most salient reduced-order dynamics for a given timescale by using a modified clustering algorithm from network theory. The second problem is to provide an alternative construction for the infinitesimal generator of a Markov process that respects statistical features over a large range of timescales. We demonstrate the methodology on three low-dimensional "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10864","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/2308.10864/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"},"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-07-05T08:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//NRXP4inAO3Y3UIgYxj/5Xd43yQaOkfeixsaOPeLnzCx12zw+9SHr02gL1o5eGLE8EWPAURY6xGOTP971KwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:37:47.442000Z"},"content_sha256":"a7f99d90349b5a21c1e28e39d1aba7d850d004d019c9a9f5131ee1d6aae2752e","schema_version":"1.0","event_id":"sha256:a7f99d90349b5a21c1e28e39d1aba7d850d004d019c9a9f5131ee1d6aae2752e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPPK7R7H5VT35XD2FNDNWQTKWN/bundle.json","state_url":"https://pith.science/pith/MPPK7R7H5VT35XD2FNDNWQTKWN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPPK7R7H5VT35XD2FNDNWQTKWN/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-08-09T22:37:47Z","links":{"resolver":"https://pith.science/pith/MPPK7R7H5VT35XD2FNDNWQTKWN","bundle":"https://pith.science/pith/MPPK7R7H5VT35XD2FNDNWQTKWN/bundle.json","state":"https://pith.science/pith/MPPK7R7H5VT35XD2FNDNWQTKWN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPPK7R7H5VT35XD2FNDNWQTKWN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MPPK7R7H5VT35XD2FNDNWQTKWN","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":"abbe1b2ddeef87640cb55cd8bb4639bdcbb2b86ea3f5ba83a2b7d4dd2fe85a03","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"nlin.CD","submitted_at":"2023-08-21T17:08:37Z","title_canon_sha256":"946eb6cbade9622c0f6ea30b827c8f250c24e9c7f4e8c4980cedf90ab56af788"},"schema_version":"1.0","source":{"id":"2308.10864","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.10864","created_at":"2026-07-05T08:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"2308.10864v2","created_at":"2026-07-05T08:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10864","created_at":"2026-07-05T08:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"MPPK7R7H5VT3","created_at":"2026-07-05T08:17:59Z"},{"alias_kind":"pith_short_16","alias_value":"MPPK7R7H5VT35XD2","created_at":"2026-07-05T08:17:59Z"},{"alias_kind":"pith_short_8","alias_value":"MPPK7R7H","created_at":"2026-07-05T08:17:59Z"}],"graph_snapshots":[{"event_id":"sha256:a7f99d90349b5a21c1e28e39d1aba7d850d004d019c9a9f5131ee1d6aae2752e","target":"graph","created_at":"2026-07-05T08:17:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.10864/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Leveraging recent work on data-driven methods for constructing a finite state space Markov process from dynamical systems, we address two problems for obtaining further reduced statistical representations. The first problem is to extract the most salient reduced-order dynamics for a given timescale by using a modified clustering algorithm from network theory. The second problem is to provide an alternative construction for the infinitesimal generator of a Markov process that respects statistical features over a large range of timescales. We demonstrate the methodology on three low-dimensional ","authors_text":"Andre N. Souza, Ludovico Theo Giorgini, Peter J. Schmid","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"nlin.CD","submitted_at":"2023-08-21T17:08:37Z","title":"Reduced Markovian Models of Dynamical Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10864","kind":"arxiv","version":2},"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:d788b9f33fd49caed037b97bc1481f655540f47ca8be44c1bf10895c55dedc69","target":"record","created_at":"2026-07-05T08:17:59Z","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":"abbe1b2ddeef87640cb55cd8bb4639bdcbb2b86ea3f5ba83a2b7d4dd2fe85a03","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"nlin.CD","submitted_at":"2023-08-21T17:08:37Z","title_canon_sha256":"946eb6cbade9622c0f6ea30b827c8f250c24e9c7f4e8c4980cedf90ab56af788"},"schema_version":"1.0","source":{"id":"2308.10864","kind":"arxiv","version":2}},"canonical_sha256":"63deafc7e7ed67bedc7a2b46db426ab3664e75ac217e6d7e52095adf6b116a66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63deafc7e7ed67bedc7a2b46db426ab3664e75ac217e6d7e52095adf6b116a66","first_computed_at":"2026-07-05T08:17:59.011931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:17:59.011931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L24SKv2aGWLYC6Ux0jCLghJ/wF30SHf19UkUtqMqW69N2Fpui2e0eZzTpx13J5Wm6/PPjsVkaspH1BoeUpu4DA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:17:59.012386Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.10864","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d788b9f33fd49caed037b97bc1481f655540f47ca8be44c1bf10895c55dedc69","sha256:a7f99d90349b5a21c1e28e39d1aba7d850d004d019c9a9f5131ee1d6aae2752e"],"state_sha256":"ac468fae76ec0f35631cde7653b8c5b776a94d43e92cad1a957b591655572567"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmUedIULkmUzWwtgLF+UKP/tsS2f55mYOtY7CgHRnRhZgE5o4/F4cz9rJdkTOvekTbMNquRPl+wu7UK3i0NzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T22:37:47.445600Z","bundle_sha256":"85b421f109f9d4e3dd2df4e7d1fe7d51c1bced7a4e23b633e8938c6e161647a2"}}