{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CEEI6WT22XFDC5ZEXHMBQDINLR","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":"58f87ce8bcce52514849c89001522440753cff7364c84063e2d49c06467d7a46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-18T07:04:42Z","title_canon_sha256":"689bf4c5694eee95b9091f9f408648607ea1ec1cdbb1d6b9bc59d5003bb37ec0"},"schema_version":"1.0","source":{"id":"1111.4292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4292","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4292v2","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4292","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"CEEI6WT22XFD","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CEEI6WT22XFDC5ZE","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CEEI6WT2","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:3deb6e57b999dd6653643de0bf80ff897bda80135e5118695d6b50c062e0a8d4","target":"graph","created_at":"2026-05-18T03:46:16Z","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":"Boettcher, Schacht and Taraz gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth o(n), thereby proving a conjecture of Bollobas and Komlos. We strengthen this result in the case when H is bipartite. Indeed, we give an essentially best-possible condition on the degree sequence of a graph G on n vertices that forces G to contain every bipartite graph H on n vertices of bounded degree and of bandwidth o(n). This also implies an Ore-type result. In fact, we prove a much stronger result ","authors_text":"Andrew Treglown, Fiachra Knox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-18T07:04:42Z","title":"Embedding spanning bipartite graphs of small bandwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4292","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:fec916d9c43302f3d3b3191923b98daa3314c94beb178dbaf9cf6ca761bda7b6","target":"record","created_at":"2026-05-18T03:46:16Z","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":"58f87ce8bcce52514849c89001522440753cff7364c84063e2d49c06467d7a46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-18T07:04:42Z","title_canon_sha256":"689bf4c5694eee95b9091f9f408648607ea1ec1cdbb1d6b9bc59d5003bb37ec0"},"schema_version":"1.0","source":{"id":"1111.4292","kind":"arxiv","version":2}},"canonical_sha256":"11088f5a7ad5ca317724b9d8180d0d5c4ec57d849a5dc5a561da8f8c8b2b6064","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11088f5a7ad5ca317724b9d8180d0d5c4ec57d849a5dc5a561da8f8c8b2b6064","first_computed_at":"2026-05-18T03:46:16.883066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:16.883066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LeQSEMRWZbf91QtXNhgfHXo3J/DoocJjrjMCzwd1ufsIzo8Wkt0R04oj4cKeX0r36RKWOeK8GW+4duEIsvLEDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:16.883776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fec916d9c43302f3d3b3191923b98daa3314c94beb178dbaf9cf6ca761bda7b6","sha256:3deb6e57b999dd6653643de0bf80ff897bda80135e5118695d6b50c062e0a8d4"],"state_sha256":"271044e50e9aedabaefb1938332ce53fd85b62eff29c9ddf19f854f03437a44f"}