{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4DY5FRG3O34AAPUSWNQZCPCSDH","short_pith_number":"pith:4DY5FRG3","schema_version":"1.0","canonical_sha256":"e0f1d2c4db76f8003e92b361913c5219dcc50c94b938663df29efe4ec31a9e5c","source":{"kind":"arxiv","id":"1606.09399","version":1},"attestation_state":"computed","paper":{"title":"Coalgebraic Trace Semantics for Buechi and Parity Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ichiro Hasuo, Natsuki Urabe, Shunsuke Shimizu","submitted_at":"2016-06-30T09:11:28Z","abstract_excerpt":"Despite its success in producing numerous general results on state-based dynamics, the theory of coalgebra has struggled to accommodate the Buechi acceptance condition---a basic notion in the theory of automata for infinite words or trees. In this paper we present a clean answer to the question that builds on the \"maximality\" characterization of infinite traces (by Jacobs and Cirstea): the accepted language of a Buechi automaton is characterized by two commuting diagrams, one for a least homomorphism and the other for a greatest, much like in a system of (least and greatest) fixed-point equati"},"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":"1606.09399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-30T09:11:28Z","cross_cats_sorted":[],"title_canon_sha256":"64a0bddb289b6235ac12d8e1ec733c910da2ff6d48b98fa4b3dabe1a70f858e0","abstract_canon_sha256":"c390826b04544c8a02be06baf695d2b7b9f6a62594c219bfdf5ade74cde607d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:40.526459Z","signature_b64":"mpHi8Mf9kZA327r2+LxUjc59s954yYzjFaPkqGBhLv8dkVbHUukaTGa0kGUx1LHN2BmQYbyBpMUMDuUwrO59CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0f1d2c4db76f8003e92b361913c5219dcc50c94b938663df29efe4ec31a9e5c","last_reissued_at":"2026-05-18T01:11:40.526019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:40.526019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coalgebraic Trace Semantics for Buechi and Parity Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ichiro Hasuo, Natsuki Urabe, Shunsuke Shimizu","submitted_at":"2016-06-30T09:11:28Z","abstract_excerpt":"Despite its success in producing numerous general results on state-based dynamics, the theory of coalgebra has struggled to accommodate the Buechi acceptance condition---a basic notion in the theory of automata for infinite words or trees. In this paper we present a clean answer to the question that builds on the \"maximality\" characterization of infinite traces (by Jacobs and Cirstea): the accepted language of a Buechi automaton is characterized by two commuting diagrams, one for a least homomorphism and the other for a greatest, much like in a system of (least and greatest) fixed-point equati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09399","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":"1606.09399","created_at":"2026-05-18T01:11:40.526079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.09399v1","created_at":"2026-05-18T01:11:40.526079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09399","created_at":"2026-05-18T01:11:40.526079+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DY5FRG3O34A","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DY5FRG3O34AAPUS","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DY5FRG3","created_at":"2026-05-18T12:29:58.707656+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/4DY5FRG3O34AAPUSWNQZCPCSDH","json":"https://pith.science/pith/4DY5FRG3O34AAPUSWNQZCPCSDH.json","graph_json":"https://pith.science/api/pith-number/4DY5FRG3O34AAPUSWNQZCPCSDH/graph.json","events_json":"https://pith.science/api/pith-number/4DY5FRG3O34AAPUSWNQZCPCSDH/events.json","paper":"https://pith.science/paper/4DY5FRG3"},"agent_actions":{"view_html":"https://pith.science/pith/4DY5FRG3O34AAPUSWNQZCPCSDH","download_json":"https://pith.science/pith/4DY5FRG3O34AAPUSWNQZCPCSDH.json","view_paper":"https://pith.science/paper/4DY5FRG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.09399&json=true","fetch_graph":"https://pith.science/api/pith-number/4DY5FRG3O34AAPUSWNQZCPCSDH/graph.json","fetch_events":"https://pith.science/api/pith-number/4DY5FRG3O34AAPUSWNQZCPCSDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DY5FRG3O34AAPUSWNQZCPCSDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DY5FRG3O34AAPUSWNQZCPCSDH/action/storage_attestation","attest_author":"https://pith.science/pith/4DY5FRG3O34AAPUSWNQZCPCSDH/action/author_attestation","sign_citation":"https://pith.science/pith/4DY5FRG3O34AAPUSWNQZCPCSDH/action/citation_signature","submit_replication":"https://pith.science/pith/4DY5FRG3O34AAPUSWNQZCPCSDH/action/replication_record"}},"created_at":"2026-05-18T01:11:40.526079+00:00","updated_at":"2026-05-18T01:11:40.526079+00:00"}