{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HFZWCYETJB6NK7KT4YGIIWWW7Y","short_pith_number":"pith:HFZWCYET","schema_version":"1.0","canonical_sha256":"3973616093487cd57d53e60c845ad6fe3b6d7578a2b389e8a218b63536a18a5c","source":{"kind":"arxiv","id":"1306.1345","version":2},"attestation_state":"computed","paper":{"title":"A Note on Graphs of Linear Rank-Width 1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Binh-Minh Bui-Xuan, Mamadou Moustapha Kant\\'e, Vincent Limouzy","submitted_at":"2013-06-06T09:12:31Z","abstract_excerpt":"We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is that one can decide in linear time whether a graph has linear rank-width at most 1, and give an obstruction if not. Other immediate consequences are several characterisations of graphs of linear rank-width 1. In particular a connected graph has linear rank-width 1 if and only if it is locally equivalent to a caterpillar if and only if it is a vertex-minor of a path [O-joung Kwon and Sang-il Oum, Graphs of small rank-wid"},"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":"1306.1345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-06T09:12:31Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"b197f135e6f301fa854209a02ce52b3d1a36796648808e6f914f4c27d9a59485","abstract_canon_sha256":"0d1cf4bc58ec011390a1fd9d41fa8769905a380ba77f378d5bb3e096e7746169"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:10.003576Z","signature_b64":"T5Pox6Uj0qpRm3Lx1j8c8KwKxW54cP2jdFfW2b21Kp8xhnNvaUrBj2MT7KwAe0IfJBNjVbsgPFe11LTcjSEkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3973616093487cd57d53e60c845ad6fe3b6d7578a2b389e8a218b63536a18a5c","last_reissued_at":"2026-05-18T02:48:10.003119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:10.003119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Graphs of Linear Rank-Width 1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Binh-Minh Bui-Xuan, Mamadou Moustapha Kant\\'e, Vincent Limouzy","submitted_at":"2013-06-06T09:12:31Z","abstract_excerpt":"We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is that one can decide in linear time whether a graph has linear rank-width at most 1, and give an obstruction if not. Other immediate consequences are several characterisations of graphs of linear rank-width 1. In particular a connected graph has linear rank-width 1 if and only if it is locally equivalent to a caterpillar if and only if it is a vertex-minor of a path [O-joung Kwon and Sang-il Oum, Graphs of small rank-wid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1345","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":"1306.1345","created_at":"2026-05-18T02:48:10.003185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1345v2","created_at":"2026-05-18T02:48:10.003185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1345","created_at":"2026-05-18T02:48:10.003185+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFZWCYETJB6N","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFZWCYETJB6NK7KT","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFZWCYET","created_at":"2026-05-18T12:27:46.883200+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/HFZWCYETJB6NK7KT4YGIIWWW7Y","json":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y.json","graph_json":"https://pith.science/api/pith-number/HFZWCYETJB6NK7KT4YGIIWWW7Y/graph.json","events_json":"https://pith.science/api/pith-number/HFZWCYETJB6NK7KT4YGIIWWW7Y/events.json","paper":"https://pith.science/paper/HFZWCYET"},"agent_actions":{"view_html":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y","download_json":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y.json","view_paper":"https://pith.science/paper/HFZWCYET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1345&json=true","fetch_graph":"https://pith.science/api/pith-number/HFZWCYETJB6NK7KT4YGIIWWW7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/HFZWCYETJB6NK7KT4YGIIWWW7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/action/storage_attestation","attest_author":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/action/author_attestation","sign_citation":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/action/citation_signature","submit_replication":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/action/replication_record"}},"created_at":"2026-05-18T02:48:10.003185+00:00","updated_at":"2026-05-18T02:48:10.003185+00:00"}