{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SVTFQG33ARD6XNR436Q4Y3YDTS","short_pith_number":"pith:SVTFQG33","canonical_record":{"source":{"id":"2606.22106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T15:40:42Z","cross_cats_sorted":[],"title_canon_sha256":"1fe61284d573152690d78d609fd80cd9f0227f3284f97713a1ee6ba1c43e0094","abstract_canon_sha256":"39ae401dd8dd8a17077da650065f4ee4aaf49e211760c6cae3da42a175b46107"},"schema_version":"1.0"},"canonical_sha256":"9566581b7b0447ebb63cdfa1cc6f039cbba3f8093ae7198909490ff170800365","source":{"kind":"arxiv","id":"2606.22106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22106","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22106v1","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22106","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_12","alias_value":"SVTFQG33ARD6","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_16","alias_value":"SVTFQG33ARD6XNR4","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_8","alias_value":"SVTFQG33","created_at":"2026-06-23T02:13:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SVTFQG33ARD6XNR436Q4Y3YDTS","target":"record","payload":{"canonical_record":{"source":{"id":"2606.22106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T15:40:42Z","cross_cats_sorted":[],"title_canon_sha256":"1fe61284d573152690d78d609fd80cd9f0227f3284f97713a1ee6ba1c43e0094","abstract_canon_sha256":"39ae401dd8dd8a17077da650065f4ee4aaf49e211760c6cae3da42a175b46107"},"schema_version":"1.0"},"canonical_sha256":"9566581b7b0447ebb63cdfa1cc6f039cbba3f8093ae7198909490ff170800365","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:28.373063Z","signature_b64":"+JDGmZSNYmjg8Imf5/hTTJFD/j0juHO774JFcXRTJ64v5J6sGLiA9owdj2ugyYbJTjJENuN/C0rlKyf3icJgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9566581b7b0447ebb63cdfa1cc6f039cbba3f8093ae7198909490ff170800365","last_reissued_at":"2026-06-23T02:13:28.372698Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:28.372698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.22106","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-06-23T02:13:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIstLN+9RiJVzz7O8Nl8YlFPFmMQxwMv0uov3tsbLkMqfZsApCADaeCkEXhxK3Z6Nt03IzDaU6/4Mv5hePasDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:50:09.161020Z"},"content_sha256":"1b0caad390d292b7aa307e34a6821a440bf5045199252217468e8244b584c5ca","schema_version":"1.0","event_id":"sha256:1b0caad390d292b7aa307e34a6821a440bf5045199252217468e8244b584c5ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SVTFQG33ARD6XNR436Q4Y3YDTS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow triangles in edge-colored graphs with large minimum color degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Yuting Tian","submitted_at":"2026-06-20T15:40:42Z","abstract_excerpt":"Let $G$ be an edge-colored graph on $n$ vertices, and let $\\deltac(G)$ denote its minimum color degree. Li and, independently Li, Ning, Xu, and Zhang, proved that every edge-colored graph on $n$ vertices with $\\deltac(G) \\ge \\frac{n+1}{2}$ contains a rainbow triangle. Let $\\rt(G)$ denote the number of rainbow triangles in $G$, and define \\[ f(n) = \\min\\{ \\rt(G) : |V(G)| = n,\\ \\deltac(G) \\ge (n+1)/2 \\}. \\] In \\cite{LiNingShiZhang2024}, the following open problem was posed: determine all the values of $f(n)$. In this paper, we determine $f(n)$ completely: $f(n) = (n^2-1)/8$ for odd $n\\geq 3$, $f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22106","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/2606.22106/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-06-23T02:13:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wg8fdvgzQfEH7MKXYTnAOKbQciTivkWV0R3Jo8efSJWl5xWgUPyqGZX0T4ZVPHdu9JxMcHNaSGPRCU9cTgKXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:50:09.161414Z"},"content_sha256":"dbbd05fdbdbd0f06653f7991a5346dc52376d2dad0d6d1c6b8b5b72c533a852e","schema_version":"1.0","event_id":"sha256:dbbd05fdbdbd0f06653f7991a5346dc52376d2dad0d6d1c6b8b5b72c533a852e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVTFQG33ARD6XNR436Q4Y3YDTS/bundle.json","state_url":"https://pith.science/pith/SVTFQG33ARD6XNR436Q4Y3YDTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVTFQG33ARD6XNR436Q4Y3YDTS/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-07-03T19:50:09Z","links":{"resolver":"https://pith.science/pith/SVTFQG33ARD6XNR436Q4Y3YDTS","bundle":"https://pith.science/pith/SVTFQG33ARD6XNR436Q4Y3YDTS/bundle.json","state":"https://pith.science/pith/SVTFQG33ARD6XNR436Q4Y3YDTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVTFQG33ARD6XNR436Q4Y3YDTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SVTFQG33ARD6XNR436Q4Y3YDTS","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":"39ae401dd8dd8a17077da650065f4ee4aaf49e211760c6cae3da42a175b46107","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T15:40:42Z","title_canon_sha256":"1fe61284d573152690d78d609fd80cd9f0227f3284f97713a1ee6ba1c43e0094"},"schema_version":"1.0","source":{"id":"2606.22106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22106","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22106v1","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22106","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_12","alias_value":"SVTFQG33ARD6","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_16","alias_value":"SVTFQG33ARD6XNR4","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_8","alias_value":"SVTFQG33","created_at":"2026-06-23T02:13:28Z"}],"graph_snapshots":[{"event_id":"sha256:dbbd05fdbdbd0f06653f7991a5346dc52376d2dad0d6d1c6b8b5b72c533a852e","target":"graph","created_at":"2026-06-23T02:13:28Z","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/2606.22106/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be an edge-colored graph on $n$ vertices, and let $\\deltac(G)$ denote its minimum color degree. Li and, independently Li, Ning, Xu, and Zhang, proved that every edge-colored graph on $n$ vertices with $\\deltac(G) \\ge \\frac{n+1}{2}$ contains a rainbow triangle. Let $\\rt(G)$ denote the number of rainbow triangles in $G$, and define \\[ f(n) = \\min\\{ \\rt(G) : |V(G)| = n,\\ \\deltac(G) \\ge (n+1)/2 \\}. \\] In \\cite{LiNingShiZhang2024}, the following open problem was posed: determine all the values of $f(n)$. In this paper, we determine $f(n)$ completely: $f(n) = (n^2-1)/8$ for odd $n\\geq 3$, $f","authors_text":"Bo Ning, Yuting Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T15:40:42Z","title":"Rainbow triangles in edge-colored graphs with large minimum color degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22106","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:1b0caad390d292b7aa307e34a6821a440bf5045199252217468e8244b584c5ca","target":"record","created_at":"2026-06-23T02:13:28Z","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":"39ae401dd8dd8a17077da650065f4ee4aaf49e211760c6cae3da42a175b46107","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T15:40:42Z","title_canon_sha256":"1fe61284d573152690d78d609fd80cd9f0227f3284f97713a1ee6ba1c43e0094"},"schema_version":"1.0","source":{"id":"2606.22106","kind":"arxiv","version":1}},"canonical_sha256":"9566581b7b0447ebb63cdfa1cc6f039cbba3f8093ae7198909490ff170800365","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9566581b7b0447ebb63cdfa1cc6f039cbba3f8093ae7198909490ff170800365","first_computed_at":"2026-06-23T02:13:28.372698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:28.372698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+JDGmZSNYmjg8Imf5/hTTJFD/j0juHO774JFcXRTJ64v5J6sGLiA9owdj2ugyYbJTjJENuN/C0rlKyf3icJgBw==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:28.373063Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b0caad390d292b7aa307e34a6821a440bf5045199252217468e8244b584c5ca","sha256:dbbd05fdbdbd0f06653f7991a5346dc52376d2dad0d6d1c6b8b5b72c533a852e"],"state_sha256":"67dbf64ebceb7fa98102a9aa393390e48dd8d6c4a0971e441502d65fc0b9acc4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+JXIhJM4RttbrrChMM7qpzhWdibNZswyG7JQRDRXLbuVUmimBcPjNywklMPYV+0PJ+jrxC/zRE5wusth160fBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T19:50:09.163360Z","bundle_sha256":"066d1f88510a347040b3620553750002a6eb2eb397ef63f09b734a7980674c9e"}}