{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SGVNYXZFR7NC7WCOGWOBFXDFQS","short_pith_number":"pith:SGVNYXZF","schema_version":"1.0","canonical_sha256":"91aadc5f258fda2fd84e359c12dc65849713d6af793d4230ccf2e91210e0f4cc","source":{"kind":"arxiv","id":"1202.3355","version":2},"attestation_state":"computed","paper":{"title":"Lattices of Logical Fragments over Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Alexander Lauser, Manfred Kufleitner","submitted_at":"2012-02-15T16:32:24Z","abstract_excerpt":"This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with certain closure properties. Among these closure properties are residuals and inverse C-morphisms. Here, depending on certain closure properties of the fragment, C is the family of arbitrary, non-erasing, length-preserving, length-multiplying, or length-reducing morphisms. In particular, definability in a certain fragment can often be characterized in terms of "},"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":"1202.3355","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-02-15T16:32:24Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"19b6117414f53325f6cda852508e4e14c490569b123bd41810ac8c546f413027","abstract_canon_sha256":"18cfd4c3d53d0ece9fe556f334950ce9d19f4f10a8fa2f362cabf4ec7c7bc878"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.834799Z","signature_b64":"vA66qauukvE8LRWIeJNmyfodbHHbJ1U3HQ4ouLXC6zmzGqykB8GRbi3vSNYjDToi/3rRZIqCezYwVDbYIFksBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91aadc5f258fda2fd84e359c12dc65849713d6af793d4230ccf2e91210e0f4cc","last_reissued_at":"2026-05-18T02:21:17.834107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.834107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattices of Logical Fragments over Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Alexander Lauser, Manfred Kufleitner","submitted_at":"2012-02-15T16:32:24Z","abstract_excerpt":"This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with certain closure properties. Among these closure properties are residuals and inverse C-morphisms. Here, depending on certain closure properties of the fragment, C is the family of arbitrary, non-erasing, length-preserving, length-multiplying, or length-reducing morphisms. In particular, definability in a certain fragment can often be characterized in terms of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3355","kind":"arxiv","version":2},"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":"1202.3355","created_at":"2026-05-18T02:21:17.834208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3355v2","created_at":"2026-05-18T02:21:17.834208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3355","created_at":"2026-05-18T02:21:17.834208+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGVNYXZFR7NC","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGVNYXZFR7NC7WCO","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGVNYXZF","created_at":"2026-05-18T12:27:20.899486+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/SGVNYXZFR7NC7WCOGWOBFXDFQS","json":"https://pith.science/pith/SGVNYXZFR7NC7WCOGWOBFXDFQS.json","graph_json":"https://pith.science/api/pith-number/SGVNYXZFR7NC7WCOGWOBFXDFQS/graph.json","events_json":"https://pith.science/api/pith-number/SGVNYXZFR7NC7WCOGWOBFXDFQS/events.json","paper":"https://pith.science/paper/SGVNYXZF"},"agent_actions":{"view_html":"https://pith.science/pith/SGVNYXZFR7NC7WCOGWOBFXDFQS","download_json":"https://pith.science/pith/SGVNYXZFR7NC7WCOGWOBFXDFQS.json","view_paper":"https://pith.science/paper/SGVNYXZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3355&json=true","fetch_graph":"https://pith.science/api/pith-number/SGVNYXZFR7NC7WCOGWOBFXDFQS/graph.json","fetch_events":"https://pith.science/api/pith-number/SGVNYXZFR7NC7WCOGWOBFXDFQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGVNYXZFR7NC7WCOGWOBFXDFQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGVNYXZFR7NC7WCOGWOBFXDFQS/action/storage_attestation","attest_author":"https://pith.science/pith/SGVNYXZFR7NC7WCOGWOBFXDFQS/action/author_attestation","sign_citation":"https://pith.science/pith/SGVNYXZFR7NC7WCOGWOBFXDFQS/action/citation_signature","submit_replication":"https://pith.science/pith/SGVNYXZFR7NC7WCOGWOBFXDFQS/action/replication_record"}},"created_at":"2026-05-18T02:21:17.834208+00:00","updated_at":"2026-05-18T02:21:17.834208+00:00"}