{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NT7LILCMJ4GABHUYBW4CQIGQFJ","short_pith_number":"pith:NT7LILCM","schema_version":"1.0","canonical_sha256":"6cfeb42c4c4f0c009e980db82820d02a6a75e62f24585162bc4134602fe1ffd1","source":{"kind":"arxiv","id":"1504.04541","version":1},"attestation_state":"computed","paper":{"title":"Polynomial Interrupt Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"B\\'eatrice B\\'erard, Claudine Picaronny, Mathieu Sassolas, Mohab Safey El Din, Serge Haddad","submitted_at":"2015-04-17T15:34:37Z","abstract_excerpt":"Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating systems. Here we extend ITA with polynomial guards and updates, leading to the class of polynomial ITA (PolITA). We prove the decidability of the reachability and model checking of a timed version of CTL by an adaptation of the cylindrical decomposition method for the first-order theory of reals. Compared to previous approaches, our procedure handles parameter"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1504.04541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-17T15:34:37Z","cross_cats_sorted":[],"title_canon_sha256":"9c1a572876bddfe554025b936687f56d07cd8521d874860c45a6a8561a2c37fe","abstract_canon_sha256":"a969d4f71824ee9218d1e1b482d66b0335f44a976c5987db5a72e770465e88b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:32.148940Z","signature_b64":"9imwAE9chzZjCCntPLn5UR9d2ExnoZ4T5qLqf3KlsOA6cORu7qX5bBL4fQA9VJtgYNre4hMezpDjRunh64eFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cfeb42c4c4f0c009e980db82820d02a6a75e62f24585162bc4134602fe1ffd1","last_reissued_at":"2026-05-18T02:18:32.148381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:32.148381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Interrupt Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"B\\'eatrice B\\'erard, Claudine Picaronny, Mathieu Sassolas, Mohab Safey El Din, Serge Haddad","submitted_at":"2015-04-17T15:34:37Z","abstract_excerpt":"Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating systems. Here we extend ITA with polynomial guards and updates, leading to the class of polynomial ITA (PolITA). We prove the decidability of the reachability and model checking of a timed version of CTL by an adaptation of the cylindrical decomposition method for the first-order theory of reals. Compared to previous approaches, our procedure handles parameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04541","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.04541","created_at":"2026-05-18T02:18:32.148468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04541v1","created_at":"2026-05-18T02:18:32.148468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04541","created_at":"2026-05-18T02:18:32.148468+00:00"},{"alias_kind":"pith_short_12","alias_value":"NT7LILCMJ4GA","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NT7LILCMJ4GABHUY","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NT7LILCM","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NT7LILCMJ4GABHUYBW4CQIGQFJ","json":"https://pith.science/pith/NT7LILCMJ4GABHUYBW4CQIGQFJ.json","graph_json":"https://pith.science/api/pith-number/NT7LILCMJ4GABHUYBW4CQIGQFJ/graph.json","events_json":"https://pith.science/api/pith-number/NT7LILCMJ4GABHUYBW4CQIGQFJ/events.json","paper":"https://pith.science/paper/NT7LILCM"},"agent_actions":{"view_html":"https://pith.science/pith/NT7LILCMJ4GABHUYBW4CQIGQFJ","download_json":"https://pith.science/pith/NT7LILCMJ4GABHUYBW4CQIGQFJ.json","view_paper":"https://pith.science/paper/NT7LILCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04541&json=true","fetch_graph":"https://pith.science/api/pith-number/NT7LILCMJ4GABHUYBW4CQIGQFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NT7LILCMJ4GABHUYBW4CQIGQFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NT7LILCMJ4GABHUYBW4CQIGQFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NT7LILCMJ4GABHUYBW4CQIGQFJ/action/storage_attestation","attest_author":"https://pith.science/pith/NT7LILCMJ4GABHUYBW4CQIGQFJ/action/author_attestation","sign_citation":"https://pith.science/pith/NT7LILCMJ4GABHUYBW4CQIGQFJ/action/citation_signature","submit_replication":"https://pith.science/pith/NT7LILCMJ4GABHUYBW4CQIGQFJ/action/replication_record"}},"created_at":"2026-05-18T02:18:32.148468+00:00","updated_at":"2026-05-18T02:18:32.148468+00:00"}