{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KYWFVCD3YRTJMEO74NLJJPNNLD","short_pith_number":"pith:KYWFVCD3","schema_version":"1.0","canonical_sha256":"562c5a887bc4669611dfe35694bdad58dccddd75dffe797e84aa91b24a6495ea","source":{"kind":"arxiv","id":"1204.6291","version":1},"attestation_state":"computed","paper":{"title":"Where First-Order and Monadic Second-Order Logic Coincide","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Martin Grohe, Michael Elberfeld, Till Tantau","submitted_at":"2012-04-27T18:52:15Z","abstract_excerpt":"We study on which classes of graphs first-order logic (FO) and monadic second-order logic (MSO) have the same expressive power. We show that for all classes C of graphs that are closed under taking subgraphs, FO and MSO have the same expressive power on C if, and only if, C has bounded tree depth. Tree depth is a graph invariant that measures the similarity of a graph to a star in a similar way that tree width measures the similarity of a graph to a tree. For classes just closed under taking induced subgraphs, we show an analogous result for guarded second-order logic (GSO), the variant of MSO"},"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":"1204.6291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-27T18:52:15Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d341c416115def662a46ac3bc40c4f27023b9e5789ca2f12d1e30874aaebf9b9","abstract_canon_sha256":"3615c3a71d8b248abab4bfce7f000f59c62065cb07bbc2b383f21328823731df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:15.896196Z","signature_b64":"YRTnx57qgIRCKny+xkczxG4DZRpHtqFPxBniitcpEJ83jTDapAhOiUrIRgInHLqAgMusC7zCQZr8V/e5gD33Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"562c5a887bc4669611dfe35694bdad58dccddd75dffe797e84aa91b24a6495ea","last_reissued_at":"2026-05-18T02:21:15.895594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:15.895594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Where First-Order and Monadic Second-Order Logic Coincide","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Martin Grohe, Michael Elberfeld, Till Tantau","submitted_at":"2012-04-27T18:52:15Z","abstract_excerpt":"We study on which classes of graphs first-order logic (FO) and monadic second-order logic (MSO) have the same expressive power. We show that for all classes C of graphs that are closed under taking subgraphs, FO and MSO have the same expressive power on C if, and only if, C has bounded tree depth. Tree depth is a graph invariant that measures the similarity of a graph to a star in a similar way that tree width measures the similarity of a graph to a tree. For classes just closed under taking induced subgraphs, we show an analogous result for guarded second-order logic (GSO), the variant of MSO"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6291","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":"1204.6291","created_at":"2026-05-18T02:21:15.895691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.6291v1","created_at":"2026-05-18T02:21:15.895691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6291","created_at":"2026-05-18T02:21:15.895691+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYWFVCD3YRTJ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYWFVCD3YRTJMEO7","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYWFVCD3","created_at":"2026-05-18T12:27:11.947152+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/KYWFVCD3YRTJMEO74NLJJPNNLD","json":"https://pith.science/pith/KYWFVCD3YRTJMEO74NLJJPNNLD.json","graph_json":"https://pith.science/api/pith-number/KYWFVCD3YRTJMEO74NLJJPNNLD/graph.json","events_json":"https://pith.science/api/pith-number/KYWFVCD3YRTJMEO74NLJJPNNLD/events.json","paper":"https://pith.science/paper/KYWFVCD3"},"agent_actions":{"view_html":"https://pith.science/pith/KYWFVCD3YRTJMEO74NLJJPNNLD","download_json":"https://pith.science/pith/KYWFVCD3YRTJMEO74NLJJPNNLD.json","view_paper":"https://pith.science/paper/KYWFVCD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.6291&json=true","fetch_graph":"https://pith.science/api/pith-number/KYWFVCD3YRTJMEO74NLJJPNNLD/graph.json","fetch_events":"https://pith.science/api/pith-number/KYWFVCD3YRTJMEO74NLJJPNNLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYWFVCD3YRTJMEO74NLJJPNNLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYWFVCD3YRTJMEO74NLJJPNNLD/action/storage_attestation","attest_author":"https://pith.science/pith/KYWFVCD3YRTJMEO74NLJJPNNLD/action/author_attestation","sign_citation":"https://pith.science/pith/KYWFVCD3YRTJMEO74NLJJPNNLD/action/citation_signature","submit_replication":"https://pith.science/pith/KYWFVCD3YRTJMEO74NLJJPNNLD/action/replication_record"}},"created_at":"2026-05-18T02:21:15.895691+00:00","updated_at":"2026-05-18T02:21:15.895691+00:00"}