{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CA3HIRY4754LYGGCFLPWCI5DEP","short_pith_number":"pith:CA3HIRY4","schema_version":"1.0","canonical_sha256":"103674471cff78bc18c22adf6123a323dc86000111c6b7e03749b0797c2c569d","source":{"kind":"arxiv","id":"1212.6348","version":2},"attestation_state":"computed","paper":{"title":"Rainbow triangles in edge-colored graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Bo Ning, Chuandong Xu, Shenggui Zhang","submitted_at":"2012-12-27T11:22:56Z","abstract_excerpt":"Let $G$ be an edge-colored graph. The color degree of a vertex $v$ of $G$, is defined as the number of colors of the edges incident to $v$. The color number of $G$ is defined as the number of colors of the edges in $G$. A rainbow triangle is one in which every pair of edges have distinct colors. In this paper we give some sufficient conditions for the existence of rainbow triangles in edge-colored graphs in terms of color degree, color number and edge number. As a corollary, a conjecture proposed by Li and Wang (Color degree and heterochromatic cycles in edge-colored graphs, European J. Combin"},"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":"1212.6348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-27T11:22:56Z","cross_cats_sorted":[],"title_canon_sha256":"9b18f289e6fb79d0a85432e8985c6e94e62a50b307f181e0c57c65652b6563b9","abstract_canon_sha256":"4e17375f529a698e5671e97d00430b9fc933aadd30a48b9f50182b9332d2d802"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:58.016716Z","signature_b64":"me+Vsg0AlFHLCZi51/T/Tp0TUFgHTpdrgPzFlctvRwk4fyhypI8RkFZVdfDTdv7BmD8ZNEb879beW/zrZxZEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"103674471cff78bc18c22adf6123a323dc86000111c6b7e03749b0797c2c569d","last_reissued_at":"2026-05-18T01:11:58.016383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:58.016383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow triangles in edge-colored graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Bo Ning, Chuandong Xu, Shenggui Zhang","submitted_at":"2012-12-27T11:22:56Z","abstract_excerpt":"Let $G$ be an edge-colored graph. The color degree of a vertex $v$ of $G$, is defined as the number of colors of the edges incident to $v$. The color number of $G$ is defined as the number of colors of the edges in $G$. A rainbow triangle is one in which every pair of edges have distinct colors. In this paper we give some sufficient conditions for the existence of rainbow triangles in edge-colored graphs in terms of color degree, color number and edge number. As a corollary, a conjecture proposed by Li and Wang (Color degree and heterochromatic cycles in edge-colored graphs, European J. Combin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6348","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.6348","created_at":"2026-05-18T01:11:58.016438+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6348v2","created_at":"2026-05-18T01:11:58.016438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6348","created_at":"2026-05-18T01:11:58.016438+00:00"},{"alias_kind":"pith_short_12","alias_value":"CA3HIRY4754L","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CA3HIRY4754LYGGC","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CA3HIRY4","created_at":"2026-05-18T12:27:01.376967+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/CA3HIRY4754LYGGCFLPWCI5DEP","json":"https://pith.science/pith/CA3HIRY4754LYGGCFLPWCI5DEP.json","graph_json":"https://pith.science/api/pith-number/CA3HIRY4754LYGGCFLPWCI5DEP/graph.json","events_json":"https://pith.science/api/pith-number/CA3HIRY4754LYGGCFLPWCI5DEP/events.json","paper":"https://pith.science/paper/CA3HIRY4"},"agent_actions":{"view_html":"https://pith.science/pith/CA3HIRY4754LYGGCFLPWCI5DEP","download_json":"https://pith.science/pith/CA3HIRY4754LYGGCFLPWCI5DEP.json","view_paper":"https://pith.science/paper/CA3HIRY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6348&json=true","fetch_graph":"https://pith.science/api/pith-number/CA3HIRY4754LYGGCFLPWCI5DEP/graph.json","fetch_events":"https://pith.science/api/pith-number/CA3HIRY4754LYGGCFLPWCI5DEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CA3HIRY4754LYGGCFLPWCI5DEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CA3HIRY4754LYGGCFLPWCI5DEP/action/storage_attestation","attest_author":"https://pith.science/pith/CA3HIRY4754LYGGCFLPWCI5DEP/action/author_attestation","sign_citation":"https://pith.science/pith/CA3HIRY4754LYGGCFLPWCI5DEP/action/citation_signature","submit_replication":"https://pith.science/pith/CA3HIRY4754LYGGCFLPWCI5DEP/action/replication_record"}},"created_at":"2026-05-18T01:11:58.016438+00:00","updated_at":"2026-05-18T01:11:58.016438+00:00"}