{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MS7C2OWQ4RIMEH7TIKBWIQ2F7F","short_pith_number":"pith:MS7C2OWQ","schema_version":"1.0","canonical_sha256":"64be2d3ad0e450c21ff34283644345f9584a8a5e882db2af85d42e9d45db2892","source":{"kind":"arxiv","id":"1305.2078","version":1},"attestation_state":"computed","paper":{"title":"Spanning embeddings of arrangeable graphs with sublinear bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas W\\\"urfl, Anusch Taraz, Julia B\\\"ottcher","submitted_at":"2013-05-09T13:09:31Z","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"},"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":"1305.2078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-09T13:09:31Z","cross_cats_sorted":[],"title_canon_sha256":"f0261f9ad6965d93214116d1b646fed88fcc333d7e88f3fc6d4c105a1f8e3272","abstract_canon_sha256":"c4e7161e42ad6389c49a4015fd09d949cd438f0f4e16bde346a18d6144f42180"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:09.396464Z","signature_b64":"biFl2IrGgR3Di9No0LXKlcL9BnX0mB/tLGeUyySz7bdiOdcxFIT2jDdrzbHK3bFfCXCxO7kyK9VOK0TbDjsuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64be2d3ad0e450c21ff34283644345f9584a8a5e882db2af85d42e9d45db2892","last_reissued_at":"2026-05-18T03:26:09.395743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:09.395743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning embeddings of arrangeable graphs with sublinear bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas W\\\"urfl, Anusch Taraz, Julia B\\\"ottcher","submitted_at":"2013-05-09T13:09:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2078","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.2078","created_at":"2026-05-18T03:26:09.395850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2078v1","created_at":"2026-05-18T03:26:09.395850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2078","created_at":"2026-05-18T03:26:09.395850+00:00"},{"alias_kind":"pith_short_12","alias_value":"MS7C2OWQ4RIM","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MS7C2OWQ4RIMEH7T","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MS7C2OWQ","created_at":"2026-05-18T12:27:52.871228+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/MS7C2OWQ4RIMEH7TIKBWIQ2F7F","json":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F.json","graph_json":"https://pith.science/api/pith-number/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/graph.json","events_json":"https://pith.science/api/pith-number/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/events.json","paper":"https://pith.science/paper/MS7C2OWQ"},"agent_actions":{"view_html":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F","download_json":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F.json","view_paper":"https://pith.science/paper/MS7C2OWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2078&json=true","fetch_graph":"https://pith.science/api/pith-number/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/graph.json","fetch_events":"https://pith.science/api/pith-number/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/action/storage_attestation","attest_author":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/action/author_attestation","sign_citation":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/action/citation_signature","submit_replication":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/action/replication_record"}},"created_at":"2026-05-18T03:26:09.395850+00:00","updated_at":"2026-05-18T03:26:09.395850+00:00"}