{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WJ5U7Z4QHVJQWTAHRMM5RBNLM5","short_pith_number":"pith:WJ5U7Z4Q","schema_version":"1.0","canonical_sha256":"b27b4fe7903d530b4c078b19d885ab674100543ea965e5f8902de0382d5479ed","source":{"kind":"arxiv","id":"2411.02098","version":1},"attestation_state":"computed","paper":{"title":"Low-Rank Tensors for Multi-Dimensional Markov Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","stat.ML"],"primary_cat":"eess.SY","authors_text":"Antonio G. Marques, Madeline Navarro, Santiago Segarra, Sergio Rozada","submitted_at":"2024-11-04T14:06:49Z","abstract_excerpt":"This work presents a low-rank tensor model for multi-dimensional Markov chains. A common approach to simplify the dynamical behavior of a Markov chain is to impose low-rankness on the transition probability matrix. Inspired by the success of these matrix techniques, we present low-rank tensors for representing transition probabilities on multi-dimensional state spaces. Through tensor decomposition, we provide a connection between our method and classical probabilistic models. Moreover, our proposed model yields a parsimonious representation with fewer parameters than matrix-based approaches. U"},"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":"2411.02098","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-11-04T14:06:49Z","cross_cats_sorted":["cs.SY","stat.ML"],"title_canon_sha256":"654acd5a24ac27016bd5fe642b169d8e8dedfab42bacbe13c648ece8c32f1ddf","abstract_canon_sha256":"56bcbf1f0c72b58df2469f55bd8476e2da3e42a3ebe4dda96f184e9706ff6d77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:41.866311Z","signature_b64":"kIa7e2qtyBNwRMqi/ctpMer0Y044sl8xpqen/ZwrI3elhDQZOx+Lq2cfxbMxd3I3r6HLJfAix88IjvJSvUsGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b27b4fe7903d530b4c078b19d885ab674100543ea965e5f8902de0382d5479ed","last_reissued_at":"2026-07-05T09:30:41.865801Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:41.865801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Rank Tensors for Multi-Dimensional Markov Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","stat.ML"],"primary_cat":"eess.SY","authors_text":"Antonio G. Marques, Madeline Navarro, Santiago Segarra, Sergio Rozada","submitted_at":"2024-11-04T14:06:49Z","abstract_excerpt":"This work presents a low-rank tensor model for multi-dimensional Markov chains. A common approach to simplify the dynamical behavior of a Markov chain is to impose low-rankness on the transition probability matrix. Inspired by the success of these matrix techniques, we present low-rank tensors for representing transition probabilities on multi-dimensional state spaces. Through tensor decomposition, we provide a connection between our method and classical probabilistic models. Moreover, our proposed model yields a parsimonious representation with fewer parameters than matrix-based approaches. U"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02098","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.02098/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":"2411.02098","created_at":"2026-07-05T09:30:41.865860+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02098v1","created_at":"2026-07-05T09:30:41.865860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02098","created_at":"2026-07-05T09:30:41.865860+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJ5U7Z4QHVJQ","created_at":"2026-07-05T09:30:41.865860+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJ5U7Z4QHVJQWTAH","created_at":"2026-07-05T09:30:41.865860+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJ5U7Z4Q","created_at":"2026-07-05T09:30:41.865860+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.10598","citing_title":"Addressing Finite-Horizon MDPs via Low-Rank Tensor Value Approximation","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WJ5U7Z4QHVJQWTAHRMM5RBNLM5","json":"https://pith.science/pith/WJ5U7Z4QHVJQWTAHRMM5RBNLM5.json","graph_json":"https://pith.science/api/pith-number/WJ5U7Z4QHVJQWTAHRMM5RBNLM5/graph.json","events_json":"https://pith.science/api/pith-number/WJ5U7Z4QHVJQWTAHRMM5RBNLM5/events.json","paper":"https://pith.science/paper/WJ5U7Z4Q"},"agent_actions":{"view_html":"https://pith.science/pith/WJ5U7Z4QHVJQWTAHRMM5RBNLM5","download_json":"https://pith.science/pith/WJ5U7Z4QHVJQWTAHRMM5RBNLM5.json","view_paper":"https://pith.science/paper/WJ5U7Z4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02098&json=true","fetch_graph":"https://pith.science/api/pith-number/WJ5U7Z4QHVJQWTAHRMM5RBNLM5/graph.json","fetch_events":"https://pith.science/api/pith-number/WJ5U7Z4QHVJQWTAHRMM5RBNLM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJ5U7Z4QHVJQWTAHRMM5RBNLM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJ5U7Z4QHVJQWTAHRMM5RBNLM5/action/storage_attestation","attest_author":"https://pith.science/pith/WJ5U7Z4QHVJQWTAHRMM5RBNLM5/action/author_attestation","sign_citation":"https://pith.science/pith/WJ5U7Z4QHVJQWTAHRMM5RBNLM5/action/citation_signature","submit_replication":"https://pith.science/pith/WJ5U7Z4QHVJQWTAHRMM5RBNLM5/action/replication_record"}},"created_at":"2026-07-05T09:30:41.865860+00:00","updated_at":"2026-07-05T09:30:41.865860+00:00"}