{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GLWQJFYTB566XVUN62UONUK5L5","short_pith_number":"pith:GLWQJFYT","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"},"canonical_sha256":"32ed0497130f7debd68df6a8e6d15d5f6788f365ba58a7df3a872337fc006442","source":{"kind":"arxiv","id":"2012.01716","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.01716","created_at":"2026-07-05T01:56:49Z"},{"alias_kind":"arxiv_version","alias_value":"2012.01716v1","created_at":"2026-07-05T01:56:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.01716","created_at":"2026-07-05T01:56:49Z"},{"alias_kind":"pith_short_12","alias_value":"GLWQJFYTB566","created_at":"2026-07-05T01:56:49Z"},{"alias_kind":"pith_short_16","alias_value":"GLWQJFYTB566XVUN","created_at":"2026-07-05T01:56:49Z"},{"alias_kind":"pith_short_8","alias_value":"GLWQJFYT","created_at":"2026-07-05T01:56:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GLWQJFYTB566XVUN62UONUK5L5","target":"record","payload":{"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"},"canonical_sha256":"32ed0497130f7debd68df6a8e6d15d5f6788f365ba58a7df3a872337fc006442","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"},"source_kind":"arxiv","source_id":"2012.01716","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:56:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXSArk8Rk7zPziwgec1d/6hOOPA9c8w+WjWoY2lSyGmIrYV545fn8mWyah/aM0VqJP0CdVHcxZjhh/51eSzsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:16:05.607236Z"},"content_sha256":"9c3c77d8cc0b65ab793e291f699407e3d9035e8fa0578defd364ed03398961c9","schema_version":"1.0","event_id":"sha256:9c3c77d8cc0b65ab793e291f699407e3d9035e8fa0578defd364ed03398961c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GLWQJFYTB566XVUN62UONUK5L5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:56:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBcng5Oivbn5s/sugUfrrkVzTxHFcmkUfzxgJxF1txImWIRtnNEyAtGeVe11p3fYrBFAuflCl9LDFJdLpH/oDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:16:05.607740Z"},"content_sha256":"d75780f6ebde375b4c6904db591abe5c652e738c1915c2fa9505f0b3b310b615","schema_version":"1.0","event_id":"sha256:d75780f6ebde375b4c6904db591abe5c652e738c1915c2fa9505f0b3b310b615"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5/bundle.json","state_url":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLWQJFYTB566XVUN62UONUK5L5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T02:16:05Z","links":{"resolver":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5","bundle":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5/bundle.json","state":"https://pith.science/pith/GLWQJFYTB566XVUN62UONUK5L5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLWQJFYTB566XVUN62UONUK5L5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GLWQJFYTB566XVUN62UONUK5L5","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":"0dacdacc422c92d5b8acaaf9f63fdaa6b603aefa84eddf8336349f7eaf860ea3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-12-03T05:51:02Z","title_canon_sha256":"06e37493e12b42cd6cf8ed746b949a0ef32c7ab41190cf5d71c1c15d2245dc0f"},"schema_version":"1.0","source":{"id":"2012.01716","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.01716","created_at":"2026-07-05T01:56:49Z"},{"alias_kind":"arxiv_version","alias_value":"2012.01716v1","created_at":"2026-07-05T01:56:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.01716","created_at":"2026-07-05T01:56:49Z"},{"alias_kind":"pith_short_12","alias_value":"GLWQJFYTB566","created_at":"2026-07-05T01:56:49Z"},{"alias_kind":"pith_short_16","alias_value":"GLWQJFYTB566XVUN","created_at":"2026-07-05T01:56:49Z"},{"alias_kind":"pith_short_8","alias_value":"GLWQJFYT","created_at":"2026-07-05T01:56:49Z"}],"graph_snapshots":[{"event_id":"sha256:d75780f6ebde375b4c6904db591abe5c652e738c1915c2fa9505f0b3b310b615","target":"graph","created_at":"2026-07-05T01:56:49Z","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/2012.01716/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Xiaozheng Chen, Xueliang Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-12-03T05:51:02Z","title":"Rainbow triangles in edge-colored complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.01716","kind":"arxiv","version":1},"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:9c3c77d8cc0b65ab793e291f699407e3d9035e8fa0578defd364ed03398961c9","target":"record","created_at":"2026-07-05T01:56:49Z","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":"0dacdacc422c92d5b8acaaf9f63fdaa6b603aefa84eddf8336349f7eaf860ea3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-12-03T05:51:02Z","title_canon_sha256":"06e37493e12b42cd6cf8ed746b949a0ef32c7ab41190cf5d71c1c15d2245dc0f"},"schema_version":"1.0","source":{"id":"2012.01716","kind":"arxiv","version":1}},"canonical_sha256":"32ed0497130f7debd68df6a8e6d15d5f6788f365ba58a7df3a872337fc006442","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32ed0497130f7debd68df6a8e6d15d5f6788f365ba58a7df3a872337fc006442","first_computed_at":"2026-07-05T01:56:49.337830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:56:49.337830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EjVs+yx8nkzXeeaVUXrEbBb2QSPiNnH0m2SWGn6t5fTC8JbqhyiOs+8ONs/1TYThegbQDeWqcI6I+cBErUhuBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:56:49.338344Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.01716","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c3c77d8cc0b65ab793e291f699407e3d9035e8fa0578defd364ed03398961c9","sha256:d75780f6ebde375b4c6904db591abe5c652e738c1915c2fa9505f0b3b310b615"],"state_sha256":"454b68f3481be0d393cf1d5399bf44fee6070abb24095658092e4e9aedce295d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGowRtqOioHRGKLkO3iaMB3BfB+KIoiOzOsrfEANBx/SopJNQUFr0bK4je4BvR3PS8lxP6oSONsHLqqXYccYCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:16:05.611263Z","bundle_sha256":"053f34a6e1c08af8f4eda0f6ab27557aea51a024980290606afd775d59f72214"}}