{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4TFCIWOXYKIOXSAJMPVVLSLX7C","short_pith_number":"pith:4TFCIWOX","schema_version":"1.0","canonical_sha256":"e4ca2459d7c290ebc80963eb55c977f8a09eb0f6bcbd6d8ecb4f91e23a9bb99a","source":{"kind":"arxiv","id":"2411.15365","version":1},"attestation_state":"computed","paper":{"title":"Advances in Algorithmic Meta Theorems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO","math.LO"],"primary_cat":"cs.LO","authors_text":"Alexandre Vigny, Sebastian Siebertz","submitted_at":"2024-11-22T22:15:14Z","abstract_excerpt":"Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\\mathscr{C}$ of structures satisfying certain conditions. The most prominent logics studied in the field are (counting) monadic second-order logic (C)MSO, and first-order logic FO and its extensions. The complexity of CMSO model checking in general and of FO model checking on monotone graph classes is very well understood. In recent years there has been a rapid and exciting developmen"},"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":"2411.15365","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-11-22T22:15:14Z","cross_cats_sorted":["cs.DM","math.CO","math.LO"],"title_canon_sha256":"122fc442b4e05c09359e949609d564ce22663f3190a11bf7aedfc1478275073d","abstract_canon_sha256":"30fd16229eaa71af41b406498b12cffac4f728c3aff3286eac9dcf88dd90ead5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:33.680162Z","signature_b64":"Nirx7aoe834lHWZELNQAgNvfoY8q/ICpREmxrwwO62IvPTJ6v8y+fVuPSTjEcHlVQkM8x3VoUIwdjCAvGXzhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ca2459d7c290ebc80963eb55c977f8a09eb0f6bcbd6d8ecb4f91e23a9bb99a","last_reissued_at":"2026-07-05T09:39:33.679692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:33.679692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advances in Algorithmic Meta Theorems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO","math.LO"],"primary_cat":"cs.LO","authors_text":"Alexandre Vigny, Sebastian Siebertz","submitted_at":"2024-11-22T22:15:14Z","abstract_excerpt":"Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\\mathscr{C}$ of structures satisfying certain conditions. The most prominent logics studied in the field are (counting) monadic second-order logic (C)MSO, and first-order logic FO and its extensions. The complexity of CMSO model checking in general and of FO model checking on monotone graph classes is very well understood. In recent years there has been a rapid and exciting developmen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15365","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.15365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.15365","created_at":"2026-07-05T09:39:33.679746+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15365v1","created_at":"2026-07-05T09:39:33.679746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15365","created_at":"2026-07-05T09:39:33.679746+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TFCIWOXYKIO","created_at":"2026-07-05T09:39:33.679746+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TFCIWOXYKIOXSAJ","created_at":"2026-07-05T09:39:33.679746+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TFCIWOX","created_at":"2026-07-05T09:39:33.679746+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/4TFCIWOXYKIOXSAJMPVVLSLX7C","json":"https://pith.science/pith/4TFCIWOXYKIOXSAJMPVVLSLX7C.json","graph_json":"https://pith.science/api/pith-number/4TFCIWOXYKIOXSAJMPVVLSLX7C/graph.json","events_json":"https://pith.science/api/pith-number/4TFCIWOXYKIOXSAJMPVVLSLX7C/events.json","paper":"https://pith.science/paper/4TFCIWOX"},"agent_actions":{"view_html":"https://pith.science/pith/4TFCIWOXYKIOXSAJMPVVLSLX7C","download_json":"https://pith.science/pith/4TFCIWOXYKIOXSAJMPVVLSLX7C.json","view_paper":"https://pith.science/paper/4TFCIWOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15365&json=true","fetch_graph":"https://pith.science/api/pith-number/4TFCIWOXYKIOXSAJMPVVLSLX7C/graph.json","fetch_events":"https://pith.science/api/pith-number/4TFCIWOXYKIOXSAJMPVVLSLX7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TFCIWOXYKIOXSAJMPVVLSLX7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TFCIWOXYKIOXSAJMPVVLSLX7C/action/storage_attestation","attest_author":"https://pith.science/pith/4TFCIWOXYKIOXSAJMPVVLSLX7C/action/author_attestation","sign_citation":"https://pith.science/pith/4TFCIWOXYKIOXSAJMPVVLSLX7C/action/citation_signature","submit_replication":"https://pith.science/pith/4TFCIWOXYKIOXSAJMPVVLSLX7C/action/replication_record"}},"created_at":"2026-07-05T09:39:33.679746+00:00","updated_at":"2026-07-05T09:39:33.679746+00:00"}