{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ME2TSSIIRQT3UNHKUUNICCIPRP","short_pith_number":"pith:ME2TSSII","schema_version":"1.0","canonical_sha256":"61353949088c27ba34eaa51a81090f8bd606fc68b8cdae24fcd7873c388a0d58","source":{"kind":"arxiv","id":"2606.20331","version":1},"attestation_state":"computed","paper":{"title":"Computing Twin-Width via Treedepth and Vertex Integrity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mathis Rocton, Robert Ganian","submitted_at":"2026-06-18T15:04:39Z","abstract_excerpt":"Twin-width is a graph parameter that has become central to explaining the fixed-parameter tractability of first-order model checking across many graph classes. Despite its algorithmic importance, computing twin-width remains poorly understood: even recognizing graphs of twin-width at most four is NP-hard, and no fixed-parameter approximations parameterized by twin-width itself are known. A recent approach towards breaking this barrier focuses on first developing fixed-parameter algorithms for computing or approximating twin-width under parameterizations distinct from twin-width.\n  Our first re"},"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":"2606.20331","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-18T15:04:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d162517740b909a027f39e50b99f2ab0fa160387720e177ebf0994eb6021cba5","abstract_canon_sha256":"a3b9bb884e67db4a816e268ca5072ad3a48d6b30c6dd2bbaa0314dd81473ec3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:09.109428Z","signature_b64":"JU07/vxxDxDy+DCaSuAciB3qm1CRrLLGZT5NlGESf82MAtKcQv8sYi8FHeT3rGA+qpd2FoLeD9cRwo+/R2YbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61353949088c27ba34eaa51a81090f8bd606fc68b8cdae24fcd7873c388a0d58","last_reissued_at":"2026-06-19T16:13:09.109065Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:09.109065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Twin-Width via Treedepth and Vertex Integrity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mathis Rocton, Robert Ganian","submitted_at":"2026-06-18T15:04:39Z","abstract_excerpt":"Twin-width is a graph parameter that has become central to explaining the fixed-parameter tractability of first-order model checking across many graph classes. Despite its algorithmic importance, computing twin-width remains poorly understood: even recognizing graphs of twin-width at most four is NP-hard, and no fixed-parameter approximations parameterized by twin-width itself are known. A recent approach towards breaking this barrier focuses on first developing fixed-parameter algorithms for computing or approximating twin-width under parameterizations distinct from twin-width.\n  Our first re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20331","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/2606.20331/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":"2606.20331","created_at":"2026-06-19T16:13:09.109129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.20331v1","created_at":"2026-06-19T16:13:09.109129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20331","created_at":"2026-06-19T16:13:09.109129+00:00"},{"alias_kind":"pith_short_12","alias_value":"ME2TSSIIRQT3","created_at":"2026-06-19T16:13:09.109129+00:00"},{"alias_kind":"pith_short_16","alias_value":"ME2TSSIIRQT3UNHK","created_at":"2026-06-19T16:13:09.109129+00:00"},{"alias_kind":"pith_short_8","alias_value":"ME2TSSII","created_at":"2026-06-19T16:13:09.109129+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP","json":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP.json","graph_json":"https://pith.science/api/pith-number/ME2TSSIIRQT3UNHKUUNICCIPRP/graph.json","events_json":"https://pith.science/api/pith-number/ME2TSSIIRQT3UNHKUUNICCIPRP/events.json","paper":"https://pith.science/paper/ME2TSSII"},"agent_actions":{"view_html":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP","download_json":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP.json","view_paper":"https://pith.science/paper/ME2TSSII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.20331&json=true","fetch_graph":"https://pith.science/api/pith-number/ME2TSSIIRQT3UNHKUUNICCIPRP/graph.json","fetch_events":"https://pith.science/api/pith-number/ME2TSSIIRQT3UNHKUUNICCIPRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/action/storage_attestation","attest_author":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/action/author_attestation","sign_citation":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/action/citation_signature","submit_replication":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/action/replication_record"}},"created_at":"2026-06-19T16:13:09.109129+00:00","updated_at":"2026-06-19T16:13:09.109129+00:00"}