{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TGI2K7DHHWDVWOOW5ENBYSHCZ4","short_pith_number":"pith:TGI2K7DH","schema_version":"1.0","canonical_sha256":"9991a57c673d875b39d6e91a1c48e2cf36290a8a40e02c259aea25fa3df6dbbe","source":{"kind":"arxiv","id":"2406.06419","version":3},"attestation_state":"computed","paper":{"title":"Foundation Inference Models for Markov Jump Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cesar Ojeda, David Berghaus, Kostadin Cvejoski, Patrick Seifner, Ramses J. Sanchez","submitted_at":"2024-06-10T16:12:00Z","abstract_excerpt":"Markov jump processes are continuous-time stochastic processes which describe dynamical systems evolving in discrete state spaces. These processes find wide application in the natural sciences and machine learning, but their inference is known to be far from trivial. In this work we introduce a methodology for zero-shot inference of Markov jump processes (MJPs), on bounded state spaces, from noisy and sparse observations, which consists of two components. First, a broad probability distribution over families of MJPs, as well as over possible observation times and noise mechanisms, with which w"},"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":"2406.06419","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-10T16:12:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a5bc45d2c86c6cb34894245097256da05c9fe6c002f332b45aca3973ebd7cfe4","abstract_canon_sha256":"975ce9faec9f8339d9caa1e28ad54d0f28b71c540e8325c4c815376be7bb07d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:54.040392Z","signature_b64":"rKy1quMxMq0/pRO7mQAc/TVlu8UzsLbIwLMTQabMu2kBxTeiRauHQMXLyF0WejMnwPWLOQjicHkYLWvJg55yDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9991a57c673d875b39d6e91a1c48e2cf36290a8a40e02c259aea25fa3df6dbbe","last_reissued_at":"2026-07-05T10:23:54.039867Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:54.039867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Foundation Inference Models for Markov Jump Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cesar Ojeda, David Berghaus, Kostadin Cvejoski, Patrick Seifner, Ramses J. Sanchez","submitted_at":"2024-06-10T16:12:00Z","abstract_excerpt":"Markov jump processes are continuous-time stochastic processes which describe dynamical systems evolving in discrete state spaces. These processes find wide application in the natural sciences and machine learning, but their inference is known to be far from trivial. In this work we introduce a methodology for zero-shot inference of Markov jump processes (MJPs), on bounded state spaces, from noisy and sparse observations, which consists of two components. First, a broad probability distribution over families of MJPs, as well as over possible observation times and noise mechanisms, with which w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.06419","kind":"arxiv","version":3},"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/2406.06419/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":"2406.06419","created_at":"2026-07-05T10:23:54.039932+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.06419v3","created_at":"2026-07-05T10:23:54.039932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.06419","created_at":"2026-07-05T10:23:54.039932+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGI2K7DHHWDV","created_at":"2026-07-05T10:23:54.039932+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGI2K7DHHWDVWOOW","created_at":"2026-07-05T10:23:54.039932+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGI2K7DH","created_at":"2026-07-05T10:23:54.039932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.12916","citing_title":"Efficient Inference for Coupled Hidden Markov Models in Continuous Time and Discrete Space","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TGI2K7DHHWDVWOOW5ENBYSHCZ4","json":"https://pith.science/pith/TGI2K7DHHWDVWOOW5ENBYSHCZ4.json","graph_json":"https://pith.science/api/pith-number/TGI2K7DHHWDVWOOW5ENBYSHCZ4/graph.json","events_json":"https://pith.science/api/pith-number/TGI2K7DHHWDVWOOW5ENBYSHCZ4/events.json","paper":"https://pith.science/paper/TGI2K7DH"},"agent_actions":{"view_html":"https://pith.science/pith/TGI2K7DHHWDVWOOW5ENBYSHCZ4","download_json":"https://pith.science/pith/TGI2K7DHHWDVWOOW5ENBYSHCZ4.json","view_paper":"https://pith.science/paper/TGI2K7DH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.06419&json=true","fetch_graph":"https://pith.science/api/pith-number/TGI2K7DHHWDVWOOW5ENBYSHCZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/TGI2K7DHHWDVWOOW5ENBYSHCZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGI2K7DHHWDVWOOW5ENBYSHCZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGI2K7DHHWDVWOOW5ENBYSHCZ4/action/storage_attestation","attest_author":"https://pith.science/pith/TGI2K7DHHWDVWOOW5ENBYSHCZ4/action/author_attestation","sign_citation":"https://pith.science/pith/TGI2K7DHHWDVWOOW5ENBYSHCZ4/action/citation_signature","submit_replication":"https://pith.science/pith/TGI2K7DHHWDVWOOW5ENBYSHCZ4/action/replication_record"}},"created_at":"2026-07-05T10:23:54.039932+00:00","updated_at":"2026-07-05T10:23:54.039932+00:00"}