{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:THPA57AYE7TNNIBXE547AMZNAM","short_pith_number":"pith:THPA57AY","canonical_record":{"source":{"id":"1905.07365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-17T16:33:39Z","cross_cats_sorted":[],"title_canon_sha256":"53dfaacfe95e6b4fb73289c9b1f2614d16a92c259ea3c9762c8712e3f4b0bf8e","abstract_canon_sha256":"9da6a8652d1245f6dae57d42e028aa66075a075dbe78e960fca6c7469b1d03b7"},"schema_version":"1.0"},"canonical_sha256":"99de0efc1827e6d6a0372779f0332d033caab29ff9dec974833badf19f7fb910","source":{"kind":"arxiv","id":"1905.07365","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07365","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07365v3","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07365","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"pith_short_12","alias_value":"THPA57AYE7TN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"THPA57AYE7TNNIBX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"THPA57AY","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:THPA57AYE7TNNIBXE547AMZNAM","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-17T16:33:39Z","cross_cats_sorted":[],"title_canon_sha256":"53dfaacfe95e6b4fb73289c9b1f2614d16a92c259ea3c9762c8712e3f4b0bf8e","abstract_canon_sha256":"9da6a8652d1245f6dae57d42e028aa66075a075dbe78e960fca6c7469b1d03b7"},"schema_version":"1.0"},"canonical_sha256":"99de0efc1827e6d6a0372779f0332d033caab29ff9dec974833badf19f7fb910","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:14.490663Z","signature_b64":"GTKbUGml1wHeyKU9vjfX5397unuObvvYbYZV6o3MYu3PCU49SCXDqN7wL3/GT423c0VGXnUpmNNkcLbVqLYpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99de0efc1827e6d6a0372779f0332d033caab29ff9dec974833badf19f7fb910","last_reissued_at":"2026-05-17T23:45:14.490143Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:14.490143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07365","source_version":3,"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:45:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QE9b3fLIhIRI9ZJjbZ/mYf6liaJETxGA4KjLGisGgn7X4K/Hv215RH9Uf8UtYt7yGzj2EckQJG06E4I//jQiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:12:42.381770Z"},"content_sha256":"a301abcdb415a38c4e11355f77d3c764fffd123852240c645a9fa0bfede70a98","schema_version":"1.0","event_id":"sha256:a301abcdb415a38c4e11355f77d3c764fffd123852240c645a9fa0bfede70a98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:THPA57AYE7TNNIBXE547AMZNAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abstraction Refinement Algorithms for Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Nicolas Markey, Ocan Sankur, Victor Roussanaly","submitted_at":"2019-05-17T16:33:39Z","abstract_excerpt":"We present abstraction-refinement algorithms for model checking safety properties of timed automata. The abstraction domain we consider abstracts away zones by restricting the set of clock constraints that can be used to define them, while the refinement procedure computes the set of constraints that must be taken into consideration in the abstraction so as to exclude a given spurious counterexample. We implement this idea in two ways: an enumerative algorithm where a lazy abstraction approach is adopted, meaning that possibly different abstract domains are assigned to each exploration node; a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07365","kind":"arxiv","version":3},"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:45:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMWi3qaOzkVjPL5S+DjFXNCRoE2AFHzAx0E6j3ci/sD255hARZuJ7Et5lwOWywpXM8F3zvxXLOm+0Ncl1RGeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:12:42.382423Z"},"content_sha256":"dc45095e95d2e0195b1a00fcd54cf6f4b0aa06f385158e20c7ea1ec59c52808c","schema_version":"1.0","event_id":"sha256:dc45095e95d2e0195b1a00fcd54cf6f4b0aa06f385158e20c7ea1ec59c52808c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THPA57AYE7TNNIBXE547AMZNAM/bundle.json","state_url":"https://pith.science/pith/THPA57AYE7TNNIBXE547AMZNAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THPA57AYE7TNNIBXE547AMZNAM/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-31T22:12:42Z","links":{"resolver":"https://pith.science/pith/THPA57AYE7TNNIBXE547AMZNAM","bundle":"https://pith.science/pith/THPA57AYE7TNNIBXE547AMZNAM/bundle.json","state":"https://pith.science/pith/THPA57AYE7TNNIBXE547AMZNAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THPA57AYE7TNNIBXE547AMZNAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:THPA57AYE7TNNIBXE547AMZNAM","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":"9da6a8652d1245f6dae57d42e028aa66075a075dbe78e960fca6c7469b1d03b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-17T16:33:39Z","title_canon_sha256":"53dfaacfe95e6b4fb73289c9b1f2614d16a92c259ea3c9762c8712e3f4b0bf8e"},"schema_version":"1.0","source":{"id":"1905.07365","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07365","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07365v3","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07365","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"pith_short_12","alias_value":"THPA57AYE7TN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"THPA57AYE7TNNIBX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"THPA57AY","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:dc45095e95d2e0195b1a00fcd54cf6f4b0aa06f385158e20c7ea1ec59c52808c","target":"graph","created_at":"2026-05-17T23:45:14Z","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 present abstraction-refinement algorithms for model checking safety properties of timed automata. The abstraction domain we consider abstracts away zones by restricting the set of clock constraints that can be used to define them, while the refinement procedure computes the set of constraints that must be taken into consideration in the abstraction so as to exclude a given spurious counterexample. We implement this idea in two ways: an enumerative algorithm where a lazy abstraction approach is adopted, meaning that possibly different abstract domains are assigned to each exploration node; a","authors_text":"Nicolas Markey, Ocan Sankur, Victor Roussanaly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-17T16:33:39Z","title":"Abstraction Refinement Algorithms for Timed Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07365","kind":"arxiv","version":3},"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:a301abcdb415a38c4e11355f77d3c764fffd123852240c645a9fa0bfede70a98","target":"record","created_at":"2026-05-17T23:45:14Z","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":"9da6a8652d1245f6dae57d42e028aa66075a075dbe78e960fca6c7469b1d03b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-17T16:33:39Z","title_canon_sha256":"53dfaacfe95e6b4fb73289c9b1f2614d16a92c259ea3c9762c8712e3f4b0bf8e"},"schema_version":"1.0","source":{"id":"1905.07365","kind":"arxiv","version":3}},"canonical_sha256":"99de0efc1827e6d6a0372779f0332d033caab29ff9dec974833badf19f7fb910","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99de0efc1827e6d6a0372779f0332d033caab29ff9dec974833badf19f7fb910","first_computed_at":"2026-05-17T23:45:14.490143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:14.490143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GTKbUGml1wHeyKU9vjfX5397unuObvvYbYZV6o3MYu3PCU49SCXDqN7wL3/GT423c0VGXnUpmNNkcLbVqLYpDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:14.490663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07365","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a301abcdb415a38c4e11355f77d3c764fffd123852240c645a9fa0bfede70a98","sha256:dc45095e95d2e0195b1a00fcd54cf6f4b0aa06f385158e20c7ea1ec59c52808c"],"state_sha256":"09665f74a22f8984392afd58ee79c260256d014e610de174aeb741ff422006df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T25YoGHBLm0pA4r/BXsoHi2K5A1Ayn1+XZ6wSR3I9jPIqtCsulJ4lIi1JPGF2e2pkjBsJNJxXrEpFCt3ywQGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:12:42.385950Z","bundle_sha256":"34f87c6dabe4c246cf5b737212753a0963f08f5146dae9a37d93a7f98eedaafd"}}