{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3FRERIMGV4Y32CEXMO5YAI37KL","short_pith_number":"pith:3FRERIMG","canonical_record":{"source":{"id":"1907.01721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-03T03:26:33Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c67e3f22ab980540efdb6b0410248d43c188c86d95fc85dbe094a36f15ecc687","abstract_canon_sha256":"9ebeef60563c960a85aa74edb5b67d2361039faca8f3f2193f39a81105ecbaa6"},"schema_version":"1.0"},"canonical_sha256":"d96248a186af31bd089763bb80237f52f79a4af68980860ea58c2668d6aaea0b","source":{"kind":"arxiv","id":"1907.01721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01721","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01721v1","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01721","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"3FRERIMGV4Y3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3FRERIMGV4Y32CEX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3FRERIMG","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3FRERIMGV4Y32CEXMO5YAI37KL","target":"record","payload":{"canonical_record":{"source":{"id":"1907.01721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-03T03:26:33Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c67e3f22ab980540efdb6b0410248d43c188c86d95fc85dbe094a36f15ecc687","abstract_canon_sha256":"9ebeef60563c960a85aa74edb5b67d2361039faca8f3f2193f39a81105ecbaa6"},"schema_version":"1.0"},"canonical_sha256":"d96248a186af31bd089763bb80237f52f79a4af68980860ea58c2668d6aaea0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:35.322776Z","signature_b64":"88N2QbG+np7qzeb0zGTzLgGrCPB7x+aTl9BhbbMAgiyvxqHP43xjPiCqBFeqYsOPzJRBg+FrltVLmesQf6IqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d96248a186af31bd089763bb80237f52f79a4af68980860ea58c2668d6aaea0b","last_reissued_at":"2026-05-17T23:41:35.322116Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:35.322116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.01721","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-17T23:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/yHHfzYS+KwnlPwwkDKx8mNn3Tw7PYIQHSR3GV0P6LZN83y3pkhYbh0SsBRkoYkhwM+4gCM1TK/vqsNE9d+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:48:24.206331Z"},"content_sha256":"1bc75c6237e5c762411aee5cc4e3938a3cf0b829fd94049bdb79269859345312","schema_version":"1.0","event_id":"sha256:1bc75c6237e5c762411aee5cc4e3938a3cf0b829fd94049bdb79269859345312"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3FRERIMGV4Y32CEXMO5YAI37KL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"What's decidable about parametric timed automata?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"\\'Etienne Andr\\'e","submitted_at":"2019-07-03T03:26:33Z","abstract_excerpt":"Parametric timed automata (PTAs) are a powerful formalism to reason, simulate and formally verify critical real-time systems. After 25 years of research on PTAs, it is now well-understood that any non-trivial problem studied is undecidable for general PTAs. We provide here a survey of decision and computation problems for PTAs. On the one hand, bounding time, bounding the number of parameters or the domain of the parameters does not (in general) lead to any decidability. On the other hand, restricting the number of clocks, the use of clocks (compared or not with the parameters), and the use of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01721","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-17T23:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBXa5AYlAgRkENY0CI9FqTssSHMznphuGH6Riko6jWSXHnvW7Qm7yEyjqtyc/eIT7cOP9HGpAzt+Rh3oese9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:48:24.207024Z"},"content_sha256":"bb9e145e253b5707cbe664081d47c8a190bb083e31f20cfaf5954315950a556d","schema_version":"1.0","event_id":"sha256:bb9e145e253b5707cbe664081d47c8a190bb083e31f20cfaf5954315950a556d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FRERIMGV4Y32CEXMO5YAI37KL/bundle.json","state_url":"https://pith.science/pith/3FRERIMGV4Y32CEXMO5YAI37KL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FRERIMGV4Y32CEXMO5YAI37KL/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-05-31T11:48:24Z","links":{"resolver":"https://pith.science/pith/3FRERIMGV4Y32CEXMO5YAI37KL","bundle":"https://pith.science/pith/3FRERIMGV4Y32CEXMO5YAI37KL/bundle.json","state":"https://pith.science/pith/3FRERIMGV4Y32CEXMO5YAI37KL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FRERIMGV4Y32CEXMO5YAI37KL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3FRERIMGV4Y32CEXMO5YAI37KL","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":"9ebeef60563c960a85aa74edb5b67d2361039faca8f3f2193f39a81105ecbaa6","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-03T03:26:33Z","title_canon_sha256":"c67e3f22ab980540efdb6b0410248d43c188c86d95fc85dbe094a36f15ecc687"},"schema_version":"1.0","source":{"id":"1907.01721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01721","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01721v1","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01721","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"3FRERIMGV4Y3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3FRERIMGV4Y32CEX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3FRERIMG","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:bb9e145e253b5707cbe664081d47c8a190bb083e31f20cfaf5954315950a556d","target":"graph","created_at":"2026-05-17T23:41:35Z","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":"Parametric timed automata (PTAs) are a powerful formalism to reason, simulate and formally verify critical real-time systems. After 25 years of research on PTAs, it is now well-understood that any non-trivial problem studied is undecidable for general PTAs. We provide here a survey of decision and computation problems for PTAs. On the one hand, bounding time, bounding the number of parameters or the domain of the parameters does not (in general) lead to any decidability. On the other hand, restricting the number of clocks, the use of clocks (compared or not with the parameters), and the use of","authors_text":"\\'Etienne Andr\\'e","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-03T03:26:33Z","title":"What's decidable about parametric timed automata?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01721","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:1bc75c6237e5c762411aee5cc4e3938a3cf0b829fd94049bdb79269859345312","target":"record","created_at":"2026-05-17T23:41:35Z","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":"9ebeef60563c960a85aa74edb5b67d2361039faca8f3f2193f39a81105ecbaa6","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-03T03:26:33Z","title_canon_sha256":"c67e3f22ab980540efdb6b0410248d43c188c86d95fc85dbe094a36f15ecc687"},"schema_version":"1.0","source":{"id":"1907.01721","kind":"arxiv","version":1}},"canonical_sha256":"d96248a186af31bd089763bb80237f52f79a4af68980860ea58c2668d6aaea0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d96248a186af31bd089763bb80237f52f79a4af68980860ea58c2668d6aaea0b","first_computed_at":"2026-05-17T23:41:35.322116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:35.322116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"88N2QbG+np7qzeb0zGTzLgGrCPB7x+aTl9BhbbMAgiyvxqHP43xjPiCqBFeqYsOPzJRBg+FrltVLmesQf6IqAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:35.322776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bc75c6237e5c762411aee5cc4e3938a3cf0b829fd94049bdb79269859345312","sha256:bb9e145e253b5707cbe664081d47c8a190bb083e31f20cfaf5954315950a556d"],"state_sha256":"6f6cd1f90747fd1199486be72f5633906da6b2cc2968868f688820319159f96d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQgx2z/0L0BUkBzFkIkgJtk555a/pBD55KTnrgRmoVIJJ1L6T0Q7wTSamt0jTKLi6KIF4lIvV9b4w6uaXiPWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:48:24.210966Z","bundle_sha256":"c5a4c87278946792ea58003f192dcebe1058005b7ff8f6044d394c4f9cb6cfa3"}}