{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VHNUCTVPVH3GE7DDSMA277X2NW","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":"c6e973f441fa1d9ede0626442927234e3f030b4cd89ed8afcf3a558dc57679c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-12T19:07:55Z","title_canon_sha256":"6132e9bdaff5371c5266ab488bb296c28fbd04ade87dc9bd14e34d3a69227447"},"schema_version":"1.0","source":{"id":"1109.2571","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2571","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2571v1","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2571","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"VHNUCTVPVH3G","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHNUCTVPVH3GE7DD","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHNUCTVP","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:ecbef6446346816a99af12adb2b09fbd450d7859c52a8bfda13b68dceafcee39","target":"graph","created_at":"2026-05-18T04:13:37Z","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 consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let \\phi_H(n) denote the minimum number p such that any n-vertex G admits such a partition with at most p parts. We show that \\phi_H(n)=ex(n,K_r)+\\Theta(biex(n,H)) for \\chi(H)>2, where biex(n,H) is the extremal number of the decomposition family of H. Since biex(n,H)=O(n^{2-\\gamma}) for some \\gamma>0 this improves on the bound \\phi_H(n)=ex(n,H)+o(n^2) by Pikhurko and Sousa [J. Combin. Theory Ser. B 97 (2007), 1041-1055]. In addition it extends a result of \\\"Ozkahya and Person [J. Combin. Theory","authors_text":"Julia B\\\"ottcher, Peter Allen, Yury Person","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-12T19:07:55Z","title":"An improved error term for minimum H-decompositions of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2571","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:aedc0bfd977dd1feb411b219f4b3d99cc65b619426243c4028154cd2a36be215","target":"record","created_at":"2026-05-18T04:13:37Z","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":"c6e973f441fa1d9ede0626442927234e3f030b4cd89ed8afcf3a558dc57679c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-12T19:07:55Z","title_canon_sha256":"6132e9bdaff5371c5266ab488bb296c28fbd04ade87dc9bd14e34d3a69227447"},"schema_version":"1.0","source":{"id":"1109.2571","kind":"arxiv","version":1}},"canonical_sha256":"a9db414eafa9f6627c639301affefa6da691716bf27d9fa40d2f338d652637a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9db414eafa9f6627c639301affefa6da691716bf27d9fa40d2f338d652637a2","first_computed_at":"2026-05-18T04:13:37.362260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:37.362260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wqgnBgq1yH4df/OKj79TRD9bcEPZx1tA0VcOnc/5fOcwPQ3ovE+ru+Qmfa9tmTOH9H2kO5p1rx87u6sqqo8MAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:37.362853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2571","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aedc0bfd977dd1feb411b219f4b3d99cc65b619426243c4028154cd2a36be215","sha256:ecbef6446346816a99af12adb2b09fbd450d7859c52a8bfda13b68dceafcee39"],"state_sha256":"fd420fb7355b300fd9c14c66aaacd3be21ae329047a3ba4fa4640fbfaa559998"}