{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3H6SW2MAJM5EM7KQWC2ESYSIZC","short_pith_number":"pith:3H6SW2MA","schema_version":"1.0","canonical_sha256":"d9fd2b69804b3a467d50b0b4496248c8ac072e8be52c92bca60a6054ea6bd455","source":{"kind":"arxiv","id":"1711.08314","version":1},"attestation_state":"computed","paper":{"title":"Event-Clock Nested Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Adriano Peron, Aniello Murano, Laura Bozzelli","submitted_at":"2017-11-22T15:01:22Z","abstract_excerpt":"In this paper we introduce and study Event-Clock Nested Automata (ECNA), a formalism that combines Event Clock Automata (ECA) and Visibly Pushdown Automata (VPA). ECNA allow to express real-time properties over non-regular patterns of recursive programs. We prove that ECNA retain the same closure and decidability properties of ECA and VPA being closed under Boolean operations and having a decidable language-inclusion problem. In particular, we prove that emptiness, universality, and language-inclusion for ECNA are EXPTIME-complete problems. As for the expressiveness, we have that ECNA properly"},"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":"1711.08314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-11-22T15:01:22Z","cross_cats_sorted":[],"title_canon_sha256":"e6336fd33090d0e90c8f905ed387317e2534f8c8147dc14bb4c1069b3294d370","abstract_canon_sha256":"a447c00439ae168eded5004252db50ea5e178b5517bd77f39a1655b61626d601"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:50.104436Z","signature_b64":"Zst3QHp4swoes1A8QwTPjFKAt57t7Hg/SJEj3B3epZCY9FodVLV9q61WxH8OjkWUk28FA0uvmiRJfT/0Fa4WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9fd2b69804b3a467d50b0b4496248c8ac072e8be52c92bca60a6054ea6bd455","last_reissued_at":"2026-05-18T00:29:50.103862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:50.103862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Event-Clock Nested Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Adriano Peron, Aniello Murano, Laura Bozzelli","submitted_at":"2017-11-22T15:01:22Z","abstract_excerpt":"In this paper we introduce and study Event-Clock Nested Automata (ECNA), a formalism that combines Event Clock Automata (ECA) and Visibly Pushdown Automata (VPA). ECNA allow to express real-time properties over non-regular patterns of recursive programs. We prove that ECNA retain the same closure and decidability properties of ECA and VPA being closed under Boolean operations and having a decidable language-inclusion problem. In particular, we prove that emptiness, universality, and language-inclusion for ECNA are EXPTIME-complete problems. As for the expressiveness, we have that ECNA properly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08314","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":"1711.08314","created_at":"2026-05-18T00:29:50.103973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08314v1","created_at":"2026-05-18T00:29:50.103973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08314","created_at":"2026-05-18T00:29:50.103973+00:00"},{"alias_kind":"pith_short_12","alias_value":"3H6SW2MAJM5E","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3H6SW2MAJM5EM7KQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3H6SW2MA","created_at":"2026-05-18T12:30:58.224056+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/3H6SW2MAJM5EM7KQWC2ESYSIZC","json":"https://pith.science/pith/3H6SW2MAJM5EM7KQWC2ESYSIZC.json","graph_json":"https://pith.science/api/pith-number/3H6SW2MAJM5EM7KQWC2ESYSIZC/graph.json","events_json":"https://pith.science/api/pith-number/3H6SW2MAJM5EM7KQWC2ESYSIZC/events.json","paper":"https://pith.science/paper/3H6SW2MA"},"agent_actions":{"view_html":"https://pith.science/pith/3H6SW2MAJM5EM7KQWC2ESYSIZC","download_json":"https://pith.science/pith/3H6SW2MAJM5EM7KQWC2ESYSIZC.json","view_paper":"https://pith.science/paper/3H6SW2MA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08314&json=true","fetch_graph":"https://pith.science/api/pith-number/3H6SW2MAJM5EM7KQWC2ESYSIZC/graph.json","fetch_events":"https://pith.science/api/pith-number/3H6SW2MAJM5EM7KQWC2ESYSIZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3H6SW2MAJM5EM7KQWC2ESYSIZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3H6SW2MAJM5EM7KQWC2ESYSIZC/action/storage_attestation","attest_author":"https://pith.science/pith/3H6SW2MAJM5EM7KQWC2ESYSIZC/action/author_attestation","sign_citation":"https://pith.science/pith/3H6SW2MAJM5EM7KQWC2ESYSIZC/action/citation_signature","submit_replication":"https://pith.science/pith/3H6SW2MAJM5EM7KQWC2ESYSIZC/action/replication_record"}},"created_at":"2026-05-18T00:29:50.103973+00:00","updated_at":"2026-05-18T00:29:50.103973+00:00"}