{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Q7YFKOGNY5IC5BT7ZPGD6OSGLF","short_pith_number":"pith:Q7YFKOGN","schema_version":"1.0","canonical_sha256":"87f05538cdc7502e867fcbcc3f3a465955c9ae07e8b1e12a70b3b824c3ba6605","source":{"kind":"arxiv","id":"1403.1081","version":3},"attestation_state":"computed","paper":{"title":"Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Isolde Adler, Mamadou Moustapha Kant\\'e, O-joung Kwon","submitted_at":"2014-03-05T11:27:38Z","abstract_excerpt":"Linear rank-width is a linearized variation of rank-width, and it is deeply related to matroid path-width. In this paper, we show that the linear rank-width of every $n$-vertex distance-hereditary graph, equivalently a graph of rank-width at most $1$, can be computed in time $\\mathcal{O}(n^2\\cdot \\log_2 n)$, and a linear layout witnessing the linear rank-width can be computed with the same time complexity. As a corollary, we show that the path-width of every $n$-element matroid of branch-width at most $2$ can be computed in time $\\mathcal{O}(n^2\\cdot \\log_2 n)$, provided that the matroid is gi"},"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":"1403.1081","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T11:27:38Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"ca9f6e0c6570ce0acd74da72654006ee125bac2d92b123c85a95e4c262f3949f","abstract_canon_sha256":"87d20d18faa7b57cdfc7695ca5a620995a945487521df9a659f68aa51f56c101"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:59.371522Z","signature_b64":"OxR5UnoP64vfPywheta8vMzv8PvN8AQMqIh2zXSaa3Af9KBroFoURa9p0VilFHZc91x9foZ9dzCtny+ZUnLjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87f05538cdc7502e867fcbcc3f3a465955c9ae07e8b1e12a70b3b824c3ba6605","last_reissued_at":"2026-05-18T01:34:59.370824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:59.370824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Isolde Adler, Mamadou Moustapha Kant\\'e, O-joung Kwon","submitted_at":"2014-03-05T11:27:38Z","abstract_excerpt":"Linear rank-width is a linearized variation of rank-width, and it is deeply related to matroid path-width. In this paper, we show that the linear rank-width of every $n$-vertex distance-hereditary graph, equivalently a graph of rank-width at most $1$, can be computed in time $\\mathcal{O}(n^2\\cdot \\log_2 n)$, and a linear layout witnessing the linear rank-width can be computed with the same time complexity. As a corollary, we show that the path-width of every $n$-element matroid of branch-width at most $2$ can be computed in time $\\mathcal{O}(n^2\\cdot \\log_2 n)$, provided that the matroid is gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1081","kind":"arxiv","version":3},"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":"1403.1081","created_at":"2026-05-18T01:34:59.370930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1081v3","created_at":"2026-05-18T01:34:59.370930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1081","created_at":"2026-05-18T01:34:59.370930+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7YFKOGNY5IC","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7YFKOGNY5IC5BT7","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7YFKOGN","created_at":"2026-05-18T12:28:43.426989+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/Q7YFKOGNY5IC5BT7ZPGD6OSGLF","json":"https://pith.science/pith/Q7YFKOGNY5IC5BT7ZPGD6OSGLF.json","graph_json":"https://pith.science/api/pith-number/Q7YFKOGNY5IC5BT7ZPGD6OSGLF/graph.json","events_json":"https://pith.science/api/pith-number/Q7YFKOGNY5IC5BT7ZPGD6OSGLF/events.json","paper":"https://pith.science/paper/Q7YFKOGN"},"agent_actions":{"view_html":"https://pith.science/pith/Q7YFKOGNY5IC5BT7ZPGD6OSGLF","download_json":"https://pith.science/pith/Q7YFKOGNY5IC5BT7ZPGD6OSGLF.json","view_paper":"https://pith.science/paper/Q7YFKOGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1081&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7YFKOGNY5IC5BT7ZPGD6OSGLF/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7YFKOGNY5IC5BT7ZPGD6OSGLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7YFKOGNY5IC5BT7ZPGD6OSGLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7YFKOGNY5IC5BT7ZPGD6OSGLF/action/storage_attestation","attest_author":"https://pith.science/pith/Q7YFKOGNY5IC5BT7ZPGD6OSGLF/action/author_attestation","sign_citation":"https://pith.science/pith/Q7YFKOGNY5IC5BT7ZPGD6OSGLF/action/citation_signature","submit_replication":"https://pith.science/pith/Q7YFKOGNY5IC5BT7ZPGD6OSGLF/action/replication_record"}},"created_at":"2026-05-18T01:34:59.370930+00:00","updated_at":"2026-05-18T01:34:59.370930+00:00"}