{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JJSGBVOCYUOM7HX7F26PF5ZJHJ","short_pith_number":"pith:JJSGBVOC","schema_version":"1.0","canonical_sha256":"4a6460d5c2c51ccf9eff2ebcf2f7293a46cdf5c8700c096d5eb38f06e155cb4c","source":{"kind":"arxiv","id":"2306.05334","version":2},"attestation_state":"computed","paper":{"title":"Twin-width of subdivisions of multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Debsoumya Chakraborti, Jungho Ahn, Kevin Hendrey, Sang-il Oum","submitted_at":"2023-06-08T16:33:28Z","abstract_excerpt":"For each $d\\leq3$, we construct a finite set $F_d$ of multigraphs such that for each graph $H$ of girth at least $5$ obtained from a multigraph $G$ by subdividing each edge at least two times, $H$ has twin-width at most $d$ if and only if $G$ has no minor in $F_d$. This answers a question of Berg\\'{e}, Bonnet, and D\\'{e}pr\\'{e}s asking for the structure of graphs $G$ such that each long subdivision of $G$ has twin-width $4$. As a corollary, we show that the $7\\times7$ grid has twin-width $4$, which answers a question of Schidler and Szeider."},"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":"2306.05334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-08T16:33:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"052234cc0ff701f923d5a6bad5e33eff18eba1cdcf02ff6db4b41d4637754b36","abstract_canon_sha256":"6797541748fa881341cc7c37c7a9065f9f010145059360757a6ddec70fb91da3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:38.733938Z","signature_b64":"mc1ZTkXkCON0yBTySH9EYx7taVNWUwQhlc19pAfOiD73Mn4F67rqsjGeB0UkT7kkxA06ng7sBtCOfe7KICSoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a6460d5c2c51ccf9eff2ebcf2f7293a46cdf5c8700c096d5eb38f06e155cb4c","last_reissued_at":"2026-07-05T11:53:38.733360Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:38.733360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Twin-width of subdivisions of multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Debsoumya Chakraborti, Jungho Ahn, Kevin Hendrey, Sang-il Oum","submitted_at":"2023-06-08T16:33:28Z","abstract_excerpt":"For each $d\\leq3$, we construct a finite set $F_d$ of multigraphs such that for each graph $H$ of girth at least $5$ obtained from a multigraph $G$ by subdividing each edge at least two times, $H$ has twin-width at most $d$ if and only if $G$ has no minor in $F_d$. This answers a question of Berg\\'{e}, Bonnet, and D\\'{e}pr\\'{e}s asking for the structure of graphs $G$ such that each long subdivision of $G$ has twin-width $4$. As a corollary, we show that the $7\\times7$ grid has twin-width $4$, which answers a question of Schidler and Szeider."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.05334","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/2306.05334/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":"2306.05334","created_at":"2026-07-05T11:53:38.733433+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.05334v2","created_at":"2026-07-05T11:53:38.733433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.05334","created_at":"2026-07-05T11:53:38.733433+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJSGBVOCYUOM","created_at":"2026-07-05T11:53:38.733433+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJSGBVOCYUOM7HX7","created_at":"2026-07-05T11:53:38.733433+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJSGBVOC","created_at":"2026-07-05T11:53:38.733433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00991","citing_title":"Twin-width one","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ","json":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ.json","graph_json":"https://pith.science/api/pith-number/JJSGBVOCYUOM7HX7F26PF5ZJHJ/graph.json","events_json":"https://pith.science/api/pith-number/JJSGBVOCYUOM7HX7F26PF5ZJHJ/events.json","paper":"https://pith.science/paper/JJSGBVOC"},"agent_actions":{"view_html":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ","download_json":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ.json","view_paper":"https://pith.science/paper/JJSGBVOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.05334&json=true","fetch_graph":"https://pith.science/api/pith-number/JJSGBVOCYUOM7HX7F26PF5ZJHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JJSGBVOCYUOM7HX7F26PF5ZJHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/action/storage_attestation","attest_author":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/action/author_attestation","sign_citation":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/action/citation_signature","submit_replication":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/action/replication_record"}},"created_at":"2026-07-05T11:53:38.733433+00:00","updated_at":"2026-07-05T11:53:38.733433+00:00"}