{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4TCS7EHEUJ34UOJMGSKU6T5Z44","short_pith_number":"pith:4TCS7EHE","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"},"canonical_sha256":"e4c52f90e4a277ca392c34954f4fb9e7338fe4223f9cd417d7046cf3a1112e29","source":{"kind":"arxiv","id":"1712.04562","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04562","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04562v2","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04562","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"4TCS7EHEUJ34","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4TCS7EHEUJ34UOJM","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4TCS7EHE","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4TCS7EHEUJ34UOJMGSKU6T5Z44","target":"record","payload":{"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"},"canonical_sha256":"e4c52f90e4a277ca392c34954f4fb9e7338fe4223f9cd417d7046cf3a1112e29","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"},"source_kind":"arxiv","source_id":"1712.04562","source_version":2,"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-18T00:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Ols41faELz0fWZeAsr5Ox+MTeHbEqzX99SqCujqZT/NaeSVWFHsGR28rJVCadwKwfMo7KBwTjeUcXrxq9OTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:12:54.680151Z"},"content_sha256":"b13f92c2b6c2cb4fb086103b70f490141b8b9120bd243ba25fba717ffe6a7beb","schema_version":"1.0","event_id":"sha256:b13f92c2b6c2cb4fb086103b70f490141b8b9120bd243ba25fba717ffe6a7beb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4TCS7EHEUJ34UOJMGSKU6T5Z44","target":"graph","payload":{"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"},"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-18T00:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0mU7iVFVrWtd7rn7QJemERitf/EANYNIlherIlE0JvWYm+5XIQpyafpOP569iBd3TfBkaPrwiaX3Rmtk+4hgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:12:54.680828Z"},"content_sha256":"b8156577715b26234429e22abb09ae293854430ddb16e42c1559b296a31294ce","schema_version":"1.0","event_id":"sha256:b8156577715b26234429e22abb09ae293854430ddb16e42c1559b296a31294ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/bundle.json","state_url":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/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-27T14:12:54Z","links":{"resolver":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44","bundle":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/bundle.json","state":"https://pith.science/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TCS7EHEUJ34UOJMGSKU6T5Z44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4TCS7EHEUJ34UOJMGSKU6T5Z44","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":"d2ac57aae01112dd893032e965f2f5d81daaf04c3e57f57f4e4e86e180e7086d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T23:02:29Z","title_canon_sha256":"2e10c553dff7d36a213cb1159f01d08e614e8f5e776120efd3c414485dd21307"},"schema_version":"1.0","source":{"id":"1712.04562","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04562","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04562v2","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04562","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"4TCS7EHEUJ34","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4TCS7EHEUJ34UOJM","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4TCS7EHE","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:b8156577715b26234429e22abb09ae293854430ddb16e42c1559b296a31294ce","target":"graph","created_at":"2026-05-18T00:01:15Z","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":"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","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Jaehoon Kim, Padraig Condon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T23:02:29Z","title":"A bandwidth theorem for approximate decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04562","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:b13f92c2b6c2cb4fb086103b70f490141b8b9120bd243ba25fba717ffe6a7beb","target":"record","created_at":"2026-05-18T00:01:15Z","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":"d2ac57aae01112dd893032e965f2f5d81daaf04c3e57f57f4e4e86e180e7086d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T23:02:29Z","title_canon_sha256":"2e10c553dff7d36a213cb1159f01d08e614e8f5e776120efd3c414485dd21307"},"schema_version":"1.0","source":{"id":"1712.04562","kind":"arxiv","version":2}},"canonical_sha256":"e4c52f90e4a277ca392c34954f4fb9e7338fe4223f9cd417d7046cf3a1112e29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4c52f90e4a277ca392c34954f4fb9e7338fe4223f9cd417d7046cf3a1112e29","first_computed_at":"2026-05-18T00:01:15.230260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:15.230260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kNOe/b15Xzr9nPNzqJvViOvYF7mbN9tbUTIRrLUIFVgeUbkc0tIWk+h++k80IAkFn7k5rzcyAy9od+NRIDiqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:15.230701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04562","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b13f92c2b6c2cb4fb086103b70f490141b8b9120bd243ba25fba717ffe6a7beb","sha256:b8156577715b26234429e22abb09ae293854430ddb16e42c1559b296a31294ce"],"state_sha256":"66666b1e25958b5f84926590e783a0d2154a840973f0e7dafe97b43d1e3e4322"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HUPp6R8vmwxNb5jDefZ/igu32mlyaDKK5q3itjtIeo4Owxd3eqs0weE69QkfuoaRzQfVEdDaA3RVVnCfJpmtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:12:54.684279Z","bundle_sha256":"daf41314f4fd9fb9596d52053d7c13b565f9a286dd11e6f8f831abfce73fb761"}}