{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ME2TSSIIRQT3UNHKUUNICCIPRP","short_pith_number":"pith:ME2TSSII","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"},"canonical_sha256":"61353949088c27ba34eaa51a81090f8bd606fc68b8cdae24fcd7873c388a0d58","source":{"kind":"arxiv","id":"2606.20331","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20331","created_at":"2026-06-19T16:13:09Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20331v1","created_at":"2026-06-19T16:13:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20331","created_at":"2026-06-19T16:13:09Z"},{"alias_kind":"pith_short_12","alias_value":"ME2TSSIIRQT3","created_at":"2026-06-19T16:13:09Z"},{"alias_kind":"pith_short_16","alias_value":"ME2TSSIIRQT3UNHK","created_at":"2026-06-19T16:13:09Z"},{"alias_kind":"pith_short_8","alias_value":"ME2TSSII","created_at":"2026-06-19T16:13:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ME2TSSIIRQT3UNHKUUNICCIPRP","target":"record","payload":{"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"},"canonical_sha256":"61353949088c27ba34eaa51a81090f8bd606fc68b8cdae24fcd7873c388a0d58","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"},"source_kind":"arxiv","source_id":"2606.20331","source_version":1,"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-06-19T16:13:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YsJV8r2ZDKFc32x8175FV3zgV6ARPjfbbXAXsGeOAidYREbudllCRSg487KKFodjqa+T4EaI1Vf2GhpzfEyrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:01:34.688814Z"},"content_sha256":"3e38dcf4b757bbdb2804ca208004c18f9810172d956130449bc455d796ce1134","schema_version":"1.0","event_id":"sha256:3e38dcf4b757bbdb2804ca208004c18f9810172d956130449bc455d796ce1134"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ME2TSSIIRQT3UNHKUUNICCIPRP","target":"graph","payload":{"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"},"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-06-19T16:13:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iez5Si6/kL11iPZW+66Rbitvoj0lnujXMlCUphpp3CDLFwWA+o09dKePMnpkqxQR4d0bYiRN9UwE6sFWF0sfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:01:34.689180Z"},"content_sha256":"71fac20a933c36a131f4afdac86b48b80265e8841d905e63a8ecc3f5af630871","schema_version":"1.0","event_id":"sha256:71fac20a933c36a131f4afdac86b48b80265e8841d905e63a8ecc3f5af630871"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/bundle.json","state_url":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/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-06-27T17:01:34Z","links":{"resolver":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP","bundle":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/bundle.json","state":"https://pith.science/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ME2TSSIIRQT3UNHKUUNICCIPRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ME2TSSIIRQT3UNHKUUNICCIPRP","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":"a3b9bb884e67db4a816e268ca5072ad3a48d6b30c6dd2bbaa0314dd81473ec3f","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-18T15:04:39Z","title_canon_sha256":"d162517740b909a027f39e50b99f2ab0fa160387720e177ebf0994eb6021cba5"},"schema_version":"1.0","source":{"id":"2606.20331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20331","created_at":"2026-06-19T16:13:09Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20331v1","created_at":"2026-06-19T16:13:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20331","created_at":"2026-06-19T16:13:09Z"},{"alias_kind":"pith_short_12","alias_value":"ME2TSSIIRQT3","created_at":"2026-06-19T16:13:09Z"},{"alias_kind":"pith_short_16","alias_value":"ME2TSSIIRQT3UNHK","created_at":"2026-06-19T16:13:09Z"},{"alias_kind":"pith_short_8","alias_value":"ME2TSSII","created_at":"2026-06-19T16:13:09Z"}],"graph_snapshots":[{"event_id":"sha256:71fac20a933c36a131f4afdac86b48b80265e8841d905e63a8ecc3f5af630871","target":"graph","created_at":"2026-06-19T16:13:09Z","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/2606.20331/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mathis Rocton, Robert Ganian","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-18T15:04:39Z","title":"Computing Twin-Width via Treedepth and Vertex Integrity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20331","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:3e38dcf4b757bbdb2804ca208004c18f9810172d956130449bc455d796ce1134","target":"record","created_at":"2026-06-19T16:13:09Z","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":"a3b9bb884e67db4a816e268ca5072ad3a48d6b30c6dd2bbaa0314dd81473ec3f","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-18T15:04:39Z","title_canon_sha256":"d162517740b909a027f39e50b99f2ab0fa160387720e177ebf0994eb6021cba5"},"schema_version":"1.0","source":{"id":"2606.20331","kind":"arxiv","version":1}},"canonical_sha256":"61353949088c27ba34eaa51a81090f8bd606fc68b8cdae24fcd7873c388a0d58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61353949088c27ba34eaa51a81090f8bd606fc68b8cdae24fcd7873c388a0d58","first_computed_at":"2026-06-19T16:13:09.109065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:13:09.109065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JU07/vxxDxDy+DCaSuAciB3qm1CRrLLGZT5NlGESf82MAtKcQv8sYi8FHeT3rGA+qpd2FoLeD9cRwo+/R2YbCA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:13:09.109428Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.20331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e38dcf4b757bbdb2804ca208004c18f9810172d956130449bc455d796ce1134","sha256:71fac20a933c36a131f4afdac86b48b80265e8841d905e63a8ecc3f5af630871"],"state_sha256":"60b0e9f4f0cd1bc57dd10910f9a1c533d9bd5883c4d2c0252ca994d98bd614c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixL/r1gIoCeX/ypv7mYtRxAf3lCKdZDtD87IqoHQiXgHUM0l18dZRwGIWBDAZocjwDcg2tvA0XE/hr+K5V7lDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:01:34.691067Z","bundle_sha256":"baf4f06ece031e9153bd31fe6d4f9e0f4715229bec160890e44eded48fe6837e"}}