{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BPMKDUMW42ZQLNTIM7KSCEZ3AJ","short_pith_number":"pith:BPMKDUMW","canonical_record":{"source":{"id":"1707.02297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-08T13:07:53Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0333f0aae0482df56d355ac9ad410bdf262cdf10ab0c30a57315c86b9a6f9c49","abstract_canon_sha256":"9c8c5005cb7d5e19b3dde41859d9969fa6b4c182bf74a487327939babfd8c433"},"schema_version":"1.0"},"canonical_sha256":"0bd8a1d196e6b305b66867d521133b024df79ddee4a4300654c536c2be270c20","source":{"kind":"arxiv","id":"1707.02297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02297","created_at":"2026-05-18T00:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02297v1","created_at":"2026-05-18T00:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02297","created_at":"2026-05-18T00:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"BPMKDUMW42ZQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BPMKDUMW42ZQLNTI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BPMKDUMW","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BPMKDUMW42ZQLNTIM7KSCEZ3AJ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-08T13:07:53Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0333f0aae0482df56d355ac9ad410bdf262cdf10ab0c30a57315c86b9a6f9c49","abstract_canon_sha256":"9c8c5005cb7d5e19b3dde41859d9969fa6b4c182bf74a487327939babfd8c433"},"schema_version":"1.0"},"canonical_sha256":"0bd8a1d196e6b305b66867d521133b024df79ddee4a4300654c536c2be270c20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:39.574260Z","signature_b64":"+0d76CXHEnAPN2YekfFYMZAm0Imju+Tqiwp2yGLAEiYOjJVx6ifoSyg/a5c9xQSBAYsDT5sgj82xd9iSYPF0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bd8a1d196e6b305b66867d521133b024df79ddee4a4300654c536c2be270c20","last_reissued_at":"2026-05-18T00:40:39.573550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:39.573550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02297","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:40:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5XC1NJc+5URozJjMeHnMHa4HWfnjQyv39Y9BhWFnEcJkeb1dk3FTxgA0z0uwMOmV97kUAqOPJ9n6T6nvxTF8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:45.306503Z"},"content_sha256":"d45ed1a8de0e212608968afae38457168037e03ac12fa4bcb035b949f2a3aca9","schema_version":"1.0","event_id":"sha256:d45ed1a8de0e212608968afae38457168037e03ac12fa4bcb035b949f2a3aca9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BPMKDUMW42ZQLNTIM7KSCEZ3AJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards an Efficient Tree Automata based technique for Timed Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ilias Sarkar, Paul Gastin, S. Akshay, Shankara Narayanan Krishna","submitted_at":"2017-07-08T13:07:53Z","abstract_excerpt":"The focus of this paper is the analysis of real-time systems with recursion, through the development of good theoretical techniques which are implementable. Time is modeled using clock variables, and recursion using stacks. Our technique consists of modeling the behaviours of the timed system as graphs, and interpreting these graphs on tree terms by showing a bound on their tree-width. We then build a tree automaton that accepts exactly those tree terms that describe realizable runs of the timed system. The emptiness of the timed system thus boils down to emptiness of a finite tree automaton t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02297","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:40:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuGp4NhFv07jGoyme3318vqR2nX55f4XDq/BDGumltWBS3enaQ95M4lp8YgTkRmZ/ng9Ww2+EveGXnYN48TbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:45.307365Z"},"content_sha256":"86c89852da8bd59620fc80848623c1da52345db88c28a2f0a8dff0f4a0a41ee4","schema_version":"1.0","event_id":"sha256:86c89852da8bd59620fc80848623c1da52345db88c28a2f0a8dff0f4a0a41ee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPMKDUMW42ZQLNTIM7KSCEZ3AJ/bundle.json","state_url":"https://pith.science/pith/BPMKDUMW42ZQLNTIM7KSCEZ3AJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPMKDUMW42ZQLNTIM7KSCEZ3AJ/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-30T09:21:45Z","links":{"resolver":"https://pith.science/pith/BPMKDUMW42ZQLNTIM7KSCEZ3AJ","bundle":"https://pith.science/pith/BPMKDUMW42ZQLNTIM7KSCEZ3AJ/bundle.json","state":"https://pith.science/pith/BPMKDUMW42ZQLNTIM7KSCEZ3AJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPMKDUMW42ZQLNTIM7KSCEZ3AJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BPMKDUMW42ZQLNTIM7KSCEZ3AJ","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":"9c8c5005cb7d5e19b3dde41859d9969fa6b4c182bf74a487327939babfd8c433","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-08T13:07:53Z","title_canon_sha256":"0333f0aae0482df56d355ac9ad410bdf262cdf10ab0c30a57315c86b9a6f9c49"},"schema_version":"1.0","source":{"id":"1707.02297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02297","created_at":"2026-05-18T00:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02297v1","created_at":"2026-05-18T00:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02297","created_at":"2026-05-18T00:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"BPMKDUMW42ZQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BPMKDUMW42ZQLNTI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BPMKDUMW","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:86c89852da8bd59620fc80848623c1da52345db88c28a2f0a8dff0f4a0a41ee4","target":"graph","created_at":"2026-05-18T00:40:39Z","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":"The focus of this paper is the analysis of real-time systems with recursion, through the development of good theoretical techniques which are implementable. Time is modeled using clock variables, and recursion using stacks. Our technique consists of modeling the behaviours of the timed system as graphs, and interpreting these graphs on tree terms by showing a bound on their tree-width. We then build a tree automaton that accepts exactly those tree terms that describe realizable runs of the timed system. The emptiness of the timed system thus boils down to emptiness of a finite tree automaton t","authors_text":"Ilias Sarkar, Paul Gastin, S. Akshay, Shankara Narayanan Krishna","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-08T13:07:53Z","title":"Towards an Efficient Tree Automata based technique for Timed Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02297","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:d45ed1a8de0e212608968afae38457168037e03ac12fa4bcb035b949f2a3aca9","target":"record","created_at":"2026-05-18T00:40:39Z","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":"9c8c5005cb7d5e19b3dde41859d9969fa6b4c182bf74a487327939babfd8c433","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-08T13:07:53Z","title_canon_sha256":"0333f0aae0482df56d355ac9ad410bdf262cdf10ab0c30a57315c86b9a6f9c49"},"schema_version":"1.0","source":{"id":"1707.02297","kind":"arxiv","version":1}},"canonical_sha256":"0bd8a1d196e6b305b66867d521133b024df79ddee4a4300654c536c2be270c20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bd8a1d196e6b305b66867d521133b024df79ddee4a4300654c536c2be270c20","first_computed_at":"2026-05-18T00:40:39.573550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:39.573550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+0d76CXHEnAPN2YekfFYMZAm0Imju+Tqiwp2yGLAEiYOjJVx6ifoSyg/a5c9xQSBAYsDT5sgj82xd9iSYPF0AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:39.574260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d45ed1a8de0e212608968afae38457168037e03ac12fa4bcb035b949f2a3aca9","sha256:86c89852da8bd59620fc80848623c1da52345db88c28a2f0a8dff0f4a0a41ee4"],"state_sha256":"d7945d36c42f8411ad7a87cee6f4b785b5892ff1dfe73282c5c64d45dd558a8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqyTATwm+drpVCtnXp7/rKlvfl3Cz4so/fiLYsbrxHbMjroYBDVoqF70YvjB9pBkSkZoFaIf21RSZNio7c+LCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:21:45.311151Z","bundle_sha256":"f75627c8e459168c43bbc4adc947336913053ede20fc1a7b46aba1b7dd136d31"}}