{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IQ24525MG7RAAIFKRHKQROIXDA","short_pith_number":"pith:IQ24525M","canonical_record":{"source":{"id":"1203.3606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-16T02:53:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"aa1a08c86d34fd2fa11329a91b8b404aad3d2b261a51aac0ad4b5105a005a2c3","abstract_canon_sha256":"0e125b62785e6c4a66d5f7c137aae220ecc202e528437f73e21cd4c3f0d49f4a"},"schema_version":"1.0"},"canonical_sha256":"4435ceebac37e20020aa89d508b9171814650953b2d94a6ff6ec6e722f94c9bb","source":{"kind":"arxiv","id":"1203.3606","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3606","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3606v2","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3606","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"IQ24525MG7RA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IQ24525MG7RAAIFK","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IQ24525M","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IQ24525MG7RAAIFKRHKQROIXDA","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3606","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-16T02:53:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"aa1a08c86d34fd2fa11329a91b8b404aad3d2b261a51aac0ad4b5105a005a2c3","abstract_canon_sha256":"0e125b62785e6c4a66d5f7c137aae220ecc202e528437f73e21cd4c3f0d49f4a"},"schema_version":"1.0"},"canonical_sha256":"4435ceebac37e20020aa89d508b9171814650953b2d94a6ff6ec6e722f94c9bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:39.452329Z","signature_b64":"dlwkH2Krv4Ia+lm6N7kQHNw9mbUFRq7TkljxDnfQgI8YdG5wa5FOC83y0XTyfgKYdeeCWJiUH7MgtARNxGqMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4435ceebac37e20020aa89d508b9171814650953b2d94a6ff6ec6e722f94c9bb","last_reissued_at":"2026-05-18T02:55:39.451542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:39.451542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3606","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-05-18T02:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLf0kIgASFowE/Z3ig2biS4qDoF905mA9zzZAVVHRI58LabPo3LJG8/K8aylhFsqaAk888JLZMwBlNum9oG7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:55:43.466273Z"},"content_sha256":"fd733d5a58eb7c7facfc6dfbc7c9ce11b035770c9f1e144d18d6a11f132e941b","schema_version":"1.0","event_id":"sha256:fd733d5a58eb7c7facfc6dfbc7c9ce11b035770c9f1e144d18d6a11f132e941b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IQ24525MG7RAAIFKRHKQROIXDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"O-joung Kwon, Sang-il Oum","submitted_at":"2012-03-16T02:53:22Z","abstract_excerpt":"We prove that every graph of rank-width $k$ is a pivot-minor of a graph of tree-width at most $2k$. We also prove that graphs of rank-width at most 1, equivalently distance-hereditary graphs, are exactly vertex-minors of trees, and graphs of linear rank-width at most 1 are precisely vertex-minors of paths. In addition, we show that bipartite graphs of rank-width at most 1 are exactly pivot-minors of trees and bipartite graphs of linear rank-width at most 1 are precisely pivot-minors of paths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3606","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":""},"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-05-18T02:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWAmie5YudHzyxGgKMhmAB8DVkARzr8sm1spZDVh5yF2sxJFONsBt60OkhB3sadL5Ui5Z6NMZ/BfOr/4huUBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:55:43.466960Z"},"content_sha256":"9c52224c571f86aafb0e3d0cbfc80e50d4c77d82abb6ee4f818fa3d6b555e765","schema_version":"1.0","event_id":"sha256:9c52224c571f86aafb0e3d0cbfc80e50d4c77d82abb6ee4f818fa3d6b555e765"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA/bundle.json","state_url":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQ24525MG7RAAIFKRHKQROIXDA/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-10T22:55:43Z","links":{"resolver":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA","bundle":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA/bundle.json","state":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQ24525MG7RAAIFKRHKQROIXDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IQ24525MG7RAAIFKRHKQROIXDA","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":"0e125b62785e6c4a66d5f7c137aae220ecc202e528437f73e21cd4c3f0d49f4a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-16T02:53:22Z","title_canon_sha256":"aa1a08c86d34fd2fa11329a91b8b404aad3d2b261a51aac0ad4b5105a005a2c3"},"schema_version":"1.0","source":{"id":"1203.3606","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3606","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3606v2","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3606","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"IQ24525MG7RA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IQ24525MG7RAAIFK","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IQ24525M","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:9c52224c571f86aafb0e3d0cbfc80e50d4c77d82abb6ee4f818fa3d6b555e765","target":"graph","created_at":"2026-05-18T02:55:39Z","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"},"paper":{"abstract_excerpt":"We prove that every graph of rank-width $k$ is a pivot-minor of a graph of tree-width at most $2k$. We also prove that graphs of rank-width at most 1, equivalently distance-hereditary graphs, are exactly vertex-minors of trees, and graphs of linear rank-width at most 1 are precisely vertex-minors of paths. In addition, we show that bipartite graphs of rank-width at most 1 are exactly pivot-minors of trees and bipartite graphs of linear rank-width at most 1 are precisely pivot-minors of paths.","authors_text":"O-joung Kwon, Sang-il Oum","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-16T02:53:22Z","title":"Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3606","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:fd733d5a58eb7c7facfc6dfbc7c9ce11b035770c9f1e144d18d6a11f132e941b","target":"record","created_at":"2026-05-18T02:55:39Z","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":"0e125b62785e6c4a66d5f7c137aae220ecc202e528437f73e21cd4c3f0d49f4a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-16T02:53:22Z","title_canon_sha256":"aa1a08c86d34fd2fa11329a91b8b404aad3d2b261a51aac0ad4b5105a005a2c3"},"schema_version":"1.0","source":{"id":"1203.3606","kind":"arxiv","version":2}},"canonical_sha256":"4435ceebac37e20020aa89d508b9171814650953b2d94a6ff6ec6e722f94c9bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4435ceebac37e20020aa89d508b9171814650953b2d94a6ff6ec6e722f94c9bb","first_computed_at":"2026-05-18T02:55:39.451542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:39.451542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dlwkH2Krv4Ia+lm6N7kQHNw9mbUFRq7TkljxDnfQgI8YdG5wa5FOC83y0XTyfgKYdeeCWJiUH7MgtARNxGqMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:39.452329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3606","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd733d5a58eb7c7facfc6dfbc7c9ce11b035770c9f1e144d18d6a11f132e941b","sha256:9c52224c571f86aafb0e3d0cbfc80e50d4c77d82abb6ee4f818fa3d6b555e765"],"state_sha256":"e721906b16c2229dd99158c7dd23c0a1ee86144f46d30bb10d2c887e92786741"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vR5Phy6UwaHM60gROLtepRPW1O57m5MDVSEN13wkcQv1XK6DiCc6ugMOb1FR125E44QZFFVBPp+Q2cMy2RGFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:55:43.470584Z","bundle_sha256":"0f049fbd657673f2a406238dfc5e88f3e6ea7433256da535bf7fac4e4bb16275"}}