{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MPE3MLPYD7YJSREHOE3OIRZEIJ","short_pith_number":"pith:MPE3MLPY","schema_version":"1.0","canonical_sha256":"63c9b62df81ff09944877136e44724427b0a1386e995de1b1dd4e25b99cb1bbf","source":{"kind":"arxiv","id":"2505.15655","version":1},"attestation_state":"computed","paper":{"title":"First-order transducibility among classes of sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.LO","authors_text":"Jakub Gajarsk\\'y, Jan Jedelsk\\'y, Jeremi G{\\l}adkowski, Micha{\\l} Pilipczuk, Szymon Toru\\'nczyk","submitted_at":"2025-05-21T15:31:33Z","abstract_excerpt":"We prove several negative results about first-order transducibility for classes of sparse graphs:\n  - for every $t \\in \\mathbb{N}$, the class of graphs of treewidth at most $t+1$ is not transducible from the class of graphs of treewidth at most $t$;\n  - for every $t \\in \\mathbb{N}$, the class of graphs with Hadwiger number at most $t+2$ is not transducible from the class of graphs with Hadwiger number at most $t$; and\n  - the class of graphs of treewidth at most $4$ is not transducible from the class of planar graphs.\n  These results are obtained by combining the known upper and lower bounds o"},"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":"2505.15655","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-05-21T15:31:33Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"2f80a2717981b2bba677d8f9982e7d032bb6508d23920022096152976fbbab97","abstract_canon_sha256":"277af4d571513c6861bd399f8a0684e7bd18ee26b333d3f4c521eb88e04c3c6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:49.144541Z","signature_b64":"7SySqu5IPPIRQ0m3x+vbaVN5Yvn0dOBcWLS11mVKX8K67fUlGwhzKJr5ivFvhrH1R4ieo4UtqVsIVrHeGqQtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c9b62df81ff09944877136e44724427b0a1386e995de1b1dd4e25b99cb1bbf","last_reissued_at":"2026-07-05T11:06:49.144094Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:49.144094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-order transducibility among classes of sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.LO","authors_text":"Jakub Gajarsk\\'y, Jan Jedelsk\\'y, Jeremi G{\\l}adkowski, Micha{\\l} Pilipczuk, Szymon Toru\\'nczyk","submitted_at":"2025-05-21T15:31:33Z","abstract_excerpt":"We prove several negative results about first-order transducibility for classes of sparse graphs:\n  - for every $t \\in \\mathbb{N}$, the class of graphs of treewidth at most $t+1$ is not transducible from the class of graphs of treewidth at most $t$;\n  - for every $t \\in \\mathbb{N}$, the class of graphs with Hadwiger number at most $t+2$ is not transducible from the class of graphs with Hadwiger number at most $t$; and\n  - the class of graphs of treewidth at most $4$ is not transducible from the class of planar graphs.\n  These results are obtained by combining the known upper and lower bounds o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15655","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/2505.15655/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":"2505.15655","created_at":"2026-07-05T11:06:49.144150+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.15655v1","created_at":"2026-07-05T11:06:49.144150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15655","created_at":"2026-07-05T11:06:49.144150+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPE3MLPYD7YJ","created_at":"2026-07-05T11:06:49.144150+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPE3MLPYD7YJSREH","created_at":"2026-07-05T11:06:49.144150+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPE3MLPY","created_at":"2026-07-05T11:06:49.144150+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":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MPE3MLPYD7YJSREHOE3OIRZEIJ","json":"https://pith.science/pith/MPE3MLPYD7YJSREHOE3OIRZEIJ.json","graph_json":"https://pith.science/api/pith-number/MPE3MLPYD7YJSREHOE3OIRZEIJ/graph.json","events_json":"https://pith.science/api/pith-number/MPE3MLPYD7YJSREHOE3OIRZEIJ/events.json","paper":"https://pith.science/paper/MPE3MLPY"},"agent_actions":{"view_html":"https://pith.science/pith/MPE3MLPYD7YJSREHOE3OIRZEIJ","download_json":"https://pith.science/pith/MPE3MLPYD7YJSREHOE3OIRZEIJ.json","view_paper":"https://pith.science/paper/MPE3MLPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.15655&json=true","fetch_graph":"https://pith.science/api/pith-number/MPE3MLPYD7YJSREHOE3OIRZEIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MPE3MLPYD7YJSREHOE3OIRZEIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPE3MLPYD7YJSREHOE3OIRZEIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPE3MLPYD7YJSREHOE3OIRZEIJ/action/storage_attestation","attest_author":"https://pith.science/pith/MPE3MLPYD7YJSREHOE3OIRZEIJ/action/author_attestation","sign_citation":"https://pith.science/pith/MPE3MLPYD7YJSREHOE3OIRZEIJ/action/citation_signature","submit_replication":"https://pith.science/pith/MPE3MLPYD7YJSREHOE3OIRZEIJ/action/replication_record"}},"created_at":"2026-07-05T11:06:49.144150+00:00","updated_at":"2026-07-05T11:06:49.144150+00:00"}