{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4AUJ5WVWLJIK65MMY67T6BW3XI","short_pith_number":"pith:4AUJ5WVW","canonical_record":{"source":{"id":"1306.0662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-06-04T06:18:37Z","cross_cats_sorted":["cs.FL","cs.LO","math.OC"],"title_canon_sha256":"cedda56996127b4cb944e65179a11fee45071440355280c2ab42bd94c0afe72b","abstract_canon_sha256":"80c222f451e2f0627f36b82f6354f77a005c68b1bd7da232e03d6b4b51c5e077"},"schema_version":"1.0"},"canonical_sha256":"e0289edab65a50af758cc7bf3f06dbba24c618d94d6a662e610dd05e63a03040","source":{"kind":"arxiv","id":"1306.0662","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0662","created_at":"2026-05-18T03:21:54Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0662v1","created_at":"2026-05-18T03:21:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0662","created_at":"2026-05-18T03:21:54Z"},{"alias_kind":"pith_short_12","alias_value":"4AUJ5WVWLJIK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4AUJ5WVWLJIK65MM","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4AUJ5WVW","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4AUJ5WVWLJIK65MMY67T6BW3XI","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-06-04T06:18:37Z","cross_cats_sorted":["cs.FL","cs.LO","math.OC"],"title_canon_sha256":"cedda56996127b4cb944e65179a11fee45071440355280c2ab42bd94c0afe72b","abstract_canon_sha256":"80c222f451e2f0627f36b82f6354f77a005c68b1bd7da232e03d6b4b51c5e077"},"schema_version":"1.0"},"canonical_sha256":"e0289edab65a50af758cc7bf3f06dbba24c618d94d6a662e610dd05e63a03040","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:54.427948Z","signature_b64":"Gk4nv6o2xAn+2PPAOJvum5XyZ0Jk50hHfdnSw3kCOTmYqZqfNn5+H/lMLqEOkTKmbvsrts7ynrDTFZ//JSOLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0289edab65a50af758cc7bf3f06dbba24c618d94d6a662e610dd05e63a03040","last_reissued_at":"2026-05-18T03:21:54.427185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:54.427185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0662","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-18T03:21:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Yuz7Dze8p3lHQeJoPi9vfITDQZ3bd/Dv9D3qLesvdAA8RG/pbJwpObV/TulanCuiKAufWvGn34s66t2olcQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:49:54.125740Z"},"content_sha256":"22c721a4ec83c721cbbd03ba2c4de0eb71ade18ccbfbad00c4629155460c6326","schema_version":"1.0","event_id":"sha256:22c721a4ec83c721cbbd03ba2c4de0eb71ade18ccbfbad00c4629155460c6326"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4AUJ5WVWLJIK65MMY67T6BW3XI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Predictability of Event Occurrences in Timed Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO","math.OC"],"primary_cat":"cs.SY","authors_text":"Alban Grastien, Franck Cassez","submitted_at":"2013-06-04T06:18:37Z","abstract_excerpt":"We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0662","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-18T03:21:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/I2HOgJR9Zqxs6zPBjBbvyk4TUQOZV5AG+MG2bRVmFMjlEs2rBauGdl9FPzCiOxoFfbToI6x+p+vt/OHg4cBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:49:54.126451Z"},"content_sha256":"8a0edbe33aa79da64618e7a9978050fccad59bf79482f3364ee195017f409349","schema_version":"1.0","event_id":"sha256:8a0edbe33aa79da64618e7a9978050fccad59bf79482f3364ee195017f409349"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4AUJ5WVWLJIK65MMY67T6BW3XI/bundle.json","state_url":"https://pith.science/pith/4AUJ5WVWLJIK65MMY67T6BW3XI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4AUJ5WVWLJIK65MMY67T6BW3XI/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-05T01:49:54Z","links":{"resolver":"https://pith.science/pith/4AUJ5WVWLJIK65MMY67T6BW3XI","bundle":"https://pith.science/pith/4AUJ5WVWLJIK65MMY67T6BW3XI/bundle.json","state":"https://pith.science/pith/4AUJ5WVWLJIK65MMY67T6BW3XI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4AUJ5WVWLJIK65MMY67T6BW3XI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4AUJ5WVWLJIK65MMY67T6BW3XI","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":"80c222f451e2f0627f36b82f6354f77a005c68b1bd7da232e03d6b4b51c5e077","cross_cats_sorted":["cs.FL","cs.LO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-06-04T06:18:37Z","title_canon_sha256":"cedda56996127b4cb944e65179a11fee45071440355280c2ab42bd94c0afe72b"},"schema_version":"1.0","source":{"id":"1306.0662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0662","created_at":"2026-05-18T03:21:54Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0662v1","created_at":"2026-05-18T03:21:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0662","created_at":"2026-05-18T03:21:54Z"},{"alias_kind":"pith_short_12","alias_value":"4AUJ5WVWLJIK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4AUJ5WVWLJIK65MM","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4AUJ5WVW","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:8a0edbe33aa79da64618e7a9978050fccad59bf79482f3364ee195017f409349","target":"graph","created_at":"2026-05-18T03:21:54Z","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":"We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check ","authors_text":"Alban Grastien, Franck Cassez","cross_cats":["cs.FL","cs.LO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-06-04T06:18:37Z","title":"Predictability of Event Occurrences in Timed Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0662","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:22c721a4ec83c721cbbd03ba2c4de0eb71ade18ccbfbad00c4629155460c6326","target":"record","created_at":"2026-05-18T03:21:54Z","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":"80c222f451e2f0627f36b82f6354f77a005c68b1bd7da232e03d6b4b51c5e077","cross_cats_sorted":["cs.FL","cs.LO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-06-04T06:18:37Z","title_canon_sha256":"cedda56996127b4cb944e65179a11fee45071440355280c2ab42bd94c0afe72b"},"schema_version":"1.0","source":{"id":"1306.0662","kind":"arxiv","version":1}},"canonical_sha256":"e0289edab65a50af758cc7bf3f06dbba24c618d94d6a662e610dd05e63a03040","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0289edab65a50af758cc7bf3f06dbba24c618d94d6a662e610dd05e63a03040","first_computed_at":"2026-05-18T03:21:54.427185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:54.427185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gk4nv6o2xAn+2PPAOJvum5XyZ0Jk50hHfdnSw3kCOTmYqZqfNn5+H/lMLqEOkTKmbvsrts7ynrDTFZ//JSOLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:54.427948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22c721a4ec83c721cbbd03ba2c4de0eb71ade18ccbfbad00c4629155460c6326","sha256:8a0edbe33aa79da64618e7a9978050fccad59bf79482f3364ee195017f409349"],"state_sha256":"2ceb3f529d72de134ffce72cbfd1fb5b8c30242befa89993c565e210fc352ce8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k7LxKKhQYcSm24WCxyStYhKoSTTrdcaauTr+CDk3bhzmGfTshoH92Ealv4VsFiRxD3/OD/YWNWN1rhGQxvEeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:49:54.130262Z","bundle_sha256":"63444f412c5d37a3d8a2ce35307a656a87dc6ec0160b77326436c6e1d36b0c7a"}}