{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KX46RCHFA2UC3XOR7J7IZUTTJE","short_pith_number":"pith:KX46RCHF","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"},"canonical_sha256":"55f9e888e506a82dddd1fa7e8cd273492c11b37d140d26594c64369d551846d5","source":{"kind":"arxiv","id":"1703.07301","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07301","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07301v3","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07301","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"pith_short_12","alias_value":"KX46RCHFA2UC","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KX46RCHFA2UC3XOR","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KX46RCHF","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KX46RCHFA2UC3XOR7J7IZUTTJE","target":"record","payload":{"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"},"canonical_sha256":"55f9e888e506a82dddd1fa7e8cd273492c11b37d140d26594c64369d551846d5","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"},"source_kind":"arxiv","source_id":"1703.07301","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:20:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZBBPATMMPCpH0NGwdrWIm4jUvJZdH440AJkWj5a18iNPOw+T4rELGGno/FOWwcnW5mL6CyC5C7jNZxX8UuEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:25:15.253429Z"},"content_sha256":"198fc151366e00feecbdfc17c68b54588d38bca32ddb2c76f186cbe4392f5928","schema_version":"1.0","event_id":"sha256:198fc151366e00feecbdfc17c68b54588d38bca32ddb2c76f186cbe4392f5928"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KX46RCHFA2UC3XOR7J7IZUTTJE","target":"graph","payload":{"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"},"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:20:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lsGG5OaoMvvXPPRRSBFfj5krx1Hg2AZVBABYFi8gNxRhHn/CmVxlc2dRA/GqkOSfOb0d5plvSEMPetbARDe9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:25:15.254079Z"},"content_sha256":"926fb3d5e5e7b613d875b017f82e4eee651706de3df3e52634966fda7a067cef","schema_version":"1.0","event_id":"sha256:926fb3d5e5e7b613d875b017f82e4eee651706de3df3e52634966fda7a067cef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/bundle.json","state_url":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/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-30T18:25:15Z","links":{"resolver":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE","bundle":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/bundle.json","state":"https://pith.science/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KX46RCHFA2UC3XOR7J7IZUTTJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KX46RCHFA2UC3XOR7J7IZUTTJE","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":"1f2ac676ffb310855dcec917375ea1c1cc556175fc046283400c6b2e2e8f5f99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T16:34:41Z","title_canon_sha256":"3b147f415f41cfbd4a53874d2e8c68a7beb38755123eea644eb46224e4d8c3bc"},"schema_version":"1.0","source":{"id":"1703.07301","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07301","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07301v3","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07301","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"pith_short_12","alias_value":"KX46RCHFA2UC","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KX46RCHFA2UC3XOR","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KX46RCHF","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:926fb3d5e5e7b613d875b017f82e4eee651706de3df3e52634966fda7a067cef","target":"graph","created_at":"2026-05-18T00:20:44Z","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":"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","authors_text":"Alexey Pokrovskiy, Benny Sudakov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T16:34:41Z","title":"Linearly many rainbow trees in properly edge-coloured complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07301","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:198fc151366e00feecbdfc17c68b54588d38bca32ddb2c76f186cbe4392f5928","target":"record","created_at":"2026-05-18T00:20:44Z","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":"1f2ac676ffb310855dcec917375ea1c1cc556175fc046283400c6b2e2e8f5f99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T16:34:41Z","title_canon_sha256":"3b147f415f41cfbd4a53874d2e8c68a7beb38755123eea644eb46224e4d8c3bc"},"schema_version":"1.0","source":{"id":"1703.07301","kind":"arxiv","version":3}},"canonical_sha256":"55f9e888e506a82dddd1fa7e8cd273492c11b37d140d26594c64369d551846d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55f9e888e506a82dddd1fa7e8cd273492c11b37d140d26594c64369d551846d5","first_computed_at":"2026-05-18T00:20:44.732685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:44.732685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G0yCR1Ub7Wymt78Rs9/6WC5JrlKME5DTCFNTXcEHuVwGS95AbsaYpt37DdM82c5Uz6Y01c8+GxWKcXwLcNeIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:44.733358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07301","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:198fc151366e00feecbdfc17c68b54588d38bca32ddb2c76f186cbe4392f5928","sha256:926fb3d5e5e7b613d875b017f82e4eee651706de3df3e52634966fda7a067cef"],"state_sha256":"70c48017d7ed9a5fa000ab1c9c2b5586eb6d21c41267497f12145dc84cf0c9e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3q8mumBQTb5UYxMd8NKqBCIZYx6CP9QLkI6faAuRPaAm0CZ5JGnWuAbexWOmKnzmKiEl76gh4KM5pzEXuU4VCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:25:15.257690Z","bundle_sha256":"6d4bc71bf5850c054b3f38d4b2f79930fc02281f032bb8ebcb09f8aef8630b05"}}