{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QLPHNVOYRL3NBROXD5FR7ZBJME","short_pith_number":"pith:QLPHNVOY","schema_version":"1.0","canonical_sha256":"82de76d5d88af6d0c5d71f4b1fe42961136f1c69cbd739e25b831517f90910f1","source":{"kind":"arxiv","id":"1601.03800","version":2},"attestation_state":"computed","paper":{"title":"Rank-width: Algorithmic and structural results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Sang-il Oum","submitted_at":"2016-01-15T02:37:52Z","abstract_excerpt":"Rank-width is a width parameter of graphs describing whether it is possible to decompose a graph into a tree-like structure by `simple' cuts. This survey aims to summarize known algorithmic and structural results on rank-width of graphs."},"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":"1601.03800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-15T02:37:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"732bb0705ddc4cb2db8e99cb57933a5f9472b2b75135573094d1129dc13c6069","abstract_canon_sha256":"77529e222239860fdbdf9a92056481fd54489dd4c439ed7aa50aab46e2a0c0f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:03.359762Z","signature_b64":"v2kDe/P52nN9cB/ylyc850pUlCyB3fvn9r5L+V6Ftsj9QKrx+Pgg2VyXo/YHcvBOSX8oJDz0o2KnRKZVR02DBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82de76d5d88af6d0c5d71f4b1fe42961136f1c69cbd739e25b831517f90910f1","last_reissued_at":"2026-05-18T00:16:03.359359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:03.359359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank-width: Algorithmic and structural results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Sang-il Oum","submitted_at":"2016-01-15T02:37:52Z","abstract_excerpt":"Rank-width is a width parameter of graphs describing whether it is possible to decompose a graph into a tree-like structure by `simple' cuts. This survey aims to summarize known algorithmic and structural results on rank-width of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03800","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":"1601.03800","created_at":"2026-05-18T00:16:03.359424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03800v2","created_at":"2026-05-18T00:16:03.359424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03800","created_at":"2026-05-18T00:16:03.359424+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLPHNVOYRL3N","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLPHNVOYRL3NBROX","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLPHNVOY","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.08847","citing_title":"The Structure of Circle Graph States","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QLPHNVOYRL3NBROXD5FR7ZBJME","json":"https://pith.science/pith/QLPHNVOYRL3NBROXD5FR7ZBJME.json","graph_json":"https://pith.science/api/pith-number/QLPHNVOYRL3NBROXD5FR7ZBJME/graph.json","events_json":"https://pith.science/api/pith-number/QLPHNVOYRL3NBROXD5FR7ZBJME/events.json","paper":"https://pith.science/paper/QLPHNVOY"},"agent_actions":{"view_html":"https://pith.science/pith/QLPHNVOYRL3NBROXD5FR7ZBJME","download_json":"https://pith.science/pith/QLPHNVOYRL3NBROXD5FR7ZBJME.json","view_paper":"https://pith.science/paper/QLPHNVOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03800&json=true","fetch_graph":"https://pith.science/api/pith-number/QLPHNVOYRL3NBROXD5FR7ZBJME/graph.json","fetch_events":"https://pith.science/api/pith-number/QLPHNVOYRL3NBROXD5FR7ZBJME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLPHNVOYRL3NBROXD5FR7ZBJME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLPHNVOYRL3NBROXD5FR7ZBJME/action/storage_attestation","attest_author":"https://pith.science/pith/QLPHNVOYRL3NBROXD5FR7ZBJME/action/author_attestation","sign_citation":"https://pith.science/pith/QLPHNVOYRL3NBROXD5FR7ZBJME/action/citation_signature","submit_replication":"https://pith.science/pith/QLPHNVOYRL3NBROXD5FR7ZBJME/action/replication_record"}},"created_at":"2026-05-18T00:16:03.359424+00:00","updated_at":"2026-05-18T00:16:03.359424+00:00"}