{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:BNG6NWNO7LSNF52CXM5WPESZFS","short_pith_number":"pith:BNG6NWNO","schema_version":"1.0","canonical_sha256":"0b4de6d9aefae4d2f742bb3b6792592c9096b64b99b881d8868004404ab8bb01","source":{"kind":"arxiv","id":"0801.0270","version":2},"attestation_state":"computed","paper":{"title":"Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengxia Liu, Xueliang Li","submitted_at":"2008-01-01T03:48:33Z","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.$"},"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":"0801.0270","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2008-01-01T03:48:33Z","cross_cats_sorted":[],"title_canon_sha256":"827c0314632806d925e9b57afbe3f149c50bb79fc33d15d78a26528f6d2818b7","abstract_canon_sha256":"51def5cded45266bcc786f2f289f3e110406db7bc5190d3a79bb85c92657d16c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:06:34.344198Z","signature_b64":"kJkJkd+vsvuR2avOhNCXw8ibQzXfUMfCnwMVa3mU4Pi8qOMQPIP6wcLQlaDrU6i3Ej7PHjxVrTbA6un+CGvRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b4de6d9aefae4d2f742bb3b6792592c9096b64b99b881d8868004404ab8bb01","last_reissued_at":"2026-07-04T15:06:34.343779Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:06:34.343779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengxia Liu, Xueliang Li","submitted_at":"2008-01-01T03:48:33Z","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.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.0270","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0801.0270/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0801.0270","created_at":"2026-07-04T15:06:34.343851+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.0270v2","created_at":"2026-07-04T15:06:34.343851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.0270","created_at":"2026-07-04T15:06:34.343851+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNG6NWNO7LSN","created_at":"2026-07-04T15:06:34.343851+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNG6NWNO7LSNF52C","created_at":"2026-07-04T15:06:34.343851+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNG6NWNO","created_at":"2026-07-04T15:06:34.343851+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/BNG6NWNO7LSNF52CXM5WPESZFS","json":"https://pith.science/pith/BNG6NWNO7LSNF52CXM5WPESZFS.json","graph_json":"https://pith.science/api/pith-number/BNG6NWNO7LSNF52CXM5WPESZFS/graph.json","events_json":"https://pith.science/api/pith-number/BNG6NWNO7LSNF52CXM5WPESZFS/events.json","paper":"https://pith.science/paper/BNG6NWNO"},"agent_actions":{"view_html":"https://pith.science/pith/BNG6NWNO7LSNF52CXM5WPESZFS","download_json":"https://pith.science/pith/BNG6NWNO7LSNF52CXM5WPESZFS.json","view_paper":"https://pith.science/paper/BNG6NWNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.0270&json=true","fetch_graph":"https://pith.science/api/pith-number/BNG6NWNO7LSNF52CXM5WPESZFS/graph.json","fetch_events":"https://pith.science/api/pith-number/BNG6NWNO7LSNF52CXM5WPESZFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNG6NWNO7LSNF52CXM5WPESZFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNG6NWNO7LSNF52CXM5WPESZFS/action/storage_attestation","attest_author":"https://pith.science/pith/BNG6NWNO7LSNF52CXM5WPESZFS/action/author_attestation","sign_citation":"https://pith.science/pith/BNG6NWNO7LSNF52CXM5WPESZFS/action/citation_signature","submit_replication":"https://pith.science/pith/BNG6NWNO7LSNF52CXM5WPESZFS/action/replication_record"}},"created_at":"2026-07-04T15:06:34.343851+00:00","updated_at":"2026-07-04T15:06:34.343851+00:00"}