{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:LS5BORKYZBM5HJTEOEXQOFVGPF","short_pith_number":"pith:LS5BORKY","canonical_record":{"source":{"id":"2010.10767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-21T05:25:30Z","cross_cats_sorted":[],"title_canon_sha256":"25cea26c4bb0c5db2d182df13204169be088521220ee830154eb1fae1c65fe31","abstract_canon_sha256":"f37d1c8f683466070d03db68c6578c95547d148f1e7dd301157d2f9daeff71d0"},"schema_version":"1.0"},"canonical_sha256":"5cba174558c859d3a664712f0716a67974a18d20ae530df76a9455814d6a1bc6","source":{"kind":"arxiv","id":"2010.10767","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.10767","created_at":"2026-07-05T01:45:07Z"},{"alias_kind":"arxiv_version","alias_value":"2010.10767v2","created_at":"2026-07-05T01:45:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.10767","created_at":"2026-07-05T01:45:07Z"},{"alias_kind":"pith_short_12","alias_value":"LS5BORKYZBM5","created_at":"2026-07-05T01:45:07Z"},{"alias_kind":"pith_short_16","alias_value":"LS5BORKYZBM5HJTE","created_at":"2026-07-05T01:45:07Z"},{"alias_kind":"pith_short_8","alias_value":"LS5BORKY","created_at":"2026-07-05T01:45:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:LS5BORKYZBM5HJTEOEXQOFVGPF","target":"record","payload":{"canonical_record":{"source":{"id":"2010.10767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-21T05:25:30Z","cross_cats_sorted":[],"title_canon_sha256":"25cea26c4bb0c5db2d182df13204169be088521220ee830154eb1fae1c65fe31","abstract_canon_sha256":"f37d1c8f683466070d03db68c6578c95547d148f1e7dd301157d2f9daeff71d0"},"schema_version":"1.0"},"canonical_sha256":"5cba174558c859d3a664712f0716a67974a18d20ae530df76a9455814d6a1bc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:07.270887Z","signature_b64":"09qrXZCybkj8tNCjm0paEAvWJmxYl5ECXb9sLLv1t3T+VEXu/ZqWK5z6J35DGgML69RYP+cKY0O6qz3tHERfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cba174558c859d3a664712f0716a67974a18d20ae530df76a9455814d6a1bc6","last_reissued_at":"2026-07-05T01:45:07.270376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:07.270376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.10767","source_version":2,"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:45:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ul/6dFuvf8Ki3vViuD9hCKjBNhZieTom2dqbHiSFtlu69ZXgfVHBlfiwW3IL7f0eyy6UGW4f1OMZffFjrD1sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:33:45.680269Z"},"content_sha256":"736c65b2d0b48286b11072da5292d742df4b45aaa3da73a16712e1f8ba614cc5","schema_version":"1.0","event_id":"sha256:736c65b2d0b48286b11072da5292d742df4b45aaa3da73a16712e1f8ba614cc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:LS5BORKYZBM5HJTEOEXQOFVGPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on rainbow cycles in edge-colored graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaozheng Chen, Xueliang Li","submitted_at":"2020-10-21T05:25:30Z","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 all edges of $F$ have pairwise distinct colors. There have been a lot results on rainbow cycles of edge-colored graphs. In this paper, we show that (i) if $\\delta^c(G)>\\frac{3n-3}{4}$, then every vertex of $G$ is contained in a rainbow triangle; (ii) $\\delta^c(G)>\\frac{3n}{4}$, then every vertex of $G$ is contained in a rainbow $C_4$; and (iii) if $G$ is complete, $n\\geq 8k-18$ and $\\delta^c(G)>\\frac{n-1}{2}+k$, then $G$ contains a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.10767","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/2010.10767/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:45:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vbLq7mhTgNLoxN2b/HXpZ4JNZ1gSzhXMH611VAVsah+woD6rYhLCO5d8LPwqb/93d2o438L3RHSk1BTJ9RooBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:33:45.681367Z"},"content_sha256":"689e481e6129e176c019ec6cd8160211caa3b362cc4f8e489990d00276ebe2f5","schema_version":"1.0","event_id":"sha256:689e481e6129e176c019ec6cd8160211caa3b362cc4f8e489990d00276ebe2f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LS5BORKYZBM5HJTEOEXQOFVGPF/bundle.json","state_url":"https://pith.science/pith/LS5BORKYZBM5HJTEOEXQOFVGPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LS5BORKYZBM5HJTEOEXQOFVGPF/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-12T21:33:45Z","links":{"resolver":"https://pith.science/pith/LS5BORKYZBM5HJTEOEXQOFVGPF","bundle":"https://pith.science/pith/LS5BORKYZBM5HJTEOEXQOFVGPF/bundle.json","state":"https://pith.science/pith/LS5BORKYZBM5HJTEOEXQOFVGPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LS5BORKYZBM5HJTEOEXQOFVGPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LS5BORKYZBM5HJTEOEXQOFVGPF","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":"f37d1c8f683466070d03db68c6578c95547d148f1e7dd301157d2f9daeff71d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-21T05:25:30Z","title_canon_sha256":"25cea26c4bb0c5db2d182df13204169be088521220ee830154eb1fae1c65fe31"},"schema_version":"1.0","source":{"id":"2010.10767","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.10767","created_at":"2026-07-05T01:45:07Z"},{"alias_kind":"arxiv_version","alias_value":"2010.10767v2","created_at":"2026-07-05T01:45:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.10767","created_at":"2026-07-05T01:45:07Z"},{"alias_kind":"pith_short_12","alias_value":"LS5BORKYZBM5","created_at":"2026-07-05T01:45:07Z"},{"alias_kind":"pith_short_16","alias_value":"LS5BORKYZBM5HJTE","created_at":"2026-07-05T01:45:07Z"},{"alias_kind":"pith_short_8","alias_value":"LS5BORKY","created_at":"2026-07-05T01:45:07Z"}],"graph_snapshots":[{"event_id":"sha256:689e481e6129e176c019ec6cd8160211caa3b362cc4f8e489990d00276ebe2f5","target":"graph","created_at":"2026-07-05T01:45:07Z","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/2010.10767/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 all edges of $F$ have pairwise distinct colors. There have been a lot results on rainbow cycles of edge-colored graphs. In this paper, we show that (i) if $\\delta^c(G)>\\frac{3n-3}{4}$, then every vertex of $G$ is contained in a rainbow triangle; (ii) $\\delta^c(G)>\\frac{3n}{4}$, then every vertex of $G$ is contained in a rainbow $C_4$; and (iii) if $G$ is complete, $n\\geq 8k-18$ and $\\delta^c(G)>\\frac{n-1}{2}+k$, then $G$ contains a ","authors_text":"Xiaozheng Chen, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-21T05:25:30Z","title":"Note on rainbow cycles in edge-colored graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.10767","kind":"arxiv","version":2},"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:736c65b2d0b48286b11072da5292d742df4b45aaa3da73a16712e1f8ba614cc5","target":"record","created_at":"2026-07-05T01:45:07Z","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":"f37d1c8f683466070d03db68c6578c95547d148f1e7dd301157d2f9daeff71d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-21T05:25:30Z","title_canon_sha256":"25cea26c4bb0c5db2d182df13204169be088521220ee830154eb1fae1c65fe31"},"schema_version":"1.0","source":{"id":"2010.10767","kind":"arxiv","version":2}},"canonical_sha256":"5cba174558c859d3a664712f0716a67974a18d20ae530df76a9455814d6a1bc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cba174558c859d3a664712f0716a67974a18d20ae530df76a9455814d6a1bc6","first_computed_at":"2026-07-05T01:45:07.270376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:45:07.270376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"09qrXZCybkj8tNCjm0paEAvWJmxYl5ECXb9sLLv1t3T+VEXu/ZqWK5z6J35DGgML69RYP+cKY0O6qz3tHERfCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:45:07.270887Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.10767","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:736c65b2d0b48286b11072da5292d742df4b45aaa3da73a16712e1f8ba614cc5","sha256:689e481e6129e176c019ec6cd8160211caa3b362cc4f8e489990d00276ebe2f5"],"state_sha256":"e7dda5aab7d3f9642046d1d1018ffcb2ccbe325133ca42e9f2d832f981a891dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZiwz2e/zHjkhadba3OiIvp0h+6itZm2+h71AU9V5/bfXOaRxPVz2YQTYZhXTfTx/uvVr1Ohe0h7uxbr6PkACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:33:45.690204Z","bundle_sha256":"b1b3dee05cab4ef6ee94d873f8852d4952c405a738d2ebe27f23ae2ad1694204"}}