{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LURBG3QQI2EPS6LYLOGH3GSHGG","short_pith_number":"pith:LURBG3QQ","canonical_record":{"source":{"id":"1001.0461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-04T08:59:46Z","cross_cats_sorted":[],"title_canon_sha256":"3fed732465536e8cc1a281b6c992453461703e05afac32eca3ccfb18baac2586","abstract_canon_sha256":"31129f9c549d3813a2e0331b284ff1f3a5566ef76d27994dfee87d68cbc40a94"},"schema_version":"1.0"},"canonical_sha256":"5d22136e104688f979785b8c7d9a47319ffa84cd310a631140bf306cd9e6666d","source":{"kind":"arxiv","id":"1001.0461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0461","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0461v1","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0461","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"LURBG3QQI2EP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LURBG3QQI2EPS6LY","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LURBG3QQ","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LURBG3QQI2EPS6LYLOGH3GSHGG","target":"record","payload":{"canonical_record":{"source":{"id":"1001.0461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-04T08:59:46Z","cross_cats_sorted":[],"title_canon_sha256":"3fed732465536e8cc1a281b6c992453461703e05afac32eca3ccfb18baac2586","abstract_canon_sha256":"31129f9c549d3813a2e0331b284ff1f3a5566ef76d27994dfee87d68cbc40a94"},"schema_version":"1.0"},"canonical_sha256":"5d22136e104688f979785b8c7d9a47319ffa84cd310a631140bf306cd9e6666d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:39.652025Z","signature_b64":"fjBZ+/YkScX/3MttJHzh7QHBe8NTECW/CawvrGcOFVjA9UJbsBLQJKqy9QX7GoHMKjUKyO2dAg0ucM9lxoL8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d22136e104688f979785b8c7d9a47319ffa84cd310a631140bf306cd9e6666d","last_reissued_at":"2026-05-18T02:55:39.651482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:39.651482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.0461","source_version":1,"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:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eE5Do0dK1+sayw4m6v24g94AbuJrWLUxfhYO95KkYZoy3CVgI0n/Pyk8nibLfHuhKpDJsbVj7TI5NVWHW4A+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:00:50.933194Z"},"content_sha256":"e178245ed0ef95bae6ae6e57267538a402c5e5f194b9a651136a89bc40fd7be8","schema_version":"1.0","event_id":"sha256:e178245ed0ef95bae6ae6e57267538a402c5e5f194b9a651136a89bc40fd7be8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LURBG3QQI2EPS6LYLOGH3GSHGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank-width of Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Choongbum Lee, Joonkyung Lee, Sang-il Oum","submitted_at":"2010-01-04T08:59:46Z","abstract_excerpt":"Rank-width of a graph G, denoted by rw(G), is a width parameter of graphs introduced by Oum and Seymour (2006).\n  We investigate the asymptotic behavior of rank-width of a random graph G(n,p). We show that, asymptotically almost surely, (i) if 0<p<1 is a constant, then rw(G(n,p)) = \\lceil n/3 \\rceil-O(1), (ii) if 1/n<< p <1/2, then rw(G(n,p))= \\lceil n/3\\rceil-o(n), (iii) if p = c/n and c > 1, then rw(G(n,p)) > r n for some r = r(c), and (iv) if p <= c/n and c<1, then rw(G(n,p)) <=2.\n  As a corollary, we deduce that G(n,p) has linear tree-width whenever p=c/n for each c>1, answering a question"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0461","kind":"arxiv","version":1},"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:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WU1+691YWgqzM2XeKtI1s08ii3PlixuTeKPVUrMb1RZvQvcYulReY2nsS+DTRTM0e/K+6z2oAZ3zXRSScegwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:00:50.933562Z"},"content_sha256":"a218c0d16b595bb2eb613e718dc0088d59f8c00dc9ec850862d9f31c4c45a019","schema_version":"1.0","event_id":"sha256:a218c0d16b595bb2eb613e718dc0088d59f8c00dc9ec850862d9f31c4c45a019"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LURBG3QQI2EPS6LYLOGH3GSHGG/bundle.json","state_url":"https://pith.science/pith/LURBG3QQI2EPS6LYLOGH3GSHGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LURBG3QQI2EPS6LYLOGH3GSHGG/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-06-12T05:00:50Z","links":{"resolver":"https://pith.science/pith/LURBG3QQI2EPS6LYLOGH3GSHGG","bundle":"https://pith.science/pith/LURBG3QQI2EPS6LYLOGH3GSHGG/bundle.json","state":"https://pith.science/pith/LURBG3QQI2EPS6LYLOGH3GSHGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LURBG3QQI2EPS6LYLOGH3GSHGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LURBG3QQI2EPS6LYLOGH3GSHGG","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":"31129f9c549d3813a2e0331b284ff1f3a5566ef76d27994dfee87d68cbc40a94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-04T08:59:46Z","title_canon_sha256":"3fed732465536e8cc1a281b6c992453461703e05afac32eca3ccfb18baac2586"},"schema_version":"1.0","source":{"id":"1001.0461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0461","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0461v1","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0461","created_at":"2026-05-18T02:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"LURBG3QQI2EP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LURBG3QQI2EPS6LY","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LURBG3QQ","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:a218c0d16b595bb2eb613e718dc0088d59f8c00dc9ec850862d9f31c4c45a019","target":"graph","created_at":"2026-05-18T02:55:39Z","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":"Rank-width of a graph G, denoted by rw(G), is a width parameter of graphs introduced by Oum and Seymour (2006).\n  We investigate the asymptotic behavior of rank-width of a random graph G(n,p). We show that, asymptotically almost surely, (i) if 0<p<1 is a constant, then rw(G(n,p)) = \\lceil n/3 \\rceil-O(1), (ii) if 1/n<< p <1/2, then rw(G(n,p))= \\lceil n/3\\rceil-o(n), (iii) if p = c/n and c > 1, then rw(G(n,p)) > r n for some r = r(c), and (iv) if p <= c/n and c<1, then rw(G(n,p)) <=2.\n  As a corollary, we deduce that G(n,p) has linear tree-width whenever p=c/n for each c>1, answering a question","authors_text":"Choongbum Lee, Joonkyung Lee, Sang-il Oum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-04T08:59:46Z","title":"Rank-width of Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0461","kind":"arxiv","version":1},"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:e178245ed0ef95bae6ae6e57267538a402c5e5f194b9a651136a89bc40fd7be8","target":"record","created_at":"2026-05-18T02:55:39Z","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":"31129f9c549d3813a2e0331b284ff1f3a5566ef76d27994dfee87d68cbc40a94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-04T08:59:46Z","title_canon_sha256":"3fed732465536e8cc1a281b6c992453461703e05afac32eca3ccfb18baac2586"},"schema_version":"1.0","source":{"id":"1001.0461","kind":"arxiv","version":1}},"canonical_sha256":"5d22136e104688f979785b8c7d9a47319ffa84cd310a631140bf306cd9e6666d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d22136e104688f979785b8c7d9a47319ffa84cd310a631140bf306cd9e6666d","first_computed_at":"2026-05-18T02:55:39.651482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:39.651482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fjBZ+/YkScX/3MttJHzh7QHBe8NTECW/CawvrGcOFVjA9UJbsBLQJKqy9QX7GoHMKjUKyO2dAg0ucM9lxoL8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:39.652025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.0461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e178245ed0ef95bae6ae6e57267538a402c5e5f194b9a651136a89bc40fd7be8","sha256:a218c0d16b595bb2eb613e718dc0088d59f8c00dc9ec850862d9f31c4c45a019"],"state_sha256":"557b935478cb1685f6724b9d6c6eda7e8175f09a1f26b17112cc599daa4202cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"siegRHiD5qU8wapTJpf1uvJBTzq+rYLeq1cZxu6+HgK905A0Li7svVT9xXUKdN388oJpXekMuFssE/93mBGPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:00:50.935805Z","bundle_sha256":"2f02559d5b9a48e0a77990451bdb9be77e23519283e97b0d56d0337a0d5a6825"}}