{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RZKDMBD6QPMQDBVE6VV2DNRWVO","short_pith_number":"pith:RZKDMBD6","schema_version":"1.0","canonical_sha256":"8e5436047e83d90186a4f56ba1b636ab9b72f3f7308810de6056df58999dcdf9","source":{"kind":"arxiv","id":"2412.16032","version":1},"attestation_state":"computed","paper":{"title":"A Framework for Streaming Event-Log Prediction in Business Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Benedikt Bollig, Matthias F\\\"ugger, Thomas Nowak","submitted_at":"2024-12-20T16:29:14Z","abstract_excerpt":"We present a Python-based framework for event-log prediction in streaming mode, enabling predictions while data is being generated by a business process. The framework allows for easy integration of streaming algorithms, including language models like n-grams and LSTMs, and for combining these predictors using ensemble methods.\n  Using our framework, we conducted experiments on various well-known process-mining data sets and compared classical batch with streaming mode. Though, in batch mode, LSTMs generally achieve the best performance, there is often an n-gram whose accuracy comes very close"},"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":"2412.16032","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-12-20T16:29:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9650ae7d58f3e62b9c73eee65513aa833dd28cd2031b3c61f5837dc2a32d65e5","abstract_canon_sha256":"8f04009097a87fb777952c94e816b9253f2dcf11a8f97443b464bea3143500c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:33.644813Z","signature_b64":"ZzPG0KZ1Rr7Jy6bebD5STLoU7JQMMFVBZS+CEp01kYwrPnmm8MlrvlnxebEhgXEzGNn+JCeOKqVIhJv30M4qBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e5436047e83d90186a4f56ba1b636ab9b72f3f7308810de6056df58999dcdf9","last_reissued_at":"2026-07-05T09:52:33.644346Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:33.644346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for Streaming Event-Log Prediction in Business Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Benedikt Bollig, Matthias F\\\"ugger, Thomas Nowak","submitted_at":"2024-12-20T16:29:14Z","abstract_excerpt":"We present a Python-based framework for event-log prediction in streaming mode, enabling predictions while data is being generated by a business process. The framework allows for easy integration of streaming algorithms, including language models like n-grams and LSTMs, and for combining these predictors using ensemble methods.\n  Using our framework, we conducted experiments on various well-known process-mining data sets and compared classical batch with streaming mode. Though, in batch mode, LSTMs generally achieve the best performance, there is often an n-gram whose accuracy comes very close"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16032","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/2412.16032/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":"2412.16032","created_at":"2026-07-05T09:52:33.644409+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.16032v1","created_at":"2026-07-05T09:52:33.644409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16032","created_at":"2026-07-05T09:52:33.644409+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZKDMBD6QPMQ","created_at":"2026-07-05T09:52:33.644409+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZKDMBD6QPMQDBVE","created_at":"2026-07-05T09:52:33.644409+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZKDMBD6","created_at":"2026-07-05T09:52:33.644409+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06333","citing_title":"Extending AALpy with Passive Learning: A Generalized State-Merging Approach","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RZKDMBD6QPMQDBVE6VV2DNRWVO","json":"https://pith.science/pith/RZKDMBD6QPMQDBVE6VV2DNRWVO.json","graph_json":"https://pith.science/api/pith-number/RZKDMBD6QPMQDBVE6VV2DNRWVO/graph.json","events_json":"https://pith.science/api/pith-number/RZKDMBD6QPMQDBVE6VV2DNRWVO/events.json","paper":"https://pith.science/paper/RZKDMBD6"},"agent_actions":{"view_html":"https://pith.science/pith/RZKDMBD6QPMQDBVE6VV2DNRWVO","download_json":"https://pith.science/pith/RZKDMBD6QPMQDBVE6VV2DNRWVO.json","view_paper":"https://pith.science/paper/RZKDMBD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.16032&json=true","fetch_graph":"https://pith.science/api/pith-number/RZKDMBD6QPMQDBVE6VV2DNRWVO/graph.json","fetch_events":"https://pith.science/api/pith-number/RZKDMBD6QPMQDBVE6VV2DNRWVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZKDMBD6QPMQDBVE6VV2DNRWVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZKDMBD6QPMQDBVE6VV2DNRWVO/action/storage_attestation","attest_author":"https://pith.science/pith/RZKDMBD6QPMQDBVE6VV2DNRWVO/action/author_attestation","sign_citation":"https://pith.science/pith/RZKDMBD6QPMQDBVE6VV2DNRWVO/action/citation_signature","submit_replication":"https://pith.science/pith/RZKDMBD6QPMQDBVE6VV2DNRWVO/action/replication_record"}},"created_at":"2026-07-05T09:52:33.644409+00:00","updated_at":"2026-07-05T09:52:33.644409+00:00"}