{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JWDYAHHCESJZEQGLWWFEABZWPQ","short_pith_number":"pith:JWDYAHHC","schema_version":"1.0","canonical_sha256":"4d87801ce224939240cbb58a4007367c2e23e70029a45e9e8c0237cf6cba3051","source":{"kind":"arxiv","id":"2501.00991","version":1},"attestation_state":"computed","paper":{"title":"Twin-width one","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Amadeus Reinald, Christophe Paul, Hugo Jacob, Jungho Ahn, Noleen K\\\"ohler, Sebastian Wiederrecht","submitted_at":"2025-01-02T00:56:11Z","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"},"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":"2501.00991","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-02T00:56:11Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"80e720738122fc1cb05339b8d53355cfaa87cc6f66896f84fcf518efa3f9c7e8","abstract_canon_sha256":"9c8efbce8ba30a066494433df26572b851c4f842dcd076b884882b02022d0bc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:12.882791Z","signature_b64":"6rhA0fws2z0/dANnE/XrlPKcFSI2vHGy88k3KG+mkqVB01l/d0J4EsQvK3jKSw64XZjCDChELLYy7vKh2x79CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d87801ce224939240cbb58a4007367c2e23e70029a45e9e8c0237cf6cba3051","last_reissued_at":"2026-07-05T09:56:12.882323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:12.882323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Twin-width one","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Amadeus Reinald, Christophe Paul, Hugo Jacob, Jungho Ahn, Noleen K\\\"ohler, Sebastian Wiederrecht","submitted_at":"2025-01-02T00:56:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00991","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/2501.00991/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":"2501.00991","created_at":"2026-07-05T09:56:12.882381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.00991v1","created_at":"2026-07-05T09:56:12.882381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00991","created_at":"2026-07-05T09:56:12.882381+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWDYAHHCESJZ","created_at":"2026-07-05T09:56:12.882381+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWDYAHHCESJZEQGL","created_at":"2026-07-05T09:56:12.882381+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWDYAHHC","created_at":"2026-07-05T09:56:12.882381+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21640","citing_title":"The Twin-Width of Graphs of Bounded VC-Dimension","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JWDYAHHCESJZEQGLWWFEABZWPQ","json":"https://pith.science/pith/JWDYAHHCESJZEQGLWWFEABZWPQ.json","graph_json":"https://pith.science/api/pith-number/JWDYAHHCESJZEQGLWWFEABZWPQ/graph.json","events_json":"https://pith.science/api/pith-number/JWDYAHHCESJZEQGLWWFEABZWPQ/events.json","paper":"https://pith.science/paper/JWDYAHHC"},"agent_actions":{"view_html":"https://pith.science/pith/JWDYAHHCESJZEQGLWWFEABZWPQ","download_json":"https://pith.science/pith/JWDYAHHCESJZEQGLWWFEABZWPQ.json","view_paper":"https://pith.science/paper/JWDYAHHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.00991&json=true","fetch_graph":"https://pith.science/api/pith-number/JWDYAHHCESJZEQGLWWFEABZWPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JWDYAHHCESJZEQGLWWFEABZWPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWDYAHHCESJZEQGLWWFEABZWPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWDYAHHCESJZEQGLWWFEABZWPQ/action/storage_attestation","attest_author":"https://pith.science/pith/JWDYAHHCESJZEQGLWWFEABZWPQ/action/author_attestation","sign_citation":"https://pith.science/pith/JWDYAHHCESJZEQGLWWFEABZWPQ/action/citation_signature","submit_replication":"https://pith.science/pith/JWDYAHHCESJZEQGLWWFEABZWPQ/action/replication_record"}},"created_at":"2026-07-05T09:56:12.882381+00:00","updated_at":"2026-07-05T09:56:12.882381+00:00"}