{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4TCS7EHEUJ34UOJMGSKU6T5Z44","short_pith_number":"pith:4TCS7EHE","schema_version":"1.0","canonical_sha256":"e4c52f90e4a277ca392c34954f4fb9e7338fe4223f9cd417d7046cf3a1112e29","source":{"kind":"arxiv","id":"1712.04562","version":2},"attestation_state":"computed","paper":{"title":"A bandwidth theorem for approximate decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Jaehoon Kim, Padraig Condon","submitted_at":"2017-12-12T23:02:29Z","abstract_excerpt":"We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$. In general, this degree condition is best possible.\n  Here a graph is separable if it has a sublinear separator whose removal results in a set of components of sublinear size. Equivalently, the separability condition can be replaced by that of having small bandwidth. Thus our result can be viewed as a version of the bandwidth theorem of B\\\"ottcher, Schacht and Taraz in the setting o"},"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":"1712.04562","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T23:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"2e10c553dff7d36a213cb1159f01d08e614e8f5e776120efd3c414485dd21307","abstract_canon_sha256":"d2ac57aae01112dd893032e965f2f5d81daaf04c3e57f57f4e4e86e180e7086d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:15.230701Z","signature_b64":"kNOe/b15Xzr9nPNzqJvViOvYF7mbN9tbUTIRrLUIFVgeUbkc0tIWk+h++k80IAkFn7k5rzcyAy9od+NRIDiqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4c52f90e4a277ca392c34954f4fb9e7338fe4223f9cd417d7046cf3a1112e29","last_reissued_at":"2026-05-18T00:01:15.230260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:15.230260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A bandwidth theorem for approximate decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Jaehoon Kim, Padraig Condon","submitted_at":"2017-12-12T23:02:29Z","abstract_excerpt":"We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$. In general, this degree condition is best possible.\n  Here a graph is separable if it has a sublinear separator whose removal results in a set of components of sublinear size. Equivalently, the separability condition can be replaced by that of having small bandwidth. Thus our result can be viewed as a version of the bandwidth theorem of B\\\"ottcher, Schacht and Taraz in the setting o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04562","kind":"arxiv","version":2},"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":"1712.04562","created_at":"2026-05-18T00:01:15.230349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04562v2","created_at":"2026-05-18T00:01:15.230349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04562","created_at":"2026-05-18T00:01:15.230349+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TCS7EHEUJ34","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TCS7EHEUJ34UOJM","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TCS7EHE","created_at":"2026-05-18T12:31:00.734936+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/4TCS7EHEUJ34UOJMGSKU6T5Z44","json":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44.json","graph_json":"https://pith.science/api/pith-number/4TCS7EHEUJ34UOJMGSKU6T5Z44/graph.json","events_json":"https://pith.science/api/pith-number/4TCS7EHEUJ34UOJMGSKU6T5Z44/events.json","paper":"https://pith.science/paper/4TCS7EHE"},"agent_actions":{"view_html":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44","download_json":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44.json","view_paper":"https://pith.science/paper/4TCS7EHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04562&json=true","fetch_graph":"https://pith.science/api/pith-number/4TCS7EHEUJ34UOJMGSKU6T5Z44/graph.json","fetch_events":"https://pith.science/api/pith-number/4TCS7EHEUJ34UOJMGSKU6T5Z44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/action/storage_attestation","attest_author":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/action/author_attestation","sign_citation":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/action/citation_signature","submit_replication":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/action/replication_record"}},"created_at":"2026-05-18T00:01:15.230349+00:00","updated_at":"2026-05-18T00:01:15.230349+00:00"}