{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PPDP6ZUY5A6TLLHMZA3GLAJT5Y","short_pith_number":"pith:PPDP6ZUY","schema_version":"1.0","canonical_sha256":"7bc6ff6698e83d35acecc836658133ee31451b063a8d58caab66c22f86cbb267","source":{"kind":"arxiv","id":"1904.00442","version":1},"attestation_state":"computed","paper":{"title":"SpaMHMM: Sparse Mixture of Hidden Markov Models for Graph Connected Entities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Diogo Pernes, Jaime S. Cardoso","submitted_at":"2019-03-31T16:18:56Z","abstract_excerpt":"We propose a framework to model the distribution of sequential data coming from a set of entities connected in a graph with a known topology. The method is based on a mixture of shared hidden Markov models (HMMs), which are jointly trained in order to exploit the knowledge of the graph structure and in such a way that the obtained mixtures tend to be sparse. Experiments in different application domains demonstrate the effectiveness and versatility of the method."},"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":"1904.00442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-31T16:18:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"316e30436b297ec0a532b421679161fc09a3cb5188ae094440da237d42f14373","abstract_canon_sha256":"25ec2aa24fede912fde08475887cf259cd8cac4d4962c4a74bb4ebf8816e9526"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:48.387144Z","signature_b64":"Wxe3iiuEiBXG/3XrH0CdO4dJdmm8btT44bYamyIQQYLbFGLIM61BFzJf/fdJXhRfwzKzfS6tXk2qUcMS+m9mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bc6ff6698e83d35acecc836658133ee31451b063a8d58caab66c22f86cbb267","last_reissued_at":"2026-05-17T23:49:48.386474Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:48.386474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SpaMHMM: Sparse Mixture of Hidden Markov Models for Graph Connected Entities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Diogo Pernes, Jaime S. Cardoso","submitted_at":"2019-03-31T16:18:56Z","abstract_excerpt":"We propose a framework to model the distribution of sequential data coming from a set of entities connected in a graph with a known topology. The method is based on a mixture of shared hidden Markov models (HMMs), which are jointly trained in order to exploit the knowledge of the graph structure and in such a way that the obtained mixtures tend to be sparse. Experiments in different application domains demonstrate the effectiveness and versatility of the method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00442","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.00442","created_at":"2026-05-17T23:49:48.386584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.00442v1","created_at":"2026-05-17T23:49:48.386584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00442","created_at":"2026-05-17T23:49:48.386584+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPDP6ZUY5A6T","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPDP6ZUY5A6TLLHM","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPDP6ZUY","created_at":"2026-05-18T12:33:24.271573+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/PPDP6ZUY5A6TLLHMZA3GLAJT5Y","json":"https://pith.science/pith/PPDP6ZUY5A6TLLHMZA3GLAJT5Y.json","graph_json":"https://pith.science/api/pith-number/PPDP6ZUY5A6TLLHMZA3GLAJT5Y/graph.json","events_json":"https://pith.science/api/pith-number/PPDP6ZUY5A6TLLHMZA3GLAJT5Y/events.json","paper":"https://pith.science/paper/PPDP6ZUY"},"agent_actions":{"view_html":"https://pith.science/pith/PPDP6ZUY5A6TLLHMZA3GLAJT5Y","download_json":"https://pith.science/pith/PPDP6ZUY5A6TLLHMZA3GLAJT5Y.json","view_paper":"https://pith.science/paper/PPDP6ZUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.00442&json=true","fetch_graph":"https://pith.science/api/pith-number/PPDP6ZUY5A6TLLHMZA3GLAJT5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/PPDP6ZUY5A6TLLHMZA3GLAJT5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPDP6ZUY5A6TLLHMZA3GLAJT5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPDP6ZUY5A6TLLHMZA3GLAJT5Y/action/storage_attestation","attest_author":"https://pith.science/pith/PPDP6ZUY5A6TLLHMZA3GLAJT5Y/action/author_attestation","sign_citation":"https://pith.science/pith/PPDP6ZUY5A6TLLHMZA3GLAJT5Y/action/citation_signature","submit_replication":"https://pith.science/pith/PPDP6ZUY5A6TLLHMZA3GLAJT5Y/action/replication_record"}},"created_at":"2026-05-17T23:49:48.386584+00:00","updated_at":"2026-05-17T23:49:48.386584+00:00"}