{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:O277S5OCO3J2VWOGIAYMANVQHS","short_pith_number":"pith:O277S5OC","schema_version":"1.0","canonical_sha256":"76bff975c276d3aad9c64030c036b03c8741155449f932f697ffd1aa5d997dd5","source":{"kind":"arxiv","id":"2206.13109","version":1},"attestation_state":"computed","paper":{"title":"Enhancing Stochastic Petri Net-based Remaining Time Prediction using k-Nearest Neighbors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gilles Vermaut, Jari Peeperkorn, Jarne Vandenabeele, Jochen De Weerdt","submitted_at":"2022-06-27T08:27:35Z","abstract_excerpt":"Reliable remaining time prediction of ongoing business processes is a highly relevant topic. One example is order delivery, a key competitive factor in e.g. retailing as it is a main driver of customer satisfaction. For realising timely delivery, an accurate prediction of the remaining time of the delivery process is crucial. Within the field of process mining, a wide variety of remaining time prediction techniques have already been proposed. In this work, we extend remaining time prediction based on stochastic Petri nets with generally distributed transitions with k-nearest neighbors. The k-n"},"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":"2206.13109","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-27T08:27:35Z","cross_cats_sorted":[],"title_canon_sha256":"f4343042ec78c7b2622cf2394274be2ad7a6da96130cf7071089ef0e784367d5","abstract_canon_sha256":"b2b898df974b58f2a2cf48bff98957791881f9904928cf5c9e2b1c1203d841c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:16:01.014657Z","signature_b64":"ywBvi7PnNqgJr6yNWAufq1ygHb/bFy+VDjoBRDFTTxC4oNiK8w9uimOlH2Dg9ZoVtyPTZidZmpTkziiPzhhXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76bff975c276d3aad9c64030c036b03c8741155449f932f697ffd1aa5d997dd5","last_reissued_at":"2026-07-05T05:16:01.014118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:16:01.014118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Stochastic Petri Net-based Remaining Time Prediction using k-Nearest Neighbors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gilles Vermaut, Jari Peeperkorn, Jarne Vandenabeele, Jochen De Weerdt","submitted_at":"2022-06-27T08:27:35Z","abstract_excerpt":"Reliable remaining time prediction of ongoing business processes is a highly relevant topic. One example is order delivery, a key competitive factor in e.g. retailing as it is a main driver of customer satisfaction. For realising timely delivery, an accurate prediction of the remaining time of the delivery process is crucial. Within the field of process mining, a wide variety of remaining time prediction techniques have already been proposed. In this work, we extend remaining time prediction based on stochastic Petri nets with generally distributed transitions with k-nearest neighbors. The k-n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.13109","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/2206.13109/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":"2206.13109","created_at":"2026-07-05T05:16:01.014181+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.13109v1","created_at":"2026-07-05T05:16:01.014181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.13109","created_at":"2026-07-05T05:16:01.014181+00:00"},{"alias_kind":"pith_short_12","alias_value":"O277S5OCO3J2","created_at":"2026-07-05T05:16:01.014181+00:00"},{"alias_kind":"pith_short_16","alias_value":"O277S5OCO3J2VWOG","created_at":"2026-07-05T05:16:01.014181+00:00"},{"alias_kind":"pith_short_8","alias_value":"O277S5OC","created_at":"2026-07-05T05:16:01.014181+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/O277S5OCO3J2VWOGIAYMANVQHS","json":"https://pith.science/pith/O277S5OCO3J2VWOGIAYMANVQHS.json","graph_json":"https://pith.science/api/pith-number/O277S5OCO3J2VWOGIAYMANVQHS/graph.json","events_json":"https://pith.science/api/pith-number/O277S5OCO3J2VWOGIAYMANVQHS/events.json","paper":"https://pith.science/paper/O277S5OC"},"agent_actions":{"view_html":"https://pith.science/pith/O277S5OCO3J2VWOGIAYMANVQHS","download_json":"https://pith.science/pith/O277S5OCO3J2VWOGIAYMANVQHS.json","view_paper":"https://pith.science/paper/O277S5OC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.13109&json=true","fetch_graph":"https://pith.science/api/pith-number/O277S5OCO3J2VWOGIAYMANVQHS/graph.json","fetch_events":"https://pith.science/api/pith-number/O277S5OCO3J2VWOGIAYMANVQHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O277S5OCO3J2VWOGIAYMANVQHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O277S5OCO3J2VWOGIAYMANVQHS/action/storage_attestation","attest_author":"https://pith.science/pith/O277S5OCO3J2VWOGIAYMANVQHS/action/author_attestation","sign_citation":"https://pith.science/pith/O277S5OCO3J2VWOGIAYMANVQHS/action/citation_signature","submit_replication":"https://pith.science/pith/O277S5OCO3J2VWOGIAYMANVQHS/action/replication_record"}},"created_at":"2026-07-05T05:16:01.014181+00:00","updated_at":"2026-07-05T05:16:01.014181+00:00"}