{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RH62VOKXYXZXMRQFU72VYBZYXJ","short_pith_number":"pith:RH62VOKX","schema_version":"1.0","canonical_sha256":"89fdaab957c5f3764605a7f55c0738ba7efbfd0e50bd977810d6a7fe2816b82d","source":{"kind":"arxiv","id":"1701.03007","version":1},"attestation_state":"computed","paper":{"title":"Decomposing edge-colored graphs under color degree constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Ruonan Li, Shinya Fujita","submitted_at":"2017-01-11T15:18:45Z","abstract_excerpt":"For an edge-colored graph $G$, the minimum color degree of $G$ means the minimum number of colors on edges which are adjacent to each vertex of $G$. We prove that if $G$ is an edge-colored graph with minimum color degree at least $5$ then $V(G)$ can be partitioned into two parts such that each part induces a subgraph with minimum color degree at least $2$. We show this theorem by proving a much stronger form. Moreover, we point out an important relationship between our theorem and Bermond-Thomassen's conjecture in digraphs."},"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":"1701.03007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T15:18:45Z","cross_cats_sorted":[],"title_canon_sha256":"6d3036e8a34ada156bdbddaafec3e9be14f1864dc9c0c74533a313ae921e57c1","abstract_canon_sha256":"d41c979d20a0d90cae88c9beaf69ec4166c43971a4a54c87800795ecaaddc44d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:59.563711Z","signature_b64":"q5t0lW+RPLhQreDgSVDYoebBpLk+98vS36N8V7KwZ9TVKITcQUBr8BQFfDV6nQai/trv+jRIqKS/vMoJT/K4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89fdaab957c5f3764605a7f55c0738ba7efbfd0e50bd977810d6a7fe2816b82d","last_reissued_at":"2026-05-18T00:52:59.563204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:59.563204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing edge-colored graphs under color degree constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Ruonan Li, Shinya Fujita","submitted_at":"2017-01-11T15:18:45Z","abstract_excerpt":"For an edge-colored graph $G$, the minimum color degree of $G$ means the minimum number of colors on edges which are adjacent to each vertex of $G$. We prove that if $G$ is an edge-colored graph with minimum color degree at least $5$ then $V(G)$ can be partitioned into two parts such that each part induces a subgraph with minimum color degree at least $2$. We show this theorem by proving a much stronger form. Moreover, we point out an important relationship between our theorem and Bermond-Thomassen's conjecture in digraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03007","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":"1701.03007","created_at":"2026-05-18T00:52:59.563281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03007v1","created_at":"2026-05-18T00:52:59.563281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03007","created_at":"2026-05-18T00:52:59.563281+00:00"},{"alias_kind":"pith_short_12","alias_value":"RH62VOKXYXZX","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RH62VOKXYXZXMRQF","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RH62VOKX","created_at":"2026-05-18T12:31:39.905425+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/RH62VOKXYXZXMRQFU72VYBZYXJ","json":"https://pith.science/pith/RH62VOKXYXZXMRQFU72VYBZYXJ.json","graph_json":"https://pith.science/api/pith-number/RH62VOKXYXZXMRQFU72VYBZYXJ/graph.json","events_json":"https://pith.science/api/pith-number/RH62VOKXYXZXMRQFU72VYBZYXJ/events.json","paper":"https://pith.science/paper/RH62VOKX"},"agent_actions":{"view_html":"https://pith.science/pith/RH62VOKXYXZXMRQFU72VYBZYXJ","download_json":"https://pith.science/pith/RH62VOKXYXZXMRQFU72VYBZYXJ.json","view_paper":"https://pith.science/paper/RH62VOKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03007&json=true","fetch_graph":"https://pith.science/api/pith-number/RH62VOKXYXZXMRQFU72VYBZYXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RH62VOKXYXZXMRQFU72VYBZYXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RH62VOKXYXZXMRQFU72VYBZYXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RH62VOKXYXZXMRQFU72VYBZYXJ/action/storage_attestation","attest_author":"https://pith.science/pith/RH62VOKXYXZXMRQFU72VYBZYXJ/action/author_attestation","sign_citation":"https://pith.science/pith/RH62VOKXYXZXMRQFU72VYBZYXJ/action/citation_signature","submit_replication":"https://pith.science/pith/RH62VOKXYXZXMRQFU72VYBZYXJ/action/replication_record"}},"created_at":"2026-05-18T00:52:59.563281+00:00","updated_at":"2026-05-18T00:52:59.563281+00:00"}