{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SNYVENJNT4ITH4UJY5OWCXUJPU","short_pith_number":"pith:SNYVENJN","canonical_record":{"source":{"id":"1604.07282","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-25T14:36:32Z","cross_cats_sorted":[],"title_canon_sha256":"fa6c9f56edfc68b0f4e171a944d2b817e2531b77df996d865e18861e04984ba0","abstract_canon_sha256":"8eff5cfcf0268d4b541bf70a19d7cf77e7bf8c92def1e1c93a3076a3b5d09cee"},"schema_version":"1.0"},"canonical_sha256":"937152352d9f1133f289c75d615e897d35103ea29c7430791c91d3a872c65499","source":{"kind":"arxiv","id":"1604.07282","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07282","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07282v3","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07282","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"SNYVENJNT4IT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SNYVENJNT4ITH4UJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SNYVENJN","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SNYVENJNT4ITH4UJY5OWCXUJPU","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07282","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-25T14:36:32Z","cross_cats_sorted":[],"title_canon_sha256":"fa6c9f56edfc68b0f4e171a944d2b817e2531b77df996d865e18861e04984ba0","abstract_canon_sha256":"8eff5cfcf0268d4b541bf70a19d7cf77e7bf8c92def1e1c93a3076a3b5d09cee"},"schema_version":"1.0"},"canonical_sha256":"937152352d9f1133f289c75d615e897d35103ea29c7430791c91d3a872c65499","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:15.918624Z","signature_b64":"sG4lmnH4tJyyAFg3jFBCGrcO8VachbMWWlA3WpFa4Kpv07YlKtK9Qsl09BJ1tCPwkopY4cXUe3zTlCKm70aXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"937152352d9f1133f289c75d615e897d35103ea29c7430791c91d3a872c65499","last_reissued_at":"2026-05-18T00:34:15.918101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:15.918101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07282","source_version":3,"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:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IweTy5nNst3C6EUTGsQLn1PVYThbD4VacCT4hhySidqZsX06IIOy/hIhh+a26DZZCyN5awH5HpTpKlNJQWnaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:38:51.731071Z"},"content_sha256":"23ddcf2279fe5449344d1f5b6c8207da73dd5f092e6ca483a8e5c13b569920dd","schema_version":"1.0","event_id":"sha256:23ddcf2279fe5449344d1f5b6c8207da73dd5f092e6ca483a8e5c13b569920dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SNYVENJNT4ITH4UJY5OWCXUJPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A blow-up lemma 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, Mykhaylo Tyomkyn","submitted_at":"2016-04-25T14:36:32Z","abstract_excerpt":"We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex graph and suppose $H_1,\\dots,H_s$ are bounded degree $n$-vertex graphs with $\\sum_{i=1}^{s} e(H_i) \\leq (1-o(1)) e(G)$. Then $H_1,\\dots,H_s$ can be packed edge-disjointly into $G$. The case when $G$ is the complete graph $K_n$ implies an approximate version of the tree packing conjecture of Gy\\'arf\\'as and Lehel for bounded degree trees, and of the Oberwolfa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07282","kind":"arxiv","version":3},"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:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BBwxciageXzwsNUMKeJcciyMG05HtSeBEV6T0gXtFPKwyuxp1EZ7c43opTAizDSj88JIpsNvO0wYeRrQc3TBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:38:51.731829Z"},"content_sha256":"225cf2d3cf528c7975ce83815d82605e4179a9af4be63ee169a6a2b30db9f6d1","schema_version":"1.0","event_id":"sha256:225cf2d3cf528c7975ce83815d82605e4179a9af4be63ee169a6a2b30db9f6d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNYVENJNT4ITH4UJY5OWCXUJPU/bundle.json","state_url":"https://pith.science/pith/SNYVENJNT4ITH4UJY5OWCXUJPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNYVENJNT4ITH4UJY5OWCXUJPU/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-27T18:38:51Z","links":{"resolver":"https://pith.science/pith/SNYVENJNT4ITH4UJY5OWCXUJPU","bundle":"https://pith.science/pith/SNYVENJNT4ITH4UJY5OWCXUJPU/bundle.json","state":"https://pith.science/pith/SNYVENJNT4ITH4UJY5OWCXUJPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNYVENJNT4ITH4UJY5OWCXUJPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SNYVENJNT4ITH4UJY5OWCXUJPU","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":"8eff5cfcf0268d4b541bf70a19d7cf77e7bf8c92def1e1c93a3076a3b5d09cee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-25T14:36:32Z","title_canon_sha256":"fa6c9f56edfc68b0f4e171a944d2b817e2531b77df996d865e18861e04984ba0"},"schema_version":"1.0","source":{"id":"1604.07282","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07282","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07282v3","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07282","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"SNYVENJNT4IT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SNYVENJNT4ITH4UJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SNYVENJN","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:225cf2d3cf528c7975ce83815d82605e4179a9af4be63ee169a6a2b30db9f6d1","target":"graph","created_at":"2026-05-18T00:34: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 develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex graph and suppose $H_1,\\dots,H_s$ are bounded degree $n$-vertex graphs with $\\sum_{i=1}^{s} e(H_i) \\leq (1-o(1)) e(G)$. Then $H_1,\\dots,H_s$ can be packed edge-disjointly into $G$. The case when $G$ is the complete graph $K_n$ implies an approximate version of the tree packing conjecture of Gy\\'arf\\'as and Lehel for bounded degree trees, and of the Oberwolfa","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Jaehoon Kim, Mykhaylo Tyomkyn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-25T14:36:32Z","title":"A blow-up lemma for approximate decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07282","kind":"arxiv","version":3},"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:23ddcf2279fe5449344d1f5b6c8207da73dd5f092e6ca483a8e5c13b569920dd","target":"record","created_at":"2026-05-18T00:34: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":"8eff5cfcf0268d4b541bf70a19d7cf77e7bf8c92def1e1c93a3076a3b5d09cee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-25T14:36:32Z","title_canon_sha256":"fa6c9f56edfc68b0f4e171a944d2b817e2531b77df996d865e18861e04984ba0"},"schema_version":"1.0","source":{"id":"1604.07282","kind":"arxiv","version":3}},"canonical_sha256":"937152352d9f1133f289c75d615e897d35103ea29c7430791c91d3a872c65499","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"937152352d9f1133f289c75d615e897d35103ea29c7430791c91d3a872c65499","first_computed_at":"2026-05-18T00:34:15.918101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:15.918101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sG4lmnH4tJyyAFg3jFBCGrcO8VachbMWWlA3WpFa4Kpv07YlKtK9Qsl09BJ1tCPwkopY4cXUe3zTlCKm70aXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:15.918624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07282","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23ddcf2279fe5449344d1f5b6c8207da73dd5f092e6ca483a8e5c13b569920dd","sha256:225cf2d3cf528c7975ce83815d82605e4179a9af4be63ee169a6a2b30db9f6d1"],"state_sha256":"4c1a12eba505253e36091b1ccb25a3bd59191101726f5fe904c1a990c510a064"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Spp2LBreIkeYYkO5WsP7pvSL2UHLQ19ozeg/PDmRYgi3d6MvNo7q60tWTAyQ8zXisbW1RoVSTrPw4a/qwjnIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:38:51.735667Z","bundle_sha256":"a27aa37b74ec45261b0b3af6393fffe171e2fed2e7088c4e5b2b9d3b90ec1325"}}