{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MYLRYGDB6TBPWPGBFAKPW26HJM","short_pith_number":"pith:MYLRYGDB","schema_version":"1.0","canonical_sha256":"66171c1861f4c2fb3cc12814fb6bc74b2beebdce7884992fc8da948dc5b54d50","source":{"kind":"arxiv","id":"2502.08476","version":1},"attestation_state":"computed","paper":{"title":"Low rank MSO","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Giannos Stamoulis, Marek Soko{\\l}owski, Micha{\\l} Pilipczuk, Miko{\\l}aj Boja\\'nczyk, Wojciech Przybyszewski","submitted_at":"2025-02-12T15:10:18Z","abstract_excerpt":"We introduce a new logic for describing properties of graphs, which we call low rank MSO. This is the fragment of monadic second-order logic in which set quantification is restricted to vertex sets of bounded cutrank. We prove the following statements about the expressive power of low rank MSO.\n  - Over any class of graphs that is weakly sparse, low rank MSO has the same expressive power as separator logic. This equivalence does not hold over all graphs.\n  - Over any class of graphs that has bounded VC dimension, low rank MSO has the same expressive power as flip-connectivity logic. This equiv"},"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":"2502.08476","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-02-12T15:10:18Z","cross_cats_sorted":[],"title_canon_sha256":"84fbe4132673c237878c99d7033ad289df9cc3a8d1ff751621f28c7b64629aef","abstract_canon_sha256":"9c7ca2689035e39ebbad8d30d892c4785ba11b28a77b6a6098d1ec93f647a3fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:23.542814Z","signature_b64":"M7SX9dzwV5Tuyfh3f6Cm2ZC1vGKlhHEP86/xF8vOt4iaRaDVKbwK0ZpaoVbOZc80KsmK0M1N6U5mvmhVJ+BNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66171c1861f4c2fb3cc12814fb6bc74b2beebdce7884992fc8da948dc5b54d50","last_reissued_at":"2026-07-05T10:13:23.542300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:23.542300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low rank MSO","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Giannos Stamoulis, Marek Soko{\\l}owski, Micha{\\l} Pilipczuk, Miko{\\l}aj Boja\\'nczyk, Wojciech Przybyszewski","submitted_at":"2025-02-12T15:10:18Z","abstract_excerpt":"We introduce a new logic for describing properties of graphs, which we call low rank MSO. This is the fragment of monadic second-order logic in which set quantification is restricted to vertex sets of bounded cutrank. We prove the following statements about the expressive power of low rank MSO.\n  - Over any class of graphs that is weakly sparse, low rank MSO has the same expressive power as separator logic. This equivalence does not hold over all graphs.\n  - Over any class of graphs that has bounded VC dimension, low rank MSO has the same expressive power as flip-connectivity logic. This equiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08476","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/2502.08476/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":"2502.08476","created_at":"2026-07-05T10:13:23.542377+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.08476v1","created_at":"2026-07-05T10:13:23.542377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08476","created_at":"2026-07-05T10:13:23.542377+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYLRYGDB6TBP","created_at":"2026-07-05T10:13:23.542377+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYLRYGDB6TBPWPGB","created_at":"2026-07-05T10:13:23.542377+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYLRYGDB","created_at":"2026-07-05T10:13:23.542377+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19138","citing_title":"Moderately beyond clique-width: reduced component max-leaf and related parameters","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYLRYGDB6TBPWPGBFAKPW26HJM","json":"https://pith.science/pith/MYLRYGDB6TBPWPGBFAKPW26HJM.json","graph_json":"https://pith.science/api/pith-number/MYLRYGDB6TBPWPGBFAKPW26HJM/graph.json","events_json":"https://pith.science/api/pith-number/MYLRYGDB6TBPWPGBFAKPW26HJM/events.json","paper":"https://pith.science/paper/MYLRYGDB"},"agent_actions":{"view_html":"https://pith.science/pith/MYLRYGDB6TBPWPGBFAKPW26HJM","download_json":"https://pith.science/pith/MYLRYGDB6TBPWPGBFAKPW26HJM.json","view_paper":"https://pith.science/paper/MYLRYGDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.08476&json=true","fetch_graph":"https://pith.science/api/pith-number/MYLRYGDB6TBPWPGBFAKPW26HJM/graph.json","fetch_events":"https://pith.science/api/pith-number/MYLRYGDB6TBPWPGBFAKPW26HJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYLRYGDB6TBPWPGBFAKPW26HJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYLRYGDB6TBPWPGBFAKPW26HJM/action/storage_attestation","attest_author":"https://pith.science/pith/MYLRYGDB6TBPWPGBFAKPW26HJM/action/author_attestation","sign_citation":"https://pith.science/pith/MYLRYGDB6TBPWPGBFAKPW26HJM/action/citation_signature","submit_replication":"https://pith.science/pith/MYLRYGDB6TBPWPGBFAKPW26HJM/action/replication_record"}},"created_at":"2026-07-05T10:13:23.542377+00:00","updated_at":"2026-07-05T10:13:23.542377+00:00"}