{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZQBYFKQS7IEZJSFRIT7AGXHXES","short_pith_number":"pith:ZQBYFKQS","canonical_record":{"source":{"id":"1301.3127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-14T20:56:20Z","cross_cats_sorted":[],"title_canon_sha256":"9e35207a6b37bc12fffd76eecd44c8282a8316101d2fb4fe6a9adf6bc499e76f","abstract_canon_sha256":"afe13b1acc9b00649ba14720be79ecc7f24944937cf28e1b58d94a6246371e5c"},"schema_version":"1.0"},"canonical_sha256":"cc0382aa12fa0994c8b144fe035cf724be20d16ba3f9077881ee258b0f0133ef","source":{"kind":"arxiv","id":"1301.3127","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3127","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3127v2","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3127","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZQBYFKQS7IEZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZQBYFKQS7IEZJSFR","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZQBYFKQS","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZQBYFKQS7IEZJSFRIT7AGXHXES","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-14T20:56:20Z","cross_cats_sorted":[],"title_canon_sha256":"9e35207a6b37bc12fffd76eecd44c8282a8316101d2fb4fe6a9adf6bc499e76f","abstract_canon_sha256":"afe13b1acc9b00649ba14720be79ecc7f24944937cf28e1b58d94a6246371e5c"},"schema_version":"1.0"},"canonical_sha256":"cc0382aa12fa0994c8b144fe035cf724be20d16ba3f9077881ee258b0f0133ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:05.955771Z","signature_b64":"4FwK4AF0BVKhzGemD5bvostl23onZ63LDvkseqhN9HXFJ7AJA9utJ3jTTWvi+cjjgjcHVcwtrOxwoyl1XdPQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc0382aa12fa0994c8b144fe035cf724be20d16ba3f9077881ee258b0f0133ef","last_reissued_at":"2026-05-18T03:36:05.954872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:05.954872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3127","source_version":2,"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:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nx7iRaJgQAUHS4/Ms5lulTzzMqOKOqcBZz2K7GcVkXG/eqZ2aCAx6loVSDw8vtfp7cHSD/LUzldPKZ2uAZOzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:01:56.587113Z"},"content_sha256":"13a231b568bac806ca80221d91b39caec6ff22fc0be7e8938d47caf1a049f220","schema_version":"1.0","event_id":"sha256:13a231b568bac806ca80221d91b39caec6ff22fc0be7e8938d47caf1a049f220"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZQBYFKQS7IEZJSFRIT7AGXHXES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lazy abstractions for timed automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"B. Srivathsan (RWTH), Fr\\'ed\\'eric Herbreteau (LaBRI), Igor Walukiewicz (LaBRI)","submitted_at":"2013-01-14T20:56:20Z","abstract_excerpt":"We consider the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of zones. For efficiency reasons, they are parametrized by the maximal lower and upper bounds (LU-bounds) occurring in the guards of the automaton. We propose an algorithm that is updating LU-bounds during exploration of the search tree. In order to keep them as small as possible, the bounds are refined only when they enable a transition that is impossible in the unabstracted system. So our algorithm can be seen as a kind of lazy CEGAR algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3127","kind":"arxiv","version":2},"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:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IS4BbfVd252ZkIlgl6Z1OjlWOC1z6J5z0nSKHCaRIjNu+uFMSLo0+t9Hi3gvLHdByCDw0YX4b+V0QAin42WZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:01:56.587477Z"},"content_sha256":"fa20e7ba758612fe1370c1ad98313e9f51ef816b2f842ca833afbb35b85dd5d9","schema_version":"1.0","event_id":"sha256:fa20e7ba758612fe1370c1ad98313e9f51ef816b2f842ca833afbb35b85dd5d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQBYFKQS7IEZJSFRIT7AGXHXES/bundle.json","state_url":"https://pith.science/pith/ZQBYFKQS7IEZJSFRIT7AGXHXES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQBYFKQS7IEZJSFRIT7AGXHXES/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-07-04T07:01:56Z","links":{"resolver":"https://pith.science/pith/ZQBYFKQS7IEZJSFRIT7AGXHXES","bundle":"https://pith.science/pith/ZQBYFKQS7IEZJSFRIT7AGXHXES/bundle.json","state":"https://pith.science/pith/ZQBYFKQS7IEZJSFRIT7AGXHXES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQBYFKQS7IEZJSFRIT7AGXHXES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZQBYFKQS7IEZJSFRIT7AGXHXES","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":"afe13b1acc9b00649ba14720be79ecc7f24944937cf28e1b58d94a6246371e5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-14T20:56:20Z","title_canon_sha256":"9e35207a6b37bc12fffd76eecd44c8282a8316101d2fb4fe6a9adf6bc499e76f"},"schema_version":"1.0","source":{"id":"1301.3127","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3127","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3127v2","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3127","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZQBYFKQS7IEZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZQBYFKQS7IEZJSFR","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZQBYFKQS","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:fa20e7ba758612fe1370c1ad98313e9f51ef816b2f842ca833afbb35b85dd5d9","target":"graph","created_at":"2026-05-18T03:36:05Z","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 consider the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of zones. For efficiency reasons, they are parametrized by the maximal lower and upper bounds (LU-bounds) occurring in the guards of the automaton. We propose an algorithm that is updating LU-bounds during exploration of the search tree. In order to keep them as small as possible, the bounds are refined only when they enable a transition that is impossible in the unabstracted system. So our algorithm can be seen as a kind of lazy CEGAR algor","authors_text":"B. Srivathsan (RWTH), Fr\\'ed\\'eric Herbreteau (LaBRI), Igor Walukiewicz (LaBRI)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-14T20:56:20Z","title":"Lazy abstractions for timed automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3127","kind":"arxiv","version":2},"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:13a231b568bac806ca80221d91b39caec6ff22fc0be7e8938d47caf1a049f220","target":"record","created_at":"2026-05-18T03:36:05Z","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":"afe13b1acc9b00649ba14720be79ecc7f24944937cf28e1b58d94a6246371e5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-14T20:56:20Z","title_canon_sha256":"9e35207a6b37bc12fffd76eecd44c8282a8316101d2fb4fe6a9adf6bc499e76f"},"schema_version":"1.0","source":{"id":"1301.3127","kind":"arxiv","version":2}},"canonical_sha256":"cc0382aa12fa0994c8b144fe035cf724be20d16ba3f9077881ee258b0f0133ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc0382aa12fa0994c8b144fe035cf724be20d16ba3f9077881ee258b0f0133ef","first_computed_at":"2026-05-18T03:36:05.954872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:05.954872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4FwK4AF0BVKhzGemD5bvostl23onZ63LDvkseqhN9HXFJ7AJA9utJ3jTTWvi+cjjgjcHVcwtrOxwoyl1XdPQCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:05.955771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3127","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13a231b568bac806ca80221d91b39caec6ff22fc0be7e8938d47caf1a049f220","sha256:fa20e7ba758612fe1370c1ad98313e9f51ef816b2f842ca833afbb35b85dd5d9"],"state_sha256":"210ed66d51a53dd22b2fc1378ad1b607c5c12fe7510ab30377d7b721453f3642"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqBZBqIHR/3CIiKQdz7dPACFeqmBGyJpAGYwo+HOXYfa1Q7R7LyAR3rya+yJSQMKsMcAcqO0AYShTcY9zHelDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T07:01:56.589407Z","bundle_sha256":"6a9c8aad195b23157792708020388df1ed6b72916fc068ac936f6405a996d607"}}