{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GLWQJFYTB566XVUN62UONUK5L5","short_pith_number":"pith:GLWQJFYT","schema_version":"1.0","canonical_sha256":"32ed0497130f7debd68df6a8e6d15d5f6788f365ba58a7df3a872337fc006442","source":{"kind":"arxiv","id":"2012.01716","version":1},"attestation_state":"computed","paper":{"title":"Rainbow triangles in edge-colored complete graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaozheng Chen, Xueliang Li","submitted_at":"2020-12-03T05:51:02Z","abstract_excerpt":"Let $G$ be a graph of order $n$ with an edge-coloring $c$, and let $\\delta^c(G)$ denote the minimum color-degree of $G$. A subgraph $F$ of $G$ is called rainbow if any two edges of $F$ have distinct colors. There have been a lot results in the existing literature on rainbow triangles in edge-colored complete graphs. Fujita and Magnant showed that for an edge-colored complete graph $G$ of order $n$, if $\\delta^c(G)\\geq \\frac{n+1}{2}$, then every vertex of $G$ is contained in a rainbow triangle. In this paper, we show that if $\\delta^c(G)\\geq \\frac{n+k}{2}$, then every vertex of $G$ is contained"},"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":"2012.01716","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-12-03T05:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"06e37493e12b42cd6cf8ed746b949a0ef32c7ab41190cf5d71c1c15d2245dc0f","abstract_canon_sha256":"0dacdacc422c92d5b8acaaf9f63fdaa6b603aefa84eddf8336349f7eaf860ea3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:56:49.338344Z","signature_b64":"EjVs+yx8nkzXeeaVUXrEbBb2QSPiNnH0m2SWGn6t5fTC8JbqhyiOs+8ONs/1TYThegbQDeWqcI6I+cBErUhuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32ed0497130f7debd68df6a8e6d15d5f6788f365ba58a7df3a872337fc006442","last_reissued_at":"2026-07-05T01:56:49.337830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:56:49.337830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow triangles in edge-colored complete graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaozheng Chen, Xueliang Li","submitted_at":"2020-12-03T05:51:02Z","abstract_excerpt":"Let $G$ be a graph of order $n$ with an edge-coloring $c$, and let $\\delta^c(G)$ denote the minimum color-degree of $G$. A subgraph $F$ of $G$ is called rainbow if any two edges of $F$ have distinct colors. There have been a lot results in the existing literature on rainbow triangles in edge-colored complete graphs. Fujita and Magnant showed that for an edge-colored complete graph $G$ of order $n$, if $\\delta^c(G)\\geq \\frac{n+1}{2}$, then every vertex of $G$ is contained in a rainbow triangle. In this paper, we show that if $\\delta^c(G)\\geq \\frac{n+k}{2}$, then every vertex of $G$ is contained"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.01716","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.01716/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":"2012.01716","created_at":"2026-07-05T01:56:49.337886+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.01716v1","created_at":"2026-07-05T01:56:49.337886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.01716","created_at":"2026-07-05T01:56:49.337886+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLWQJFYTB566","created_at":"2026-07-05T01:56:49.337886+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLWQJFYTB566XVUN","created_at":"2026-07-05T01:56:49.337886+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLWQJFYT","created_at":"2026-07-05T01:56:49.337886+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/GLWQJFYTB566XVUN62UONUK5L5","json":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5.json","graph_json":"https://pith.science/api/pith-number/GLWQJFYTB566XVUN62UONUK5L5/graph.json","events_json":"https://pith.science/api/pith-number/GLWQJFYTB566XVUN62UONUK5L5/events.json","paper":"https://pith.science/paper/GLWQJFYT"},"agent_actions":{"view_html":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5","download_json":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5.json","view_paper":"https://pith.science/paper/GLWQJFYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.01716&json=true","fetch_graph":"https://pith.science/api/pith-number/GLWQJFYTB566XVUN62UONUK5L5/graph.json","fetch_events":"https://pith.science/api/pith-number/GLWQJFYTB566XVUN62UONUK5L5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5/action/storage_attestation","attest_author":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5/action/author_attestation","sign_citation":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5/action/citation_signature","submit_replication":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5/action/replication_record"}},"created_at":"2026-07-05T01:56:49.337886+00:00","updated_at":"2026-07-05T01:56:49.337886+00:00"}