{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VHNUCTVPVH3GE7DDSMA277X2NW","short_pith_number":"pith:VHNUCTVP","schema_version":"1.0","canonical_sha256":"a9db414eafa9f6627c639301affefa6da691716bf27d9fa40d2f338d652637a2","source":{"kind":"arxiv","id":"1109.2571","version":1},"attestation_state":"computed","paper":{"title":"An improved error term for minimum H-decompositions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julia B\\\"ottcher, Peter Allen, Yury Person","submitted_at":"2011-09-12T19:07:55Z","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"},"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":"1109.2571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-12T19:07:55Z","cross_cats_sorted":[],"title_canon_sha256":"6132e9bdaff5371c5266ab488bb296c28fbd04ade87dc9bd14e34d3a69227447","abstract_canon_sha256":"c6e973f441fa1d9ede0626442927234e3f030b4cd89ed8afcf3a558dc57679c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:37.362853Z","signature_b64":"wqgnBgq1yH4df/OKj79TRD9bcEPZx1tA0VcOnc/5fOcwPQ3ovE+ru+Qmfa9tmTOH9H2kO5p1rx87u6sqqo8MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9db414eafa9f6627c639301affefa6da691716bf27d9fa40d2f338d652637a2","last_reissued_at":"2026-05-18T04:13:37.362260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:37.362260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved error term for minimum H-decompositions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julia B\\\"ottcher, Peter Allen, Yury Person","submitted_at":"2011-09-12T19:07:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2571","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.2571","created_at":"2026-05-18T04:13:37.362364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2571v1","created_at":"2026-05-18T04:13:37.362364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2571","created_at":"2026-05-18T04:13:37.362364+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHNUCTVPVH3G","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHNUCTVPVH3GE7DD","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHNUCTVP","created_at":"2026-05-18T12:26:44.992195+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/VHNUCTVPVH3GE7DDSMA277X2NW","json":"https://pith.science/pith/VHNUCTVPVH3GE7DDSMA277X2NW.json","graph_json":"https://pith.science/api/pith-number/VHNUCTVPVH3GE7DDSMA277X2NW/graph.json","events_json":"https://pith.science/api/pith-number/VHNUCTVPVH3GE7DDSMA277X2NW/events.json","paper":"https://pith.science/paper/VHNUCTVP"},"agent_actions":{"view_html":"https://pith.science/pith/VHNUCTVPVH3GE7DDSMA277X2NW","download_json":"https://pith.science/pith/VHNUCTVPVH3GE7DDSMA277X2NW.json","view_paper":"https://pith.science/paper/VHNUCTVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2571&json=true","fetch_graph":"https://pith.science/api/pith-number/VHNUCTVPVH3GE7DDSMA277X2NW/graph.json","fetch_events":"https://pith.science/api/pith-number/VHNUCTVPVH3GE7DDSMA277X2NW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHNUCTVPVH3GE7DDSMA277X2NW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHNUCTVPVH3GE7DDSMA277X2NW/action/storage_attestation","attest_author":"https://pith.science/pith/VHNUCTVPVH3GE7DDSMA277X2NW/action/author_attestation","sign_citation":"https://pith.science/pith/VHNUCTVPVH3GE7DDSMA277X2NW/action/citation_signature","submit_replication":"https://pith.science/pith/VHNUCTVPVH3GE7DDSMA277X2NW/action/replication_record"}},"created_at":"2026-05-18T04:13:37.362364+00:00","updated_at":"2026-05-18T04:13:37.362364+00:00"}