{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VJM66YNGL2PBU3XNWWQ27Z6OC6","short_pith_number":"pith:VJM66YNG","schema_version":"1.0","canonical_sha256":"aa59ef61a65e9e1a6eedb5a1afe7ce1788ef6bb46e8d997467a0ecd40d8c95d2","source":{"kind":"arxiv","id":"1603.04724","version":2},"attestation_state":"computed","paper":{"title":"On the decomposition threshold of a given graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Daniela K\\\"uhn, Deryk Osthus, Richard Montgomery, Stefan Glock","submitted_at":"2016-03-15T15:47:18Z","abstract_excerpt":"We study the $F$-decomposition threshold $\\delta_F$ for a given graph $F$. Here an $F$-decomposition of a graph $G$ is a collection of edge-disjoint copies of $F$ in $G$ which together cover every edge of $G$. (Such an $F$-decomposition can only exist if $G$ is $F$-divisible, i.e. if $e(F)\\mid e(G)$ and each vertex degree of $G$ can be expressed as a linear combination of the vertex degrees of $F$.)\n  The $F$-decomposition threshold $\\delta_F$ is the smallest value ensuring that an $F$-divisible graph $G$ on $n$ vertices with $\\delta(G)\\ge(\\delta_F+o(1))n$ has an $F$-decomposition. Our main re"},"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":"1603.04724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-15T15:47:18Z","cross_cats_sorted":[],"title_canon_sha256":"2cdfe35f68570a0a2618899f7cf3cb25d907f16fa1a7905b25a5f340d14ca1ef","abstract_canon_sha256":"edf92289014977e4348a415e71f1e7e38de7f77b3a1ad5abc97532e321a6d906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:26.324451Z","signature_b64":"1cKsasN5rDwyZcqP4vmmzoTsoRcQit/8kO6eTFy/bAnefAdnN/Mc6Yp3A9pb+VZT4n3FLW5BCmjCYL2AEBxsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa59ef61a65e9e1a6eedb5a1afe7ce1788ef6bb46e8d997467a0ecd40d8c95d2","last_reissued_at":"2026-05-17T23:51:26.323883Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:26.323883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the decomposition threshold of a given graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Daniela K\\\"uhn, Deryk Osthus, Richard Montgomery, Stefan Glock","submitted_at":"2016-03-15T15:47:18Z","abstract_excerpt":"We study the $F$-decomposition threshold $\\delta_F$ for a given graph $F$. Here an $F$-decomposition of a graph $G$ is a collection of edge-disjoint copies of $F$ in $G$ which together cover every edge of $G$. (Such an $F$-decomposition can only exist if $G$ is $F$-divisible, i.e. if $e(F)\\mid e(G)$ and each vertex degree of $G$ can be expressed as a linear combination of the vertex degrees of $F$.)\n  The $F$-decomposition threshold $\\delta_F$ is the smallest value ensuring that an $F$-divisible graph $G$ on $n$ vertices with $\\delta(G)\\ge(\\delta_F+o(1))n$ has an $F$-decomposition. Our main re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04724","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":"1603.04724","created_at":"2026-05-17T23:51:26.323973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04724v2","created_at":"2026-05-17T23:51:26.323973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04724","created_at":"2026-05-17T23:51:26.323973+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJM66YNGL2PB","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJM66YNGL2PBU3XN","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJM66YNG","created_at":"2026-05-18T12:30:48.956258+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/VJM66YNGL2PBU3XNWWQ27Z6OC6","json":"https://pith.science/pith/VJM66YNGL2PBU3XNWWQ27Z6OC6.json","graph_json":"https://pith.science/api/pith-number/VJM66YNGL2PBU3XNWWQ27Z6OC6/graph.json","events_json":"https://pith.science/api/pith-number/VJM66YNGL2PBU3XNWWQ27Z6OC6/events.json","paper":"https://pith.science/paper/VJM66YNG"},"agent_actions":{"view_html":"https://pith.science/pith/VJM66YNGL2PBU3XNWWQ27Z6OC6","download_json":"https://pith.science/pith/VJM66YNGL2PBU3XNWWQ27Z6OC6.json","view_paper":"https://pith.science/paper/VJM66YNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04724&json=true","fetch_graph":"https://pith.science/api/pith-number/VJM66YNGL2PBU3XNWWQ27Z6OC6/graph.json","fetch_events":"https://pith.science/api/pith-number/VJM66YNGL2PBU3XNWWQ27Z6OC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJM66YNGL2PBU3XNWWQ27Z6OC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJM66YNGL2PBU3XNWWQ27Z6OC6/action/storage_attestation","attest_author":"https://pith.science/pith/VJM66YNGL2PBU3XNWWQ27Z6OC6/action/author_attestation","sign_citation":"https://pith.science/pith/VJM66YNGL2PBU3XNWWQ27Z6OC6/action/citation_signature","submit_replication":"https://pith.science/pith/VJM66YNGL2PBU3XNWWQ27Z6OC6/action/replication_record"}},"created_at":"2026-05-17T23:51:26.323973+00:00","updated_at":"2026-05-17T23:51:26.323973+00:00"}