{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BNGJSGB2QIA6QATY65UFUBW5TQ","short_pith_number":"pith:BNGJSGB2","schema_version":"1.0","canonical_sha256":"0b4c99183a8201e80278f7685a06dd9c3b3ec22e4a9d9a1b075ece4d89cad07e","source":{"kind":"arxiv","id":"1410.0445","version":1},"attestation_state":"computed","paper":{"title":"Multicolored Isomorphic Spanning Trees in Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hung-Lin Fu, Yuan-Hsun Lo","submitted_at":"2014-10-02T03:09:09Z","abstract_excerpt":"In this paper, we first prove that if the edges of $K_{2m}$ are properly colored by $2m-1$ colors in such a way that any two colors induce a 2-factor of which each component is a 4-cycle, then $K_{2m}$ can be decomposed into $m$ isomorphic multicolored spanning trees. Consequently, we show that there exist three disjoint isomorphic multicolored spanning trees in any properly (2$m-$1)-edge-colored $K_{2m}$ for $m\\geq 14$."},"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":"1410.0445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-02T03:09:09Z","cross_cats_sorted":[],"title_canon_sha256":"503e7a14558ea1e913640e4622c0998fee5d25afb17c5e4700b68c6aa96df161","abstract_canon_sha256":"c407f9dcfce55287eed3da2df7d02c7c74f388d266588f12c93e12afcf537aac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:53.406410Z","signature_b64":"5xHaLf80/xzuZ7WoNmZUXDhenPS7EwYkob8wKLpXOIddGEQ1MwxbH98ezwSjxYmHZcMGDA8LGXnqmjlfjBm6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b4c99183a8201e80278f7685a06dd9c3b3ec22e4a9d9a1b075ece4d89cad07e","last_reissued_at":"2026-05-18T01:14:53.405925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:53.405925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicolored Isomorphic Spanning Trees in Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hung-Lin Fu, Yuan-Hsun Lo","submitted_at":"2014-10-02T03:09:09Z","abstract_excerpt":"In this paper, we first prove that if the edges of $K_{2m}$ are properly colored by $2m-1$ colors in such a way that any two colors induce a 2-factor of which each component is a 4-cycle, then $K_{2m}$ can be decomposed into $m$ isomorphic multicolored spanning trees. Consequently, we show that there exist three disjoint isomorphic multicolored spanning trees in any properly (2$m-$1)-edge-colored $K_{2m}$ for $m\\geq 14$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0445","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.0445","created_at":"2026-05-18T01:14:53.405991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0445v1","created_at":"2026-05-18T01:14:53.405991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0445","created_at":"2026-05-18T01:14:53.405991+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNGJSGB2QIA6","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNGJSGB2QIA6QATY","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNGJSGB2","created_at":"2026-05-18T12:28:22.404517+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/BNGJSGB2QIA6QATY65UFUBW5TQ","json":"https://pith.science/pith/BNGJSGB2QIA6QATY65UFUBW5TQ.json","graph_json":"https://pith.science/api/pith-number/BNGJSGB2QIA6QATY65UFUBW5TQ/graph.json","events_json":"https://pith.science/api/pith-number/BNGJSGB2QIA6QATY65UFUBW5TQ/events.json","paper":"https://pith.science/paper/BNGJSGB2"},"agent_actions":{"view_html":"https://pith.science/pith/BNGJSGB2QIA6QATY65UFUBW5TQ","download_json":"https://pith.science/pith/BNGJSGB2QIA6QATY65UFUBW5TQ.json","view_paper":"https://pith.science/paper/BNGJSGB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0445&json=true","fetch_graph":"https://pith.science/api/pith-number/BNGJSGB2QIA6QATY65UFUBW5TQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BNGJSGB2QIA6QATY65UFUBW5TQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNGJSGB2QIA6QATY65UFUBW5TQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNGJSGB2QIA6QATY65UFUBW5TQ/action/storage_attestation","attest_author":"https://pith.science/pith/BNGJSGB2QIA6QATY65UFUBW5TQ/action/author_attestation","sign_citation":"https://pith.science/pith/BNGJSGB2QIA6QATY65UFUBW5TQ/action/citation_signature","submit_replication":"https://pith.science/pith/BNGJSGB2QIA6QATY65UFUBW5TQ/action/replication_record"}},"created_at":"2026-05-18T01:14:53.405991+00:00","updated_at":"2026-05-18T01:14:53.405991+00:00"}