{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L6MMCNN6RQVZLJNOT6FOWM4O37","short_pith_number":"pith:L6MMCNN6","canonical_record":{"source":{"id":"1711.03822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-10T13:58:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f02741ba8c3d05955b9e3600cd045b78452d5a2abed11ef8952fd5973bd9f9b2","abstract_canon_sha256":"03fc0662d929da3ee14c1bab04d55ee8edf3d54a1a01effb7632a1cf92b90642"},"schema_version":"1.0"},"canonical_sha256":"5f98c135be8c2b95a5ae9f8aeb338edffc141920f22aee4e4d20760aa0ccc748","source":{"kind":"arxiv","id":"1711.03822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03822","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03822v1","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03822","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"pith_short_12","alias_value":"L6MMCNN6RQVZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L6MMCNN6RQVZLJNO","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L6MMCNN6","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L6MMCNN6RQVZLJNOT6FOWM4O37","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-10T13:58:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f02741ba8c3d05955b9e3600cd045b78452d5a2abed11ef8952fd5973bd9f9b2","abstract_canon_sha256":"03fc0662d929da3ee14c1bab04d55ee8edf3d54a1a01effb7632a1cf92b90642"},"schema_version":"1.0"},"canonical_sha256":"5f98c135be8c2b95a5ae9f8aeb338edffc141920f22aee4e4d20760aa0ccc748","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:51.373706Z","signature_b64":"N78NzLuq1/hML4taTq+ghKvseN1xIlbRss7X5+WZBND5SlCIXeA9XFJ7wAUb0H4+ePknRcWQkaUdL+EWlf0JDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f98c135be8c2b95a5ae9f8aeb338edffc141920f22aee4e4d20760aa0ccc748","last_reissued_at":"2026-05-18T00:30:51.373126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:51.373126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03822","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0XmzsIHNJITjPrIxhUfKyJFF1hgCyhVUPQF1VerWAMNIPdL/nMLiM1Kn6dzjhy2uOSvFGat347g8oJSjz2AAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:39:08.011909Z"},"content_sha256":"3448a6d0bdc2224394cc9c20f5c761df71f5db92a3595e920602746a9a235b9c","schema_version":"1.0","event_id":"sha256:3448a6d0bdc2224394cc9c20f5c761df71f5db92a3595e920602746a9a235b9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L6MMCNN6RQVZLJNOT6FOWM4O37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LSTM Networks for Data-Aware Remaining Time Prediction of Business Process Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Sperduti, Beatrice Vincenzi, Mirko Polato, Nicol\\`o Navarin","submitted_at":"2017-11-10T13:58:43Z","abstract_excerpt":"Predicting the completion time of business process instances would be a very helpful aid when managing processes under service level agreement constraints. The ability to know in advance the trend of running process instances would allow business managers to react in time, in order to prevent delays or undesirable situations. However, making such accurate forecasts is not easy: many factors may influence the required time to complete a process instance. In this paper, we propose an approach based on deep Recurrent Neural Networks (specifically LSTMs) that is able to exploit arbitrary informati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03822","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRtBna1gy6a69eGl6BJfuH0B5xn1V8NrLwMsqVrCWxnmVYnES8B8eoOTG0LZd4WnI0G7OyesRQK27d5b0DgJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:39:08.012253Z"},"content_sha256":"de01cd6ae446ff9d0d5d6d46773110908216f4b9f90fd1a68b97c26220f0348c","schema_version":"1.0","event_id":"sha256:de01cd6ae446ff9d0d5d6d46773110908216f4b9f90fd1a68b97c26220f0348c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6MMCNN6RQVZLJNOT6FOWM4O37/bundle.json","state_url":"https://pith.science/pith/L6MMCNN6RQVZLJNOT6FOWM4O37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6MMCNN6RQVZLJNOT6FOWM4O37/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T11:39:08Z","links":{"resolver":"https://pith.science/pith/L6MMCNN6RQVZLJNOT6FOWM4O37","bundle":"https://pith.science/pith/L6MMCNN6RQVZLJNOT6FOWM4O37/bundle.json","state":"https://pith.science/pith/L6MMCNN6RQVZLJNOT6FOWM4O37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6MMCNN6RQVZLJNOT6FOWM4O37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L6MMCNN6RQVZLJNOT6FOWM4O37","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"03fc0662d929da3ee14c1bab04d55ee8edf3d54a1a01effb7632a1cf92b90642","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-10T13:58:43Z","title_canon_sha256":"f02741ba8c3d05955b9e3600cd045b78452d5a2abed11ef8952fd5973bd9f9b2"},"schema_version":"1.0","source":{"id":"1711.03822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03822","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03822v1","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03822","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"pith_short_12","alias_value":"L6MMCNN6RQVZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L6MMCNN6RQVZLJNO","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L6MMCNN6","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:de01cd6ae446ff9d0d5d6d46773110908216f4b9f90fd1a68b97c26220f0348c","target":"graph","created_at":"2026-05-18T00:30:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Predicting the completion time of business process instances would be a very helpful aid when managing processes under service level agreement constraints. The ability to know in advance the trend of running process instances would allow business managers to react in time, in order to prevent delays or undesirable situations. However, making such accurate forecasts is not easy: many factors may influence the required time to complete a process instance. In this paper, we propose an approach based on deep Recurrent Neural Networks (specifically LSTMs) that is able to exploit arbitrary informati","authors_text":"Alessandro Sperduti, Beatrice Vincenzi, Mirko Polato, Nicol\\`o Navarin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-10T13:58:43Z","title":"LSTM Networks for Data-Aware Remaining Time Prediction of Business Process Instances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03822","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3448a6d0bdc2224394cc9c20f5c761df71f5db92a3595e920602746a9a235b9c","target":"record","created_at":"2026-05-18T00:30:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"03fc0662d929da3ee14c1bab04d55ee8edf3d54a1a01effb7632a1cf92b90642","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-10T13:58:43Z","title_canon_sha256":"f02741ba8c3d05955b9e3600cd045b78452d5a2abed11ef8952fd5973bd9f9b2"},"schema_version":"1.0","source":{"id":"1711.03822","kind":"arxiv","version":1}},"canonical_sha256":"5f98c135be8c2b95a5ae9f8aeb338edffc141920f22aee4e4d20760aa0ccc748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f98c135be8c2b95a5ae9f8aeb338edffc141920f22aee4e4d20760aa0ccc748","first_computed_at":"2026-05-18T00:30:51.373126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:51.373126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N78NzLuq1/hML4taTq+ghKvseN1xIlbRss7X5+WZBND5SlCIXeA9XFJ7wAUb0H4+ePknRcWQkaUdL+EWlf0JDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:51.373706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3448a6d0bdc2224394cc9c20f5c761df71f5db92a3595e920602746a9a235b9c","sha256:de01cd6ae446ff9d0d5d6d46773110908216f4b9f90fd1a68b97c26220f0348c"],"state_sha256":"1a17eeefc89dac919175d12244a47f30183deda91603b17fe209fb22bb7888ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9k1oleJxOBnL0NOiY/qJ544vZdQpoQ3SNcrOasIMJ2kvdQ6WNXUoqa82YkgEmVedu4FARyikA9RPuO97cpH8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:39:08.014296Z","bundle_sha256":"e424512e536987857d8a89ff30dbaf5cf0713692944fe1c024101329b6a512b8"}}