{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JWDYAHHCESJZEQGLWWFEABZWPQ","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":"9c8efbce8ba30a066494433df26572b851c4f842dcd076b884882b02022d0bc6","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-02T00:56:11Z","title_canon_sha256":"80e720738122fc1cb05339b8d53355cfaa87cc6f66896f84fcf518efa3f9c7e8"},"schema_version":"1.0","source":{"id":"2501.00991","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.00991","created_at":"2026-07-05T09:56:12Z"},{"alias_kind":"arxiv_version","alias_value":"2501.00991v1","created_at":"2026-07-05T09:56:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00991","created_at":"2026-07-05T09:56:12Z"},{"alias_kind":"pith_short_12","alias_value":"JWDYAHHCESJZ","created_at":"2026-07-05T09:56:12Z"},{"alias_kind":"pith_short_16","alias_value":"JWDYAHHCESJZEQGL","created_at":"2026-07-05T09:56:12Z"},{"alias_kind":"pith_short_8","alias_value":"JWDYAHHC","created_at":"2026-07-05T09:56:12Z"}],"graph_snapshots":[{"event_id":"sha256:93f423488041bc6d0e73430c7679e52ded1a95889ae3c3a3dcc8b28965fec31e","target":"graph","created_at":"2026-07-05T09:56:12Z","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/2501.00991/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the structure of graphs of twin-width at most $1$, and obtain the following results:\n  - Graphs of twin-width at most $1$ are permutation graphs. In particular they have an intersection model and a linear structure.\n  - There is always a $1$-contraction sequence closely following a given permutation diagram.\n  - Based on a recursive decomposition theorem, we obtain a simple algorithm running in linear time that produces a $1$-contraction sequence of a graph, or guarantees that it has twin-width more than $1$.\n  - We characterise distance-hereditary graphs based on their twin-wid","authors_text":"Amadeus Reinald, Christophe Paul, Hugo Jacob, Jungho Ahn, Noleen K\\\"ohler, Sebastian Wiederrecht","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-02T00:56:11Z","title":"Twin-width one"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00991","kind":"arxiv","version":1},"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:0044c6306e9b39a7c04c77c30f0b9e323bd136ae4ad6b67e78a3c1a07e39911d","target":"record","created_at":"2026-07-05T09:56:12Z","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":"9c8efbce8ba30a066494433df26572b851c4f842dcd076b884882b02022d0bc6","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-02T00:56:11Z","title_canon_sha256":"80e720738122fc1cb05339b8d53355cfaa87cc6f66896f84fcf518efa3f9c7e8"},"schema_version":"1.0","source":{"id":"2501.00991","kind":"arxiv","version":1}},"canonical_sha256":"4d87801ce224939240cbb58a4007367c2e23e70029a45e9e8c0237cf6cba3051","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d87801ce224939240cbb58a4007367c2e23e70029a45e9e8c0237cf6cba3051","first_computed_at":"2026-07-05T09:56:12.882323Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:56:12.882323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6rhA0fws2z0/dANnE/XrlPKcFSI2vHGy88k3KG+mkqVB01l/d0J4EsQvK3jKSw64XZjCDChELLYy7vKh2x79CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:56:12.882791Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.00991","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0044c6306e9b39a7c04c77c30f0b9e323bd136ae4ad6b67e78a3c1a07e39911d","sha256:93f423488041bc6d0e73430c7679e52ded1a95889ae3c3a3dcc8b28965fec31e"],"state_sha256":"67e183450e4a61b93f5b15aecf7ec24209cc5b7a1b4d22fd148c9b243d5c8c90"}