{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HFZWCYETJB6NK7KT4YGIIWWW7Y","short_pith_number":"pith:HFZWCYET","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"},"canonical_sha256":"3973616093487cd57d53e60c845ad6fe3b6d7578a2b389e8a218b63536a18a5c","source":{"kind":"arxiv","id":"1306.1345","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1345","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1345v2","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1345","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"pith_short_12","alias_value":"HFZWCYETJB6N","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HFZWCYETJB6NK7KT","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HFZWCYET","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HFZWCYETJB6NK7KT4YGIIWWW7Y","target":"record","payload":{"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"},"canonical_sha256":"3973616093487cd57d53e60c845ad6fe3b6d7578a2b389e8a218b63536a18a5c","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"},"source_kind":"arxiv","source_id":"1306.1345","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:48:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bVwr/lGosNkAVnyCIf2TiZ4Zu3Ox8kF47Sp4fmx5S90XG89CSBOfzRHl/aP3oRbzJfVDm+ERtPhhxsvByQTjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:22:53.522576Z"},"content_sha256":"8a59ba15790dd0fd6f6d11771363c2471156547e252069b70c30b04da5ef4c88","schema_version":"1.0","event_id":"sha256:8a59ba15790dd0fd6f6d11771363c2471156547e252069b70c30b04da5ef4c88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HFZWCYETJB6NK7KT4YGIIWWW7Y","target":"graph","payload":{"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"},"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:48:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ie4BX/1MMDEDpeU4v9+uYuVCR1RT7ewoFdWDOxIcyTOdCvopClSTgqPEf4kWB5eC1td/kktH8iO6xU/q0KACCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:22:53.522947Z"},"content_sha256":"ce0bef4916b09d2b5a0fb82039576345a70d73de007839f3b64cc8c64d5728f9","schema_version":"1.0","event_id":"sha256:ce0bef4916b09d2b5a0fb82039576345a70d73de007839f3b64cc8c64d5728f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/bundle.json","state_url":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/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-28T06:22:53Z","links":{"resolver":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y","bundle":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/bundle.json","state":"https://pith.science/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFZWCYETJB6NK7KT4YGIIWWW7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HFZWCYETJB6NK7KT4YGIIWWW7Y","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":"0d1cf4bc58ec011390a1fd9d41fa8769905a380ba77f378d5bb3e096e7746169","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-06T09:12:31Z","title_canon_sha256":"b197f135e6f301fa854209a02ce52b3d1a36796648808e6f914f4c27d9a59485"},"schema_version":"1.0","source":{"id":"1306.1345","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1345","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1345v2","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1345","created_at":"2026-05-18T02:48:10Z"},{"alias_kind":"pith_short_12","alias_value":"HFZWCYETJB6N","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HFZWCYETJB6NK7KT","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HFZWCYET","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ce0bef4916b09d2b5a0fb82039576345a70d73de007839f3b64cc8c64d5728f9","target":"graph","created_at":"2026-05-18T02:48:10Z","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 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","authors_text":"Binh-Minh Bui-Xuan, Mamadou Moustapha Kant\\'e, Vincent Limouzy","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-06T09:12:31Z","title":"A Note on Graphs of Linear Rank-Width 1"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1345","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:8a59ba15790dd0fd6f6d11771363c2471156547e252069b70c30b04da5ef4c88","target":"record","created_at":"2026-05-18T02:48:10Z","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":"0d1cf4bc58ec011390a1fd9d41fa8769905a380ba77f378d5bb3e096e7746169","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-06T09:12:31Z","title_canon_sha256":"b197f135e6f301fa854209a02ce52b3d1a36796648808e6f914f4c27d9a59485"},"schema_version":"1.0","source":{"id":"1306.1345","kind":"arxiv","version":2}},"canonical_sha256":"3973616093487cd57d53e60c845ad6fe3b6d7578a2b389e8a218b63536a18a5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3973616093487cd57d53e60c845ad6fe3b6d7578a2b389e8a218b63536a18a5c","first_computed_at":"2026-05-18T02:48:10.003119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:10.003119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T5Pox6Uj0qpRm3Lx1j8c8KwKxW54cP2jdFfW2b21Kp8xhnNvaUrBj2MT7KwAe0IfJBNjVbsgPFe11LTcjSEkCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:10.003576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1345","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a59ba15790dd0fd6f6d11771363c2471156547e252069b70c30b04da5ef4c88","sha256:ce0bef4916b09d2b5a0fb82039576345a70d73de007839f3b64cc8c64d5728f9"],"state_sha256":"bfcf56e3e4694dd6581161be619c475ff2dc687e09e226890582c09215931c85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PY7urtoV15FtNV4PGswmgUGGWzp4Sj2IroPlmHy9qUC4o6TCLJM7UGaqip9x+yt9n9BA+4xuOkQpk+za9/pvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:22:53.525095Z","bundle_sha256":"0d91e177b5eb4fcdbd8277aa9b3ace5fb1912f5f92b804ee617ce6a4eb0ce7f4"}}