{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N5U7RGDMQZLRCCEEQ5AHSI5F2E","short_pith_number":"pith:N5U7RGDM","schema_version":"1.0","canonical_sha256":"6f69f8986c865711088487407923a5d13fd57159a57ebe85c38907e87b16d1e6","source":{"kind":"arxiv","id":"1807.04415","version":1},"attestation_state":"computed","paper":{"title":"Process Discovery using Classification Tree Hidden Semi-Markov Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Vladimir Zadorozhny, Yihuang Kang","submitted_at":"2018-07-12T04:08:44Z","abstract_excerpt":"Various and ubiquitous information systems are being used in monitoring, exchanging, and collecting information. These systems are generating massive amount of event sequence logs that may help us understand underlying phenomenon. By analyzing these logs, we can learn process models that describe system procedures, predict the development of the system, or check whether the changes are expected. In this paper, we consider a novel technique that models these sequences of events in temporal-probabilistic manners. Specifically, we propose a probabilistic process model that combines hidden semi-Ma"},"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":"1807.04415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-07-12T04:08:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"83cd7e2275d20a717102b4d3e566e8702c54191d0e5466d55f85e8a240a8ae83","abstract_canon_sha256":"cbca98720291f73f7cbf43a8d007d1b44ad3fabf65e2a77bd12e2299a9b87f39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:53.584127Z","signature_b64":"pZts3kTJWYObwzDcxS81glK/jSh9pQBF4hS84GFYtUIIj61YDCybaa8Lk5ShRedNwN6XVgY2dEB6QTsJAkrSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f69f8986c865711088487407923a5d13fd57159a57ebe85c38907e87b16d1e6","last_reissued_at":"2026-05-18T00:10:53.583231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:53.583231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Process Discovery using Classification Tree Hidden Semi-Markov Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Vladimir Zadorozhny, Yihuang Kang","submitted_at":"2018-07-12T04:08:44Z","abstract_excerpt":"Various and ubiquitous information systems are being used in monitoring, exchanging, and collecting information. These systems are generating massive amount of event sequence logs that may help us understand underlying phenomenon. By analyzing these logs, we can learn process models that describe system procedures, predict the development of the system, or check whether the changes are expected. In this paper, we consider a novel technique that models these sequences of events in temporal-probabilistic manners. Specifically, we propose a probabilistic process model that combines hidden semi-Ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04415","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":"1807.04415","created_at":"2026-05-18T00:10:53.583382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04415v1","created_at":"2026-05-18T00:10:53.583382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04415","created_at":"2026-05-18T00:10:53.583382+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5U7RGDMQZLR","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5U7RGDMQZLRCCEE","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5U7RGDM","created_at":"2026-05-18T12:32:40.477152+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/N5U7RGDMQZLRCCEEQ5AHSI5F2E","json":"https://pith.science/pith/N5U7RGDMQZLRCCEEQ5AHSI5F2E.json","graph_json":"https://pith.science/api/pith-number/N5U7RGDMQZLRCCEEQ5AHSI5F2E/graph.json","events_json":"https://pith.science/api/pith-number/N5U7RGDMQZLRCCEEQ5AHSI5F2E/events.json","paper":"https://pith.science/paper/N5U7RGDM"},"agent_actions":{"view_html":"https://pith.science/pith/N5U7RGDMQZLRCCEEQ5AHSI5F2E","download_json":"https://pith.science/pith/N5U7RGDMQZLRCCEEQ5AHSI5F2E.json","view_paper":"https://pith.science/paper/N5U7RGDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04415&json=true","fetch_graph":"https://pith.science/api/pith-number/N5U7RGDMQZLRCCEEQ5AHSI5F2E/graph.json","fetch_events":"https://pith.science/api/pith-number/N5U7RGDMQZLRCCEEQ5AHSI5F2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5U7RGDMQZLRCCEEQ5AHSI5F2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5U7RGDMQZLRCCEEQ5AHSI5F2E/action/storage_attestation","attest_author":"https://pith.science/pith/N5U7RGDMQZLRCCEEQ5AHSI5F2E/action/author_attestation","sign_citation":"https://pith.science/pith/N5U7RGDMQZLRCCEEQ5AHSI5F2E/action/citation_signature","submit_replication":"https://pith.science/pith/N5U7RGDMQZLRCCEEQ5AHSI5F2E/action/replication_record"}},"created_at":"2026-05-18T00:10:53.583382+00:00","updated_at":"2026-05-18T00:10:53.583382+00:00"}