{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XQW5ZBKFOYITEUHXDEZDKMQZ5Q","short_pith_number":"pith:XQW5ZBKF","canonical_record":{"source":{"id":"1704.07200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-24T13:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"c5a0cc9ced821783ba54bcc06c90fe42382cbce1bf46a45a4a4e56024d86f4cc","abstract_canon_sha256":"e04e64cb4b9f20affb9db14e175ce72b34e70b837bdbdf920672a0b2ce280ddd"},"schema_version":"1.0"},"canonical_sha256":"bc2ddc854576113250f71932353219ec2d1f32066191d474238c1a58d8485f7b","source":{"kind":"arxiv","id":"1704.07200","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07200","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07200v1","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07200","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"XQW5ZBKFOYIT","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XQW5ZBKFOYITEUHX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XQW5ZBKF","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XQW5ZBKFOYITEUHXDEZDKMQZ5Q","target":"record","payload":{"canonical_record":{"source":{"id":"1704.07200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-24T13:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"c5a0cc9ced821783ba54bcc06c90fe42382cbce1bf46a45a4a4e56024d86f4cc","abstract_canon_sha256":"e04e64cb4b9f20affb9db14e175ce72b34e70b837bdbdf920672a0b2ce280ddd"},"schema_version":"1.0"},"canonical_sha256":"bc2ddc854576113250f71932353219ec2d1f32066191d474238c1a58d8485f7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:53.235653Z","signature_b64":"T/V0s6LM4FA7IXlVvqQDFfLw7JxxkyPPpFMPMGsxKDgKupmzq8lN7OENsRKpoR7nZSXrY5wGFa4oce7/BXjvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc2ddc854576113250f71932353219ec2d1f32066191d474238c1a58d8485f7b","last_reissued_at":"2026-05-18T00:45:53.234986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:53.234986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.07200","source_version":1,"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:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLFeiIt8tflJnQtM1UpFwV4VZ5dFlyd1Q0ax53Zh6alkmRb7r6CDtOWo0Dft40xeiFiHn4N8iN9phP+6ZPZ8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:45:25.205571Z"},"content_sha256":"f69a7ef12581d66c62f494f13900f3c61fd6b60f2d4381f047a207bfba85a387","schema_version":"1.0","event_id":"sha256:f69a7ef12581d66c62f494f13900f3c61fd6b60f2d4381f047a207bfba85a387"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XQW5ZBKFOYITEUHXDEZDKMQZ5Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow spanning trees in properly coloured complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, J\\'ozsef Balogh, Richard Montgomery","submitted_at":"2017-04-24T13:07:07Z","abstract_excerpt":"In this short note, we study pairwise edge-disjoint rainbow spanning trees in properly edge-coloured complete graphs, where a graph is rainbow if its edges have distinct colours. Brualdi and Hollingsworth conjectured that every $K_n$ properly edge-coloured by $n-1$ colours has $n/2$ edge-disjoint rainbow spanning trees. Kaneko, Kano and Suzuki later suggested this should hold for every properly edge-coloured $K_n$. Improving the previous best known bound, we show that every properly edge-coloured $K_n$ contains $\\Omega(n)$ pairwise edge-disjoint rainbow spanning trees.\n  Independently, Pokrovs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07200","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"},"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:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/PR/Yzv+VR9RJa0NSk/Ke/VS6su8Vq3BujsTt+oh1cCiSTTxkHsF0bsxevwOwsF0AdIab4TcqWo+ZOTPQhW6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:45:25.205917Z"},"content_sha256":"69ccd57aa0fc650a8a92acd6ee10d60cd8b1f5a21cb10bfaac99d769403ab874","schema_version":"1.0","event_id":"sha256:69ccd57aa0fc650a8a92acd6ee10d60cd8b1f5a21cb10bfaac99d769403ab874"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQW5ZBKFOYITEUHXDEZDKMQZ5Q/bundle.json","state_url":"https://pith.science/pith/XQW5ZBKFOYITEUHXDEZDKMQZ5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQW5ZBKFOYITEUHXDEZDKMQZ5Q/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-06-03T02:45:25Z","links":{"resolver":"https://pith.science/pith/XQW5ZBKFOYITEUHXDEZDKMQZ5Q","bundle":"https://pith.science/pith/XQW5ZBKFOYITEUHXDEZDKMQZ5Q/bundle.json","state":"https://pith.science/pith/XQW5ZBKFOYITEUHXDEZDKMQZ5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQW5ZBKFOYITEUHXDEZDKMQZ5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XQW5ZBKFOYITEUHXDEZDKMQZ5Q","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":"e04e64cb4b9f20affb9db14e175ce72b34e70b837bdbdf920672a0b2ce280ddd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-24T13:07:07Z","title_canon_sha256":"c5a0cc9ced821783ba54bcc06c90fe42382cbce1bf46a45a4a4e56024d86f4cc"},"schema_version":"1.0","source":{"id":"1704.07200","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07200","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07200v1","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07200","created_at":"2026-05-18T00:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"XQW5ZBKFOYIT","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XQW5ZBKFOYITEUHX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XQW5ZBKF","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:69ccd57aa0fc650a8a92acd6ee10d60cd8b1f5a21cb10bfaac99d769403ab874","target":"graph","created_at":"2026-05-18T00:45:53Z","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":"In this short note, we study pairwise edge-disjoint rainbow spanning trees in properly edge-coloured complete graphs, where a graph is rainbow if its edges have distinct colours. Brualdi and Hollingsworth conjectured that every $K_n$ properly edge-coloured by $n-1$ colours has $n/2$ edge-disjoint rainbow spanning trees. Kaneko, Kano and Suzuki later suggested this should hold for every properly edge-coloured $K_n$. Improving the previous best known bound, we show that every properly edge-coloured $K_n$ contains $\\Omega(n)$ pairwise edge-disjoint rainbow spanning trees.\n  Independently, Pokrovs","authors_text":"Hong Liu, J\\'ozsef Balogh, Richard Montgomery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-24T13:07:07Z","title":"Rainbow spanning trees in properly coloured complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07200","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:f69a7ef12581d66c62f494f13900f3c61fd6b60f2d4381f047a207bfba85a387","target":"record","created_at":"2026-05-18T00:45:53Z","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":"e04e64cb4b9f20affb9db14e175ce72b34e70b837bdbdf920672a0b2ce280ddd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-24T13:07:07Z","title_canon_sha256":"c5a0cc9ced821783ba54bcc06c90fe42382cbce1bf46a45a4a4e56024d86f4cc"},"schema_version":"1.0","source":{"id":"1704.07200","kind":"arxiv","version":1}},"canonical_sha256":"bc2ddc854576113250f71932353219ec2d1f32066191d474238c1a58d8485f7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc2ddc854576113250f71932353219ec2d1f32066191d474238c1a58d8485f7b","first_computed_at":"2026-05-18T00:45:53.234986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:53.234986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T/V0s6LM4FA7IXlVvqQDFfLw7JxxkyPPpFMPMGsxKDgKupmzq8lN7OENsRKpoR7nZSXrY5wGFa4oce7/BXjvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:53.235653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07200","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f69a7ef12581d66c62f494f13900f3c61fd6b60f2d4381f047a207bfba85a387","sha256:69ccd57aa0fc650a8a92acd6ee10d60cd8b1f5a21cb10bfaac99d769403ab874"],"state_sha256":"922aa2a289dd28fe5c2d682b019f7e77d7f8e4015aeac6dbbef985605ef5d64d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rIKYak2+WaNuM0pk+RC7Fv1tabZmMbdi9axLwW/22CGHwYfnvTTEALJM4PvYFYNa0I5FRaoXbAxmMaHWmtNhBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:45:25.207802Z","bundle_sha256":"aba25eb757fa2dbad11d330a6b877b49664c8704b89fa17741f0807fa9121494"}}