{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MS7C2OWQ4RIMEH7TIKBWIQ2F7F","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":"c4e7161e42ad6389c49a4015fd09d949cd438f0f4e16bde346a18d6144f42180","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-09T13:09:31Z","title_canon_sha256":"f0261f9ad6965d93214116d1b646fed88fcc333d7e88f3fc6d4c105a1f8e3272"},"schema_version":"1.0","source":{"id":"1305.2078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2078","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2078v1","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2078","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"MS7C2OWQ4RIM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MS7C2OWQ4RIMEH7T","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MS7C2OWQ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:ee0b61c81a01131fe9b483f15f01557ee1fc6d837bd3e5b9a7ab2fac94cbc6be","target":"graph","created_at":"2026-05-18T03:26:09Z","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":"The Bandwidth Theorem of B\\\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this result to a-arrangeable graphs H with \\Delta(H)<sqrt(n)/log(n), where n is the number of vertices of H.\n  Our result implies that sufficiently large n-vertex graphs G with minimum degree at least (3/4+\\gamma)n contain almost all planar graphs on n vertices as subgraphs. Using techniques developed by Allen, Brightwell and Skokan [Combinatorica, to appear] we can","authors_text":"Andreas W\\\"urfl, Anusch Taraz, Julia B\\\"ottcher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-09T13:09:31Z","title":"Spanning embeddings of arrangeable graphs with sublinear bandwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2078","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:d6f34b9e2173ec606c413a19699488e9b22e3d9df201d9a6e0a04fafa0074940","target":"record","created_at":"2026-05-18T03:26:09Z","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":"c4e7161e42ad6389c49a4015fd09d949cd438f0f4e16bde346a18d6144f42180","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-09T13:09:31Z","title_canon_sha256":"f0261f9ad6965d93214116d1b646fed88fcc333d7e88f3fc6d4c105a1f8e3272"},"schema_version":"1.0","source":{"id":"1305.2078","kind":"arxiv","version":1}},"canonical_sha256":"64be2d3ad0e450c21ff34283644345f9584a8a5e882db2af85d42e9d45db2892","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64be2d3ad0e450c21ff34283644345f9584a8a5e882db2af85d42e9d45db2892","first_computed_at":"2026-05-18T03:26:09.395743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:09.395743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"biFl2IrGgR3Di9No0LXKlcL9BnX0mB/tLGeUyySz7bdiOdcxFIT2jDdrzbHK3bFfCXCxO7kyK9VOK0TbDjsuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:09.396464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6f34b9e2173ec606c413a19699488e9b22e3d9df201d9a6e0a04fafa0074940","sha256:ee0b61c81a01131fe9b483f15f01557ee1fc6d837bd3e5b9a7ab2fac94cbc6be"],"state_sha256":"8283f8fec8e436fa99bfc6b3fef31438c1a0a51e6e543f9b1232fc81c717d97d"}