{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KX46RCHFA2UC3XOR7J7IZUTTJE","short_pith_number":"pith:KX46RCHF","schema_version":"1.0","canonical_sha256":"55f9e888e506a82dddd1fa7e8cd273492c11b37d140d26594c64369d551846d5","source":{"kind":"arxiv","id":"1703.07301","version":3},"attestation_state":"computed","paper":{"title":"Linearly many rainbow trees in properly edge-coloured complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Benny Sudakov","submitted_at":"2017-03-21T16:34:41Z","abstract_excerpt":"A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. The study of rainbow decompositions has a long history, going back to the work of Euler on Latin squares. In this paper we discuss three problems about decomposing complete graphs into rainbow trees: the Brualdi-Hollingsworth Conjecture, Constantine's Conjecture, and the Kaneko-Kano-Suzuki Conjecture. We show that in every proper edge-colouring of $K_n$ there are $10^{-6}n$ edge-disjoint spanning isomorphic rainbow trees. This simultaneously improves the best known bounds on all these conje"},"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":"1703.07301","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T16:34:41Z","cross_cats_sorted":[],"title_canon_sha256":"3b147f415f41cfbd4a53874d2e8c68a7beb38755123eea644eb46224e4d8c3bc","abstract_canon_sha256":"1f2ac676ffb310855dcec917375ea1c1cc556175fc046283400c6b2e2e8f5f99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:44.733358Z","signature_b64":"G0yCR1Ub7Wymt78Rs9/6WC5JrlKME5DTCFNTXcEHuVwGS95AbsaYpt37DdM82c5Uz6Y01c8+GxWKcXwLcNeIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55f9e888e506a82dddd1fa7e8cd273492c11b37d140d26594c64369d551846d5","last_reissued_at":"2026-05-18T00:20:44.732685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:44.732685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linearly many rainbow trees in properly edge-coloured complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Benny Sudakov","submitted_at":"2017-03-21T16:34:41Z","abstract_excerpt":"A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. The study of rainbow decompositions has a long history, going back to the work of Euler on Latin squares. In this paper we discuss three problems about decomposing complete graphs into rainbow trees: the Brualdi-Hollingsworth Conjecture, Constantine's Conjecture, and the Kaneko-Kano-Suzuki Conjecture. We show that in every proper edge-colouring of $K_n$ there are $10^{-6}n$ edge-disjoint spanning isomorphic rainbow trees. This simultaneously improves the best known bounds on all these conje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07301","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.07301","created_at":"2026-05-18T00:20:44.732792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07301v3","created_at":"2026-05-18T00:20:44.732792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07301","created_at":"2026-05-18T00:20:44.732792+00:00"},{"alias_kind":"pith_short_12","alias_value":"KX46RCHFA2UC","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KX46RCHFA2UC3XOR","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KX46RCHF","created_at":"2026-05-18T12:31:28.150371+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/KX46RCHFA2UC3XOR7J7IZUTTJE","json":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE.json","graph_json":"https://pith.science/api/pith-number/KX46RCHFA2UC3XOR7J7IZUTTJE/graph.json","events_json":"https://pith.science/api/pith-number/KX46RCHFA2UC3XOR7J7IZUTTJE/events.json","paper":"https://pith.science/paper/KX46RCHF"},"agent_actions":{"view_html":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE","download_json":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE.json","view_paper":"https://pith.science/paper/KX46RCHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07301&json=true","fetch_graph":"https://pith.science/api/pith-number/KX46RCHFA2UC3XOR7J7IZUTTJE/graph.json","fetch_events":"https://pith.science/api/pith-number/KX46RCHFA2UC3XOR7J7IZUTTJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/action/storage_attestation","attest_author":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/action/author_attestation","sign_citation":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/action/citation_signature","submit_replication":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/action/replication_record"}},"created_at":"2026-05-18T00:20:44.732792+00:00","updated_at":"2026-05-18T00:20:44.732792+00:00"}