{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MS7C2OWQ4RIMEH7TIKBWIQ2F7F","short_pith_number":"pith:MS7C2OWQ","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"},"canonical_sha256":"64be2d3ad0e450c21ff34283644345f9584a8a5e882db2af85d42e9d45db2892","source":{"kind":"arxiv","id":"1305.2078","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MS7C2OWQ4RIMEH7TIKBWIQ2F7F","target":"record","payload":{"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"},"canonical_sha256":"64be2d3ad0e450c21ff34283644345f9584a8a5e882db2af85d42e9d45db2892","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"},"source_kind":"arxiv","source_id":"1305.2078","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-18T03:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRGoPWvnF8PCalGzvbMmr9FRMEpU+bN1dEfBRDIkikeKg8vY2XWxsgokCgPNd/NqPiICDNNLwKvqzR1XJLUYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:14:14.265958Z"},"content_sha256":"d6f34b9e2173ec606c413a19699488e9b22e3d9df201d9a6e0a04fafa0074940","schema_version":"1.0","event_id":"sha256:d6f34b9e2173ec606c413a19699488e9b22e3d9df201d9a6e0a04fafa0074940"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MS7C2OWQ4RIMEH7TIKBWIQ2F7F","target":"graph","payload":{"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"},"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-18T03:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A6cH3siPQXqyq77YTWbeN9RYcaMg6DfqoPEQJe5bvOBlpabcmX1Evj0bp9tlV/fQ3oqjOVEUXQn3t9FRgDcdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:14:14.266680Z"},"content_sha256":"ee0b61c81a01131fe9b483f15f01557ee1fc6d837bd3e5b9a7ab2fac94cbc6be","schema_version":"1.0","event_id":"sha256:ee0b61c81a01131fe9b483f15f01557ee1fc6d837bd3e5b9a7ab2fac94cbc6be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/bundle.json","state_url":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/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-05-31T03:14:14Z","links":{"resolver":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F","bundle":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/bundle.json","state":"https://pith.science/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MS7C2OWQ4RIMEH7TIKBWIQ2F7F/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/9kvImviSzS5rNcPBN0m9GLff+B3EYr7EScxZsI0pnyEi9M2vJOAZ6lZoHi5hmozuQbEf7bgVubNK7cRI12wAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:14:14.270794Z","bundle_sha256":"9b61a373f522fc9b40c92b080603558393cb378db375e07cb876f305e9202801"}}