{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:V43BIF6PUR7UPS766A5GGXSXIB","short_pith_number":"pith:V43BIF6P","canonical_record":{"source":{"id":"1605.04501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-15T06:45:45Z","cross_cats_sorted":[],"title_canon_sha256":"ddfe0b5b2c46c0dddc0a6924a43be89e00b5878370a9a906cbc2c5486eb72082","abstract_canon_sha256":"102858e70d87dac0280f6fd59e17125177a73e86d9883768713744f4dae68581"},"schema_version":"1.0"},"canonical_sha256":"af361417cfa47f47cbfef03a635e5740470d3cd74f26905bf4f2992966739dc0","source":{"kind":"arxiv","id":"1605.04501","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04501","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04501v2","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04501","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"V43BIF6PUR7U","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V43BIF6PUR7UPS76","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V43BIF6P","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:V43BIF6PUR7UPS766A5GGXSXIB","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-15T06:45:45Z","cross_cats_sorted":[],"title_canon_sha256":"ddfe0b5b2c46c0dddc0a6924a43be89e00b5878370a9a906cbc2c5486eb72082","abstract_canon_sha256":"102858e70d87dac0280f6fd59e17125177a73e86d9883768713744f4dae68581"},"schema_version":"1.0"},"canonical_sha256":"af361417cfa47f47cbfef03a635e5740470d3cd74f26905bf4f2992966739dc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:39.169109Z","signature_b64":"txhxztL6+dysy7UAGQ3wGMuoDN3q+T9vyQuMPkVEDJ6sdxio+SIOFek90n8kC5w3Y8RWVf2VMFiEOfJPWHPkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af361417cfa47f47cbfef03a635e5740470d3cd74f26905bf4f2992966739dc0","last_reissued_at":"2026-05-18T00:16:39.168600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:39.168600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04501","source_version":2,"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:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8JSpBHGbPH4FBU2NZGg8jqRMMvs6NtQRLjt4kfvwACIjmcw/atWHHKC7oUuembh3TDKe+yQuiOotSk/1n/kAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:10:40.768597Z"},"content_sha256":"8f6fac26db2e40bb8f2cf2d36612ebd516f84c1dcbe3c5ea5ff21a58849f24f1","schema_version":"1.0","event_id":"sha256:8f6fac26db2e40bb8f2cf2d36612ebd516f84c1dcbe3c5ea5ff21a58849f24f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:V43BIF6PUR7UPS766A5GGXSXIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Number of Rainbow Spanning Trees in Edge-Colored Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. A. Rodger, Hung-Lin Fu, K. E. Perry, Yuan-Hsun Lo","submitted_at":"2016-05-15T06:45:45Z","abstract_excerpt":"A spanning tree of a properly edge-colored complete graph, $K_n$, is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Hollingsworth conjectured that if $K_{2m}$ is properly $(2m-1)$-edge-colored, then the edges of $K_{2m}$ can be partitioned into $m$ rainbow spanning trees except when $m=2$. By means of an explicit, constructive approach, in this paper we construct $\\lfloor \\sqrt{6m+9}/3 \\rfloor$ mutually edge-disjoint rainbow spanning trees for any positive value of $m$. Not only are the rainbow trees produced, but also some structure of each rainbow spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04501","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"},"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:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZruFAE/cwe/4IttRa6ALoBkU3BBINv6fqQGCd5wiBVmSLjyO3mGFgR6oLNFUiz+UsZbiB/VMfpV0QdOXvJuHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:10:40.768944Z"},"content_sha256":"1066e36caa4b3ecd2a46d382065a2a3b018466c9488e89752bff27c0763eec7b","schema_version":"1.0","event_id":"sha256:1066e36caa4b3ecd2a46d382065a2a3b018466c9488e89752bff27c0763eec7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V43BIF6PUR7UPS766A5GGXSXIB/bundle.json","state_url":"https://pith.science/pith/V43BIF6PUR7UPS766A5GGXSXIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V43BIF6PUR7UPS766A5GGXSXIB/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-24T18:10:40Z","links":{"resolver":"https://pith.science/pith/V43BIF6PUR7UPS766A5GGXSXIB","bundle":"https://pith.science/pith/V43BIF6PUR7UPS766A5GGXSXIB/bundle.json","state":"https://pith.science/pith/V43BIF6PUR7UPS766A5GGXSXIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V43BIF6PUR7UPS766A5GGXSXIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:V43BIF6PUR7UPS766A5GGXSXIB","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":"102858e70d87dac0280f6fd59e17125177a73e86d9883768713744f4dae68581","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-15T06:45:45Z","title_canon_sha256":"ddfe0b5b2c46c0dddc0a6924a43be89e00b5878370a9a906cbc2c5486eb72082"},"schema_version":"1.0","source":{"id":"1605.04501","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04501","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04501v2","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04501","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"V43BIF6PUR7U","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V43BIF6PUR7UPS76","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V43BIF6P","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:1066e36caa4b3ecd2a46d382065a2a3b018466c9488e89752bff27c0763eec7b","target":"graph","created_at":"2026-05-18T00:16:39Z","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 spanning tree of a properly edge-colored complete graph, $K_n$, is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Hollingsworth conjectured that if $K_{2m}$ is properly $(2m-1)$-edge-colored, then the edges of $K_{2m}$ can be partitioned into $m$ rainbow spanning trees except when $m=2$. By means of an explicit, constructive approach, in this paper we construct $\\lfloor \\sqrt{6m+9}/3 \\rfloor$ mutually edge-disjoint rainbow spanning trees for any positive value of $m$. Not only are the rainbow trees produced, but also some structure of each rainbow spa","authors_text":"C. A. Rodger, Hung-Lin Fu, K. E. Perry, Yuan-Hsun Lo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-15T06:45:45Z","title":"On the Number of Rainbow Spanning Trees in Edge-Colored Complete Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04501","kind":"arxiv","version":2},"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:8f6fac26db2e40bb8f2cf2d36612ebd516f84c1dcbe3c5ea5ff21a58849f24f1","target":"record","created_at":"2026-05-18T00:16:39Z","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":"102858e70d87dac0280f6fd59e17125177a73e86d9883768713744f4dae68581","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-15T06:45:45Z","title_canon_sha256":"ddfe0b5b2c46c0dddc0a6924a43be89e00b5878370a9a906cbc2c5486eb72082"},"schema_version":"1.0","source":{"id":"1605.04501","kind":"arxiv","version":2}},"canonical_sha256":"af361417cfa47f47cbfef03a635e5740470d3cd74f26905bf4f2992966739dc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af361417cfa47f47cbfef03a635e5740470d3cd74f26905bf4f2992966739dc0","first_computed_at":"2026-05-18T00:16:39.168600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:39.168600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"txhxztL6+dysy7UAGQ3wGMuoDN3q+T9vyQuMPkVEDJ6sdxio+SIOFek90n8kC5w3Y8RWVf2VMFiEOfJPWHPkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:39.169109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04501","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f6fac26db2e40bb8f2cf2d36612ebd516f84c1dcbe3c5ea5ff21a58849f24f1","sha256:1066e36caa4b3ecd2a46d382065a2a3b018466c9488e89752bff27c0763eec7b"],"state_sha256":"2b73ec55564497033adafe7765d2037247ecaa49d91be2968e61b0791ea7b57a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NM9QWB0twF7WwfXBSl+kmsbgEE9cvrUkPNhO9/b2cHSb10hrkW+lHB5uVqgVblW+0TimHOlRry1+WH7RAJX+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:10:40.770891Z","bundle_sha256":"72cefbfa12a0b7372e7a891c5c14913c87b62b614928d6b2005f4da7bb60545e"}}