{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:U6E42RHZQD7WXZW3Q6MOZ2FJC7","short_pith_number":"pith:U6E42RHZ","schema_version":"1.0","canonical_sha256":"a789cd44f980ff6be6db8798ece8a917df05fb460805dfedaf70d410830c054a","source":{"kind":"arxiv","id":"2208.14412","version":8},"attestation_state":"computed","paper":{"title":"On first-order transductions of classes of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.LO","math.LO"],"primary_cat":"math.CO","authors_text":"Jaroslav Ne\\v{s}et\\v{r}il, Patrice Ossona de Mendez, Samuel Braunfeld, Sebastian Siebertz","submitted_at":"2022-08-30T17:26:34Z","abstract_excerpt":"We study various aspects of the first-order transduction quasi-order on graph classes, which provides a way of measuring the relative complexity of graph classes based on whether one can encode the other using a formula of first-order (FO) logic. In contrast with the conjectured simplicity of the transduction quasi-order for monadic second-order logic, the FO-transduction quasi-order is very complex, and many standard properties from structural graph theory and model theory naturally appear in it. We prove a local normal form for transductions among other general results and constructions, whi"},"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":"2208.14412","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-08-30T17:26:34Z","cross_cats_sorted":["cs.DM","cs.LO","math.LO"],"title_canon_sha256":"b9a59fac3b3e71007f23f8d826e21fe4c2f4f475bce5eb2bc191c150419bd141","abstract_canon_sha256":"41d99fd1d1c20bb4bff708f584bb0d5611c767a6e24c40b11621170e4f137ae8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:26:20.935708Z","signature_b64":"yOpNINSgTYyHNs6fu6Y81s41Lhd4HZ2yAY7dQzznVUSmxngMgHBRJ3ry343lwRkx7dWHnrl1lPrUTS/EX2k4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a789cd44f980ff6be6db8798ece8a917df05fb460805dfedaf70d410830c054a","last_reissued_at":"2026-07-05T11:26:20.935351Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:26:20.935351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On first-order transductions of classes of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.LO","math.LO"],"primary_cat":"math.CO","authors_text":"Jaroslav Ne\\v{s}et\\v{r}il, Patrice Ossona de Mendez, Samuel Braunfeld, Sebastian Siebertz","submitted_at":"2022-08-30T17:26:34Z","abstract_excerpt":"We study various aspects of the first-order transduction quasi-order on graph classes, which provides a way of measuring the relative complexity of graph classes based on whether one can encode the other using a formula of first-order (FO) logic. In contrast with the conjectured simplicity of the transduction quasi-order for monadic second-order logic, the FO-transduction quasi-order is very complex, and many standard properties from structural graph theory and model theory naturally appear in it. We prove a local normal form for transductions among other general results and constructions, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.14412","kind":"arxiv","version":8},"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/2208.14412/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":"2208.14412","created_at":"2026-07-05T11:26:20.935413+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.14412v8","created_at":"2026-07-05T11:26:20.935413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.14412","created_at":"2026-07-05T11:26:20.935413+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6E42RHZQD7W","created_at":"2026-07-05T11:26:20.935413+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6E42RHZQD7WXZW3","created_at":"2026-07-05T11:26:20.935413+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6E42RHZ","created_at":"2026-07-05T11:26:20.935413+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08585","citing_title":"k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6E42RHZQD7WXZW3Q6MOZ2FJC7","json":"https://pith.science/pith/U6E42RHZQD7WXZW3Q6MOZ2FJC7.json","graph_json":"https://pith.science/api/pith-number/U6E42RHZQD7WXZW3Q6MOZ2FJC7/graph.json","events_json":"https://pith.science/api/pith-number/U6E42RHZQD7WXZW3Q6MOZ2FJC7/events.json","paper":"https://pith.science/paper/U6E42RHZ"},"agent_actions":{"view_html":"https://pith.science/pith/U6E42RHZQD7WXZW3Q6MOZ2FJC7","download_json":"https://pith.science/pith/U6E42RHZQD7WXZW3Q6MOZ2FJC7.json","view_paper":"https://pith.science/paper/U6E42RHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.14412&json=true","fetch_graph":"https://pith.science/api/pith-number/U6E42RHZQD7WXZW3Q6MOZ2FJC7/graph.json","fetch_events":"https://pith.science/api/pith-number/U6E42RHZQD7WXZW3Q6MOZ2FJC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6E42RHZQD7WXZW3Q6MOZ2FJC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6E42RHZQD7WXZW3Q6MOZ2FJC7/action/storage_attestation","attest_author":"https://pith.science/pith/U6E42RHZQD7WXZW3Q6MOZ2FJC7/action/author_attestation","sign_citation":"https://pith.science/pith/U6E42RHZQD7WXZW3Q6MOZ2FJC7/action/citation_signature","submit_replication":"https://pith.science/pith/U6E42RHZQD7WXZW3Q6MOZ2FJC7/action/replication_record"}},"created_at":"2026-07-05T11:26:20.935413+00:00","updated_at":"2026-07-05T11:26:20.935413+00:00"}