{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PYT3343DTTYKOWEWIMFRG4TOI6","short_pith_number":"pith:PYT3343D","schema_version":"1.0","canonical_sha256":"7e27bdf3639cf0a75896430b13726e47b0e99607fd61a851724fed474ab5cd5f","source":{"kind":"arxiv","id":"1810.12731","version":1},"attestation_state":"computed","paper":{"title":"Visibly Pushdown Languages and Free Profinite Algebras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Andreas Krebs, Klaus-J\\\"orn Lange, Silke Czarnetzki","submitted_at":"2018-10-30T13:47:44Z","abstract_excerpt":"We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic objects. These come with a typical Eilenberg relationship, now between classes of visibly pushdown languages and classes of finite algebras. Building on that algebraic foundation, we further construct a topological object with one purpose being the possibility to derive a notion of equations, through which it is possible to prove that some given visibly pushdown language is not part of a certain class (or to even show decidability of the membership-problem of the class in some cases). In particular, w"},"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":"1810.12731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-10-30T13:47:44Z","cross_cats_sorted":[],"title_canon_sha256":"601d3e3190a41ab5a43074bfcfc454e0f4da0ab2b09de48a91020608a4b68f1a","abstract_canon_sha256":"87e1990e7a59cea5decbabe3b4fd54fc57433d5d695369ac9f381ebd589eebb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:54.312869Z","signature_b64":"/mwWPS1MEt5BI8/Drk0lKsE+gLEKEgVOCojzo2w2HPQhy9rPdq4YMRF9FDOlJv39ZvTYgfEOu6nmYTBeIe7IDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e27bdf3639cf0a75896430b13726e47b0e99607fd61a851724fed474ab5cd5f","last_reissued_at":"2026-05-18T00:01:54.312349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:54.312349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Visibly Pushdown Languages and Free Profinite Algebras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Andreas Krebs, Klaus-J\\\"orn Lange, Silke Czarnetzki","submitted_at":"2018-10-30T13:47:44Z","abstract_excerpt":"We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic objects. These come with a typical Eilenberg relationship, now between classes of visibly pushdown languages and classes of finite algebras. Building on that algebraic foundation, we further construct a topological object with one purpose being the possibility to derive a notion of equations, through which it is possible to prove that some given visibly pushdown language is not part of a certain class (or to even show decidability of the membership-problem of the class in some cases). In particular, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12731","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":"1810.12731","created_at":"2026-05-18T00:01:54.312440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.12731v1","created_at":"2026-05-18T00:01:54.312440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12731","created_at":"2026-05-18T00:01:54.312440+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYT3343DTTYK","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYT3343DTTYKOWEW","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYT3343D","created_at":"2026-05-18T12:32:46.962924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2302.13116","citing_title":"The $\\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PYT3343DTTYKOWEWIMFRG4TOI6","json":"https://pith.science/pith/PYT3343DTTYKOWEWIMFRG4TOI6.json","graph_json":"https://pith.science/api/pith-number/PYT3343DTTYKOWEWIMFRG4TOI6/graph.json","events_json":"https://pith.science/api/pith-number/PYT3343DTTYKOWEWIMFRG4TOI6/events.json","paper":"https://pith.science/paper/PYT3343D"},"agent_actions":{"view_html":"https://pith.science/pith/PYT3343DTTYKOWEWIMFRG4TOI6","download_json":"https://pith.science/pith/PYT3343DTTYKOWEWIMFRG4TOI6.json","view_paper":"https://pith.science/paper/PYT3343D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.12731&json=true","fetch_graph":"https://pith.science/api/pith-number/PYT3343DTTYKOWEWIMFRG4TOI6/graph.json","fetch_events":"https://pith.science/api/pith-number/PYT3343DTTYKOWEWIMFRG4TOI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYT3343DTTYKOWEWIMFRG4TOI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYT3343DTTYKOWEWIMFRG4TOI6/action/storage_attestation","attest_author":"https://pith.science/pith/PYT3343DTTYKOWEWIMFRG4TOI6/action/author_attestation","sign_citation":"https://pith.science/pith/PYT3343DTTYKOWEWIMFRG4TOI6/action/citation_signature","submit_replication":"https://pith.science/pith/PYT3343DTTYKOWEWIMFRG4TOI6/action/replication_record"}},"created_at":"2026-05-18T00:01:54.312440+00:00","updated_at":"2026-05-18T00:01:54.312440+00:00"}