{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:63C3HTWYNUJZZYEIMDUXUCXZCE","short_pith_number":"pith:63C3HTWY","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"},"canonical_sha256":"f6c5b3ced86d139ce08860e97a0af91136b121c913825fe834f0d1a143def7be","source":{"kind":"arxiv","id":"1508.04718","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04718","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04718v2","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04718","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"63C3HTWYNUJZ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"63C3HTWYNUJZZYEI","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"63C3HTWY","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:63C3HTWYNUJZZYEIMDUXUCXZCE","target":"record","payload":{"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"},"canonical_sha256":"f6c5b3ced86d139ce08860e97a0af91136b121c913825fe834f0d1a143def7be","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"},"source_kind":"arxiv","source_id":"1508.04718","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-18T00:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pd2qDfh2K747SXd48+v5/tG6p2sGgzQT6na1TEYvFwZmCpoHo2AMmK1xMhkJ1yqDRmIpQ+Z3cq1DK4LCVNg7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:58:34.505164Z"},"content_sha256":"78b76e24b7758ebe34637026f66db4451ddf4edac0d969f60ffb6686d55cfbbc","schema_version":"1.0","event_id":"sha256:78b76e24b7758ebe34637026f66db4451ddf4edac0d969f60ffb6686d55cfbbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:63C3HTWYNUJZZYEIMDUXUCXZCE","target":"graph","payload":{"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"},"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-18T00:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YSxmQGCDJn78sROWuWS2yhGaTGR0GLxG4sihth/U7QgYVn5hu8cCSq78y8XmwgC/5dOsjZ+ESdosfnLeVrvWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:58:34.505790Z"},"content_sha256":"3b0c7e14dd2a37e5b3a0998d7d24288c7f5a4553a4a8f341a238c2421174d184","schema_version":"1.0","event_id":"sha256:3b0c7e14dd2a37e5b3a0998d7d24288c7f5a4553a4a8f341a238c2421174d184"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/bundle.json","state_url":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/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-05-28T01:58:34Z","links":{"resolver":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE","bundle":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/bundle.json","state":"https://pith.science/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63C3HTWYNUJZZYEIMDUXUCXZCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:63C3HTWYNUJZZYEIMDUXUCXZCE","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":"2de2aca334cac23e16fcc42fa81dfc1d7b893a7e7272a5164adc4f279ccf0a53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-19T17:48:27Z","title_canon_sha256":"40e366aea1a2cb17bea977ff2d28ee27441dcc60d461ec1d101e5514dce4241d"},"schema_version":"1.0","source":{"id":"1508.04718","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04718","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04718v2","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04718","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"63C3HTWYNUJZ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"63C3HTWYNUJZZYEI","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"63C3HTWY","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:3b0c7e14dd2a37e5b3a0998d7d24288c7f5a4553a4a8f341a238c2421174d184","target":"graph","created_at":"2026-05-18T00:38:04Z","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":"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","authors_text":"Mamadou Moustapha Kant\\'e, O-joung Kwon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-19T17:48:27Z","title":"Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04718","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:78b76e24b7758ebe34637026f66db4451ddf4edac0d969f60ffb6686d55cfbbc","target":"record","created_at":"2026-05-18T00:38:04Z","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":"2de2aca334cac23e16fcc42fa81dfc1d7b893a7e7272a5164adc4f279ccf0a53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-19T17:48:27Z","title_canon_sha256":"40e366aea1a2cb17bea977ff2d28ee27441dcc60d461ec1d101e5514dce4241d"},"schema_version":"1.0","source":{"id":"1508.04718","kind":"arxiv","version":2}},"canonical_sha256":"f6c5b3ced86d139ce08860e97a0af91136b121c913825fe834f0d1a143def7be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6c5b3ced86d139ce08860e97a0af91136b121c913825fe834f0d1a143def7be","first_computed_at":"2026-05-18T00:38:04.615963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:04.615963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HoCGjKARBCA8tdWR090PggZCwXXmDyOaKV8wP0+xeeMCW7ngkEm5ajOqB9CqeZEGqamaJ2QRkY4b8hseM+aoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:04.616599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04718","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78b76e24b7758ebe34637026f66db4451ddf4edac0d969f60ffb6686d55cfbbc","sha256:3b0c7e14dd2a37e5b3a0998d7d24288c7f5a4553a4a8f341a238c2421174d184"],"state_sha256":"8a109f57ca673314f31f8c0ccca92574cd2bb7649da8d273361125dcbe7fa055"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6Y5mCdHK8P59VbdadwDkUgg+rPf4xA1vF8fu6aSMCOMiobGayQCItRU2SEMXvW9pNPWHFhDiKeOu2erkH0+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:58:34.508683Z","bundle_sha256":"a2622d153c61364c94c45295e4d4d80702fa538501fd392c5c73780d9064888c"}}