{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JJSGBVOCYUOM7HX7F26PF5ZJHJ","short_pith_number":"pith:JJSGBVOC","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"},"canonical_sha256":"4a6460d5c2c51ccf9eff2ebcf2f7293a46cdf5c8700c096d5eb38f06e155cb4c","source":{"kind":"arxiv","id":"2306.05334","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.05334","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"arxiv_version","alias_value":"2306.05334v2","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.05334","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_12","alias_value":"JJSGBVOCYUOM","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_16","alias_value":"JJSGBVOCYUOM7HX7","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_8","alias_value":"JJSGBVOC","created_at":"2026-07-05T11:53:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JJSGBVOCYUOM7HX7F26PF5ZJHJ","target":"record","payload":{"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"},"canonical_sha256":"4a6460d5c2c51ccf9eff2ebcf2f7293a46cdf5c8700c096d5eb38f06e155cb4c","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"},"source_kind":"arxiv","source_id":"2306.05334","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:53:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/0XcU4L+pjyu5n8m2MUOenETSv3eYfBAHUB/G0Kf4EDppGmawFk/iV8Omb2n5ThceY5VPDGZ7oWEmnjS4OxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:32:40.973156Z"},"content_sha256":"cf9347634762c19366446f78a829811a8e7141b56d6e0d9f1cfaf4eaafbacad4","schema_version":"1.0","event_id":"sha256:cf9347634762c19366446f78a829811a8e7141b56d6e0d9f1cfaf4eaafbacad4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JJSGBVOCYUOM7HX7F26PF5ZJHJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:53:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTGv3qfR8JIbkQjBj0TqVJNqBDPmx8MzTyFtBUU4/wJP+H6TVedNaz1PqOdjmHwvRmYQofF2KTQ2Icl3DxWoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:32:40.974268Z"},"content_sha256":"4882a2574fa80c2ed3bf9eb45b71c20633b51575d46d198e4b725b4d6467a895","schema_version":"1.0","event_id":"sha256:4882a2574fa80c2ed3bf9eb45b71c20633b51575d46d198e4b725b4d6467a895"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/bundle.json","state_url":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T00:32:41Z","links":{"resolver":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ","bundle":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/bundle.json","state":"https://pith.science/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJSGBVOCYUOM7HX7F26PF5ZJHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JJSGBVOCYUOM7HX7F26PF5ZJHJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6797541748fa881341cc7c37c7a9065f9f010145059360757a6ddec70fb91da3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-08T16:33:28Z","title_canon_sha256":"052234cc0ff701f923d5a6bad5e33eff18eba1cdcf02ff6db4b41d4637754b36"},"schema_version":"1.0","source":{"id":"2306.05334","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.05334","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"arxiv_version","alias_value":"2306.05334v2","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.05334","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_12","alias_value":"JJSGBVOCYUOM","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_16","alias_value":"JJSGBVOCYUOM7HX7","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_8","alias_value":"JJSGBVOC","created_at":"2026-07-05T11:53:38Z"}],"graph_snapshots":[{"event_id":"sha256:4882a2574fa80c2ed3bf9eb45b71c20633b51575d46d198e4b725b4d6467a895","target":"graph","created_at":"2026-07-05T11:53:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.05334/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Debsoumya Chakraborti, Jungho Ahn, Kevin Hendrey, Sang-il Oum","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-08T16:33:28Z","title":"Twin-width of subdivisions of multigraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.05334","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cf9347634762c19366446f78a829811a8e7141b56d6e0d9f1cfaf4eaafbacad4","target":"record","created_at":"2026-07-05T11:53:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6797541748fa881341cc7c37c7a9065f9f010145059360757a6ddec70fb91da3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-08T16:33:28Z","title_canon_sha256":"052234cc0ff701f923d5a6bad5e33eff18eba1cdcf02ff6db4b41d4637754b36"},"schema_version":"1.0","source":{"id":"2306.05334","kind":"arxiv","version":2}},"canonical_sha256":"4a6460d5c2c51ccf9eff2ebcf2f7293a46cdf5c8700c096d5eb38f06e155cb4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a6460d5c2c51ccf9eff2ebcf2f7293a46cdf5c8700c096d5eb38f06e155cb4c","first_computed_at":"2026-07-05T11:53:38.733360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:53:38.733360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mc1ZTkXkCON0yBTySH9EYx7taVNWUwQhlc19pAfOiD73Mn4F67rqsjGeB0UkT7kkxA06ng7sBtCOfe7KICSoBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:53:38.733938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.05334","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf9347634762c19366446f78a829811a8e7141b56d6e0d9f1cfaf4eaafbacad4","sha256:4882a2574fa80c2ed3bf9eb45b71c20633b51575d46d198e4b725b4d6467a895"],"state_sha256":"2f3229b19aba8fd333f1cdb029d47da61d7ceaab44b56c3757c5d40f0bb8f59c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zPp7Ip0djstCGCBoSTNqNhw6q15GmDCeRcc0SdWc/avvPQCZ3wIhnHWV0lMD/PFz2EMslWYSV9M48g7bz3jAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T00:32:41.013282Z","bundle_sha256":"ea8da4011828ba941c2bee3043674a35336180950dd45a7f8e2724cffac48360"}}