{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KKJANBETODZWJOKWGGETCZE3PW","short_pith_number":"pith:KKJANBET","canonical_record":{"source":{"id":"1306.2695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-12T01:55:46Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c891733cc95ed99136ae56fbbcaaf726841eaba3a6996ffd00f865240d56871e","abstract_canon_sha256":"2a3bd70f9e58600f3f221d8d9d2c33f9a85e689b5607d7538a3053996e687224"},"schema_version":"1.0"},"canonical_sha256":"529206849370f364b956318931649b7d9ccf34bdbf1813c0be15f74b9706044e","source":{"kind":"arxiv","id":"1306.2695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2695","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2695v1","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2695","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"KKJANBETODZW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KKJANBETODZWJOKW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KKJANBET","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KKJANBETODZWJOKWGGETCZE3PW","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-12T01:55:46Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c891733cc95ed99136ae56fbbcaaf726841eaba3a6996ffd00f865240d56871e","abstract_canon_sha256":"2a3bd70f9e58600f3f221d8d9d2c33f9a85e689b5607d7538a3053996e687224"},"schema_version":"1.0"},"canonical_sha256":"529206849370f364b956318931649b7d9ccf34bdbf1813c0be15f74b9706044e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:09.701809Z","signature_b64":"ETx3xuCRogGU5/ftz1+R6U9vcAg9c6ocg7+yFDs8FTa71d1fnVgylnQKVBsPOBdlUJ0Mheyos268MnZf2CfYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"529206849370f364b956318931649b7d9ccf34bdbf1813c0be15f74b9706044e","last_reissued_at":"2026-05-18T03:21:09.701010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:09.701010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2695","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:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZznNbSb37mIIH7+ufJTS6P0hp6UEjKhvHoVBWDIUElPvAx8me0rWtNwJPtuY2n0HH3PcismhQAiiCLs9PeccAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:00:11.376410Z"},"content_sha256":"8f4e00db88f1bb186e1f159653ca12254cf3fb37655e1be04b64ad86757ee7bf","schema_version":"1.0","event_id":"sha256:8f4e00db88f1bb186e1f159653ca12254cf3fb37655e1be04b64ad86757ee7bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KKJANBETODZWJOKWGGETCZE3PW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modal Specifications for Probabilistic Timed Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Christian Krause, Holger Giese, Marta Kwiatkowska, Tingting Han","submitted_at":"2013-06-12T01:55:46Z","abstract_excerpt":"Modal automata are a classic formal model for component-based systems that comes equipped with a rich specification theory supporting abstraction, refinement and compositional reasoning. In recent years, quantitative variants of modal automata were introduced for specifying and reasoning about component-based designs for embedded and mobile systems. These respectively generalize modal specification theories for timed and probabilistic systems. In this paper, we define a modal specification language for combined probabilistic timed systems, called abstract probabilistic timed automata, which ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2695","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:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1G2Ur11t2CIiltYtWiz92XdbFs3ikiq3mPt8WcAO0zrmQ7nwoydYP9v2zUc6Zhgmu+dLpVfJ/v1jJyaNVjwDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:00:11.376762Z"},"content_sha256":"fb2c0d423585a6d6e537887f947f1462312b05bd59c981746924ba635f1b9539","schema_version":"1.0","event_id":"sha256:fb2c0d423585a6d6e537887f947f1462312b05bd59c981746924ba635f1b9539"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKJANBETODZWJOKWGGETCZE3PW/bundle.json","state_url":"https://pith.science/pith/KKJANBETODZWJOKWGGETCZE3PW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKJANBETODZWJOKWGGETCZE3PW/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-02T20:00:11Z","links":{"resolver":"https://pith.science/pith/KKJANBETODZWJOKWGGETCZE3PW","bundle":"https://pith.science/pith/KKJANBETODZWJOKWGGETCZE3PW/bundle.json","state":"https://pith.science/pith/KKJANBETODZWJOKWGGETCZE3PW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKJANBETODZWJOKWGGETCZE3PW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KKJANBETODZWJOKWGGETCZE3PW","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":"2a3bd70f9e58600f3f221d8d9d2c33f9a85e689b5607d7538a3053996e687224","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-12T01:55:46Z","title_canon_sha256":"c891733cc95ed99136ae56fbbcaaf726841eaba3a6996ffd00f865240d56871e"},"schema_version":"1.0","source":{"id":"1306.2695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2695","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2695v1","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2695","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"KKJANBETODZW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KKJANBETODZWJOKW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KKJANBET","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:fb2c0d423585a6d6e537887f947f1462312b05bd59c981746924ba635f1b9539","target":"graph","created_at":"2026-05-18T03:21:09Z","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":"Modal automata are a classic formal model for component-based systems that comes equipped with a rich specification theory supporting abstraction, refinement and compositional reasoning. In recent years, quantitative variants of modal automata were introduced for specifying and reasoning about component-based designs for embedded and mobile systems. These respectively generalize modal specification theories for timed and probabilistic systems. In this paper, we define a modal specification language for combined probabilistic timed systems, called abstract probabilistic timed automata, which ge","authors_text":"Christian Krause, Holger Giese, Marta Kwiatkowska, Tingting Han","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-12T01:55:46Z","title":"Modal Specifications for Probabilistic Timed Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2695","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:8f4e00db88f1bb186e1f159653ca12254cf3fb37655e1be04b64ad86757ee7bf","target":"record","created_at":"2026-05-18T03:21:09Z","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":"2a3bd70f9e58600f3f221d8d9d2c33f9a85e689b5607d7538a3053996e687224","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-12T01:55:46Z","title_canon_sha256":"c891733cc95ed99136ae56fbbcaaf726841eaba3a6996ffd00f865240d56871e"},"schema_version":"1.0","source":{"id":"1306.2695","kind":"arxiv","version":1}},"canonical_sha256":"529206849370f364b956318931649b7d9ccf34bdbf1813c0be15f74b9706044e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"529206849370f364b956318931649b7d9ccf34bdbf1813c0be15f74b9706044e","first_computed_at":"2026-05-18T03:21:09.701010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:09.701010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ETx3xuCRogGU5/ftz1+R6U9vcAg9c6ocg7+yFDs8FTa71d1fnVgylnQKVBsPOBdlUJ0Mheyos268MnZf2CfYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:09.701809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f4e00db88f1bb186e1f159653ca12254cf3fb37655e1be04b64ad86757ee7bf","sha256:fb2c0d423585a6d6e537887f947f1462312b05bd59c981746924ba635f1b9539"],"state_sha256":"d8aaa0b32691bef714475b09d1d6d819ad426da98fa33a589e5315dc5b6d381e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPxKClUkv1CPv+/xYVw7pHkt3ah04uJkCEMNNYjd5pX3qd55XVbJbDzNuHEKDd/CxOQJY0vvLew5O8/zi0ceDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:00:11.378733Z","bundle_sha256":"9731aa90d7538eb4dc73125e5b01ee5f51c26df055858809979b472c954884d4"}}