{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:BNG6NWNO7LSNF52CXM5WPESZFS","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":"51def5cded45266bcc786f2f289f3e110406db7bc5190d3a79bb85c92657d16c","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2008-01-01T03:48:33Z","title_canon_sha256":"827c0314632806d925e9b57afbe3f149c50bb79fc33d15d78a26528f6d2818b7"},"schema_version":"1.0","source":{"id":"0801.0270","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.0270","created_at":"2026-07-04T15:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"0801.0270v2","created_at":"2026-07-04T15:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.0270","created_at":"2026-07-04T15:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"BNG6NWNO7LSN","created_at":"2026-07-04T15:06:34Z"},{"alias_kind":"pith_short_16","alias_value":"BNG6NWNO7LSNF52C","created_at":"2026-07-04T15:06:34Z"},{"alias_kind":"pith_short_8","alias_value":"BNG6NWNO","created_at":"2026-07-04T15:06:34Z"}],"graph_snapshots":[{"event_id":"sha256:745843989b05cb168a136564f807b2dfb323a8bbafa1848b667c6b86ab7f2ce3","target":"graph","created_at":"2026-07-04T15:06:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0801.0270/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The monochromatic tree partition number of an $r$-edge-colored graph $G$, denoted by $t_r(G)$, is the minimum integer $k$ such that whenever the edges of $G$ are colored with $r$ colors, the vertices of $G$ can be covered by at most $k$ vertex-disjoint monochromatic trees. In general, to determine this number is very difficult. For 2-edge-colored complete multipartite graph, Kaneko, Kano, and Suzuki gave the exact value of $t_2(K(n_1,n_2,...,n_k))$. In this paper, we prove that if $n\\geq 3$, and K(n,n) is 3-edge-colored such that every vertex has color degree 3, then $t_3(K(n,n))=3.$","authors_text":"Fengxia Liu, Xueliang Li","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2008-01-01T03:48:33Z","title":"Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.0270","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:e9a8e61720ed0ed9b09453a07f3d4e03deafdafa2a0e8da62c0cec9d96f84dfa","target":"record","created_at":"2026-07-04T15:06:34Z","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":"51def5cded45266bcc786f2f289f3e110406db7bc5190d3a79bb85c92657d16c","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2008-01-01T03:48:33Z","title_canon_sha256":"827c0314632806d925e9b57afbe3f149c50bb79fc33d15d78a26528f6d2818b7"},"schema_version":"1.0","source":{"id":"0801.0270","kind":"arxiv","version":2}},"canonical_sha256":"0b4de6d9aefae4d2f742bb3b6792592c9096b64b99b881d8868004404ab8bb01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b4de6d9aefae4d2f742bb3b6792592c9096b64b99b881d8868004404ab8bb01","first_computed_at":"2026-07-04T15:06:34.343779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:06:34.343779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kJkJkd+vsvuR2avOhNCXw8ibQzXfUMfCnwMVa3mU4Pi8qOMQPIP6wcLQlaDrU6i3Ej7PHjxVrTbA6un+CGvRCg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:06:34.344198Z","signed_message":"canonical_sha256_bytes"},"source_id":"0801.0270","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9a8e61720ed0ed9b09453a07f3d4e03deafdafa2a0e8da62c0cec9d96f84dfa","sha256:745843989b05cb168a136564f807b2dfb323a8bbafa1848b667c6b86ab7f2ce3"],"state_sha256":"e1c5a02c2f9ea520a66cfca77cf1e9701eac405aaf6856dbd476d96d9e7f06cb"}