{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:63C3HTWYNUJZZYEIMDUXUCXZCE","short_pith_number":"pith:63C3HTWY","schema_version":"1.0","canonical_sha256":"f6c5b3ced86d139ce08860e97a0af91136b121c913825fe834f0d1a143def7be","source":{"kind":"arxiv","id":"1508.04718","version":2},"attestation_state":"computed","paper":{"title":"Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mamadou Moustapha Kant\\'e, O-joung Kwon","submitted_at":"2015-08-19T17:48:27Z","abstract_excerpt":"In the companion paper [Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm, Algorithmica 78(1):342--377, 2017], we presented a characterization of the linear rank-width of distance-hereditary graphs, from which we derived an algorithm to compute it in polynomial time. In this paper, we investigate structural properties of distance-hereditary graphs based on this characterization.\n  First, we prove that for a fixed tree $T$, every distance-hereditary graph of sufficiently large linear rank-width contains a vertex-minor isomorphic to $T$. We extend this property to bi"},"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":"1508.04718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-19T17:48:27Z","cross_cats_sorted":[],"title_canon_sha256":"40e366aea1a2cb17bea977ff2d28ee27441dcc60d461ec1d101e5514dce4241d","abstract_canon_sha256":"2de2aca334cac23e16fcc42fa81dfc1d7b893a7e7272a5164adc4f279ccf0a53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:04.616599Z","signature_b64":"HoCGjKARBCA8tdWR090PggZCwXXmDyOaKV8wP0+xeeMCW7ngkEm5ajOqB9CqeZEGqamaJ2QRkY4b8hseM+aoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6c5b3ced86d139ce08860e97a0af91136b121c913825fe834f0d1a143def7be","last_reissued_at":"2026-05-18T00:38:04.615963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:04.615963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mamadou Moustapha Kant\\'e, O-joung Kwon","submitted_at":"2015-08-19T17:48:27Z","abstract_excerpt":"In the companion paper [Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm, Algorithmica 78(1):342--377, 2017], we presented a characterization of the linear rank-width of distance-hereditary graphs, from which we derived an algorithm to compute it in polynomial time. In this paper, we investigate structural properties of distance-hereditary graphs based on this characterization.\n  First, we prove that for a fixed tree $T$, every distance-hereditary graph of sufficiently large linear rank-width contains a vertex-minor isomorphic to $T$. We extend this property to bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04718","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":"1508.04718","created_at":"2026-05-18T00:38:04.616057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04718v2","created_at":"2026-05-18T00:38:04.616057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04718","created_at":"2026-05-18T00:38:04.616057+00:00"},{"alias_kind":"pith_short_12","alias_value":"63C3HTWYNUJZ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"63C3HTWYNUJZZYEI","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"63C3HTWY","created_at":"2026-05-18T12:29:07.941421+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/63C3HTWYNUJZZYEIMDUXUCXZCE","json":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE.json","graph_json":"https://pith.science/api/pith-number/63C3HTWYNUJZZYEIMDUXUCXZCE/graph.json","events_json":"https://pith.science/api/pith-number/63C3HTWYNUJZZYEIMDUXUCXZCE/events.json","paper":"https://pith.science/paper/63C3HTWY"},"agent_actions":{"view_html":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE","download_json":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE.json","view_paper":"https://pith.science/paper/63C3HTWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04718&json=true","fetch_graph":"https://pith.science/api/pith-number/63C3HTWYNUJZZYEIMDUXUCXZCE/graph.json","fetch_events":"https://pith.science/api/pith-number/63C3HTWYNUJZZYEIMDUXUCXZCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/action/storage_attestation","attest_author":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/action/author_attestation","sign_citation":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/action/citation_signature","submit_replication":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/action/replication_record"}},"created_at":"2026-05-18T00:38:04.616057+00:00","updated_at":"2026-05-18T00:38:04.616057+00:00"}