{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RHVRHDAZUVGXGCRLGWGZUDJWMJ","short_pith_number":"pith:RHVRHDAZ","schema_version":"1.0","canonical_sha256":"89eb138c19a54d730a2b358d9a0d366243f143818c790f5632f0cdbede09732c","source":{"kind":"arxiv","id":"2204.13742","version":2},"attestation_state":"computed","paper":{"title":"Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DM","authors_text":"Filip Pokr\\'yvka, Petr Hlin\\v{e}n\\'y","submitted_at":"2022-04-28T19:00:12Z","abstract_excerpt":"The complexity of the problem of deciding properties expressible in FO logic on graphs -- the FO model checking problem (parameterized by the respective FO formula), is well-understood on so-called sparse graph classes, but much less understood on hereditary dense graph classes. Regarding the latter, a recent concept of twin-width [Bonnet et al., FOCS 2020] appears to be very useful. For instance, the question of these authors [CGTA 2019] about where is the exact limit of fixed-parameter tractability of FO model checking on permutation graphs has been answered by Bonnet et al. in 2020 quite ea"},"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":"2204.13742","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-04-28T19:00:12Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"2909bc452fdeff09c4d536858d79d5c76bd5767f3946c56a5e76b21e8d9b6d4e","abstract_canon_sha256":"ed3b8bc7d817ad500500eaac212859ce922d75d630d8231f7c8499d7db324722"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:36:00.441272Z","signature_b64":"VLVoHQPbHnHJNxE84p1g4Fho5Iy43VcbzHukPqws02vyhPeyAmV2BSJvzkMyt5qlVNaeKGruL0eLVRQknioRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89eb138c19a54d730a2b358d9a0d366243f143818c790f5632f0cdbede09732c","last_reissued_at":"2026-07-05T04:36:00.440758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:36:00.440758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DM","authors_text":"Filip Pokr\\'yvka, Petr Hlin\\v{e}n\\'y","submitted_at":"2022-04-28T19:00:12Z","abstract_excerpt":"The complexity of the problem of deciding properties expressible in FO logic on graphs -- the FO model checking problem (parameterized by the respective FO formula), is well-understood on so-called sparse graph classes, but much less understood on hereditary dense graph classes. Regarding the latter, a recent concept of twin-width [Bonnet et al., FOCS 2020] appears to be very useful. For instance, the question of these authors [CGTA 2019] about where is the exact limit of fixed-parameter tractability of FO model checking on permutation graphs has been answered by Bonnet et al. in 2020 quite ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.13742","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.13742/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":"2204.13742","created_at":"2026-07-05T04:36:00.440814+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.13742v2","created_at":"2026-07-05T04:36:00.440814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.13742","created_at":"2026-07-05T04:36:00.440814+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHVRHDAZUVGX","created_at":"2026-07-05T04:36:00.440814+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHVRHDAZUVGXGCRL","created_at":"2026-07-05T04:36:00.440814+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHVRHDAZ","created_at":"2026-07-05T04:36:00.440814+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08476","citing_title":"Low rank MSO","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RHVRHDAZUVGXGCRLGWGZUDJWMJ","json":"https://pith.science/pith/RHVRHDAZUVGXGCRLGWGZUDJWMJ.json","graph_json":"https://pith.science/api/pith-number/RHVRHDAZUVGXGCRLGWGZUDJWMJ/graph.json","events_json":"https://pith.science/api/pith-number/RHVRHDAZUVGXGCRLGWGZUDJWMJ/events.json","paper":"https://pith.science/paper/RHVRHDAZ"},"agent_actions":{"view_html":"https://pith.science/pith/RHVRHDAZUVGXGCRLGWGZUDJWMJ","download_json":"https://pith.science/pith/RHVRHDAZUVGXGCRLGWGZUDJWMJ.json","view_paper":"https://pith.science/paper/RHVRHDAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.13742&json=true","fetch_graph":"https://pith.science/api/pith-number/RHVRHDAZUVGXGCRLGWGZUDJWMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RHVRHDAZUVGXGCRLGWGZUDJWMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHVRHDAZUVGXGCRLGWGZUDJWMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHVRHDAZUVGXGCRLGWGZUDJWMJ/action/storage_attestation","attest_author":"https://pith.science/pith/RHVRHDAZUVGXGCRLGWGZUDJWMJ/action/author_attestation","sign_citation":"https://pith.science/pith/RHVRHDAZUVGXGCRLGWGZUDJWMJ/action/citation_signature","submit_replication":"https://pith.science/pith/RHVRHDAZUVGXGCRLGWGZUDJWMJ/action/replication_record"}},"created_at":"2026-07-05T04:36:00.440814+00:00","updated_at":"2026-07-05T04:36:00.440814+00:00"}