{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6ARKLMELPGQES4ZCOEIBQMXH3X","short_pith_number":"pith:6ARKLMEL","schema_version":"1.0","canonical_sha256":"f022a5b08b79a049732271101832e7ddd24bfbed41ad4b9d8acbf2320021da69","source":{"kind":"arxiv","id":"2006.05138","version":2},"attestation_state":"computed","paper":{"title":"Sparse Dynamic Distribution Decomposition: Efficient Integration of Trajectory and Snapshot Time Series Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Catalina Cangea, Charlie Roberts, Cristian Regep, Flawnson Tong, Jake P. Taylor-King, Jyothish Soman","submitted_at":"2020-06-09T09:28:52Z","abstract_excerpt":"Dynamic Distribution Decomposition (DDD) was introduced in Taylor-King et. al. (PLOS Comp Biol, 2020) as a variation on Dynamic Mode Decomposition. In brief, by using basis functions over a continuous state space, DDD allows for the fitting of continuous-time Markov chains over these basis functions and as a result continuously maps between distributions. The number of parameters in DDD scales by the square of the number of basis functions; we reformulate the problem and restrict the method to compact basis functions which leads to the inference of sparse matrices only -- hence reducing the nu"},"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":"2006.05138","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2020-06-09T09:28:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8288d83f61b7d78ee8a0787fd5bc9779c4c79ffc56f2f9a470b137a4b5d60342","abstract_canon_sha256":"d8d114de8a4eddd15cc3f90c471f8e04ef1dc6a5220df889c27b1e9a65c33459"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:31.154201Z","signature_b64":"JkwMMqUFbNlLnbJYYDjobuc7TqlvsxE/VbAiYopH7LuWXoVmtGz7OX+A01HaiL1RbC7vQ+Z84gfPMMgnxtzrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f022a5b08b79a049732271101832e7ddd24bfbed41ad4b9d8acbf2320021da69","last_reissued_at":"2026-07-05T01:09:31.153709Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:31.153709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Dynamic Distribution Decomposition: Efficient Integration of Trajectory and Snapshot Time Series Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Catalina Cangea, Charlie Roberts, Cristian Regep, Flawnson Tong, Jake P. Taylor-King, Jyothish Soman","submitted_at":"2020-06-09T09:28:52Z","abstract_excerpt":"Dynamic Distribution Decomposition (DDD) was introduced in Taylor-King et. al. (PLOS Comp Biol, 2020) as a variation on Dynamic Mode Decomposition. In brief, by using basis functions over a continuous state space, DDD allows for the fitting of continuous-time Markov chains over these basis functions and as a result continuously maps between distributions. The number of parameters in DDD scales by the square of the number of basis functions; we reformulate the problem and restrict the method to compact basis functions which leads to the inference of sparse matrices only -- hence reducing the nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05138","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/2006.05138/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":"2006.05138","created_at":"2026-07-05T01:09:31.153767+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.05138v2","created_at":"2026-07-05T01:09:31.153767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05138","created_at":"2026-07-05T01:09:31.153767+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ARKLMELPGQE","created_at":"2026-07-05T01:09:31.153767+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ARKLMELPGQES4ZC","created_at":"2026-07-05T01:09:31.153767+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ARKLMEL","created_at":"2026-07-05T01:09:31.153767+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6ARKLMELPGQES4ZCOEIBQMXH3X","json":"https://pith.science/pith/6ARKLMELPGQES4ZCOEIBQMXH3X.json","graph_json":"https://pith.science/api/pith-number/6ARKLMELPGQES4ZCOEIBQMXH3X/graph.json","events_json":"https://pith.science/api/pith-number/6ARKLMELPGQES4ZCOEIBQMXH3X/events.json","paper":"https://pith.science/paper/6ARKLMEL"},"agent_actions":{"view_html":"https://pith.science/pith/6ARKLMELPGQES4ZCOEIBQMXH3X","download_json":"https://pith.science/pith/6ARKLMELPGQES4ZCOEIBQMXH3X.json","view_paper":"https://pith.science/paper/6ARKLMEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.05138&json=true","fetch_graph":"https://pith.science/api/pith-number/6ARKLMELPGQES4ZCOEIBQMXH3X/graph.json","fetch_events":"https://pith.science/api/pith-number/6ARKLMELPGQES4ZCOEIBQMXH3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ARKLMELPGQES4ZCOEIBQMXH3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ARKLMELPGQES4ZCOEIBQMXH3X/action/storage_attestation","attest_author":"https://pith.science/pith/6ARKLMELPGQES4ZCOEIBQMXH3X/action/author_attestation","sign_citation":"https://pith.science/pith/6ARKLMELPGQES4ZCOEIBQMXH3X/action/citation_signature","submit_replication":"https://pith.science/pith/6ARKLMELPGQES4ZCOEIBQMXH3X/action/replication_record"}},"created_at":"2026-07-05T01:09:31.153767+00:00","updated_at":"2026-07-05T01:09:31.153767+00:00"}