{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IQ24525MG7RAAIFKRHKQROIXDA","short_pith_number":"pith:IQ24525M","schema_version":"1.0","canonical_sha256":"4435ceebac37e20020aa89d508b9171814650953b2d94a6ff6ec6e722f94c9bb","source":{"kind":"arxiv","id":"1203.3606","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.3606","created_at":"2026-05-18T02:55:39.451688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3606v2","created_at":"2026-05-18T02:55:39.451688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3606","created_at":"2026-05-18T02:55:39.451688+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQ24525MG7RA","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQ24525MG7RAAIFK","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQ24525M","created_at":"2026-05-18T12:27:09.501522+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/IQ24525MG7RAAIFKRHKQROIXDA","json":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA.json","graph_json":"https://pith.science/api/pith-number/IQ24525MG7RAAIFKRHKQROIXDA/graph.json","events_json":"https://pith.science/api/pith-number/IQ24525MG7RAAIFKRHKQROIXDA/events.json","paper":"https://pith.science/paper/IQ24525M"},"agent_actions":{"view_html":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA","download_json":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA.json","view_paper":"https://pith.science/paper/IQ24525M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3606&json=true","fetch_graph":"https://pith.science/api/pith-number/IQ24525MG7RAAIFKRHKQROIXDA/graph.json","fetch_events":"https://pith.science/api/pith-number/IQ24525MG7RAAIFKRHKQROIXDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA/action/storage_attestation","attest_author":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA/action/author_attestation","sign_citation":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA/action/citation_signature","submit_replication":"https://pith.science/pith/IQ24525MG7RAAIFKRHKQROIXDA/action/replication_record"}},"created_at":"2026-05-18T02:55:39.451688+00:00","updated_at":"2026-05-18T02:55:39.451688+00:00"}