{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6CSTHE6HFS6VYA2KNCDVTS6WPL","short_pith_number":"pith:6CSTHE6H","canonical_record":{"source":{"id":"1810.04980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-11T12:31:48Z","cross_cats_sorted":[],"title_canon_sha256":"12b10a264d5d9532b01e2f33bd5491f4872325f7c2b84562a3fb6c9693ac7c88","abstract_canon_sha256":"49b62ff27cd8cdfa0cbf3f325b069452a8b33f288d42517d5674ab38d8511043"},"schema_version":"1.0"},"canonical_sha256":"f0a53393c72cbd5c034a688759cbd67ad3d29082779234a2d344da25d7b2dfc0","source":{"kind":"arxiv","id":"1810.04980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04980","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04980v1","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04980","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"6CSTHE6HFS6V","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6CSTHE6HFS6VYA2K","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6CSTHE6H","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6CSTHE6HFS6VYA2KNCDVTS6WPL","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-11T12:31:48Z","cross_cats_sorted":[],"title_canon_sha256":"12b10a264d5d9532b01e2f33bd5491f4872325f7c2b84562a3fb6c9693ac7c88","abstract_canon_sha256":"49b62ff27cd8cdfa0cbf3f325b069452a8b33f288d42517d5674ab38d8511043"},"schema_version":"1.0"},"canonical_sha256":"f0a53393c72cbd5c034a688759cbd67ad3d29082779234a2d344da25d7b2dfc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:35.357915Z","signature_b64":"7fTk6F8VHf5+R6y/w34wwSRSCV2Hq/6UxdTZ8r8GYv6nUNVGxm8/zpeDLxcWxkThdGdXyR+dOV+aYvR9MLA4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a53393c72cbd5c034a688759cbd67ad3d29082779234a2d344da25d7b2dfc0","last_reissued_at":"2026-05-18T00:03:35.357331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:35.357331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04980","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-05-18T00:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GoTaZH+guOgjv+IlJlQU9RIOgNNxkM3h87F7o1E8AhStQKjFt0ML4A40h9BC5MEENHR7i2qX8YlRW3Bhcd7NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:51:23.931990Z"},"content_sha256":"fce536c91796bce296bf49008a3098b4d3d0a066ee5aab2e38478ba82cc99c8d","schema_version":"1.0","event_id":"sha256:fce536c91796bce296bf49008a3098b4d3d0a066ee5aab2e38478ba82cc99c8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6CSTHE6HFS6VYA2KNCDVTS6WPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow triangles and cliques in edge-colored graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elena Mohr, Stefan Ehard","submitted_at":"2018-10-11T12:31:48Z","abstract_excerpt":"For an edge-colored graph, a subgraph is called rainbow if all its edges have distinct colors. We show that if $G$ is an edge-colored graph of order $n$ and size $m$ using $c$ colors on its edges, and $m+c\\geq \\binom{n+1}{2}+k-1$ for a non-negative integer $k$, then $G$ contains at least $k$ rainbow triangles. For $n\\geq 3k$, we show that this result is best possible, and we completely characterize the class of edge-colored graphs for which this result is sharp. Furthermore, we show that an edge-colored graph $G$ contains at least $k$ rainbow triangles if $\\sum\\limits_{v\\in V(G)} d^c_G(v)\\geq "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04980","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":""},"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-05-18T00:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+xjgqsWZwcDLxwzOlWsV+y0So0v6/4ZGeRhdWpEu/WXuS/wK7iutn12lxyPzGt/e3SXPrdqgdACkpWqsRw6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:51:23.932358Z"},"content_sha256":"1ccb206433428703eeffe8bd191eb73ba375afb8b4be9bef415cb988290a5727","schema_version":"1.0","event_id":"sha256:1ccb206433428703eeffe8bd191eb73ba375afb8b4be9bef415cb988290a5727"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CSTHE6HFS6VYA2KNCDVTS6WPL/bundle.json","state_url":"https://pith.science/pith/6CSTHE6HFS6VYA2KNCDVTS6WPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CSTHE6HFS6VYA2KNCDVTS6WPL/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-06-09T17:51:23Z","links":{"resolver":"https://pith.science/pith/6CSTHE6HFS6VYA2KNCDVTS6WPL","bundle":"https://pith.science/pith/6CSTHE6HFS6VYA2KNCDVTS6WPL/bundle.json","state":"https://pith.science/pith/6CSTHE6HFS6VYA2KNCDVTS6WPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CSTHE6HFS6VYA2KNCDVTS6WPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6CSTHE6HFS6VYA2KNCDVTS6WPL","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":"49b62ff27cd8cdfa0cbf3f325b069452a8b33f288d42517d5674ab38d8511043","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-11T12:31:48Z","title_canon_sha256":"12b10a264d5d9532b01e2f33bd5491f4872325f7c2b84562a3fb6c9693ac7c88"},"schema_version":"1.0","source":{"id":"1810.04980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04980","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04980v1","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04980","created_at":"2026-05-18T00:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"6CSTHE6HFS6V","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6CSTHE6HFS6VYA2K","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6CSTHE6H","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:1ccb206433428703eeffe8bd191eb73ba375afb8b4be9bef415cb988290a5727","target":"graph","created_at":"2026-05-18T00:03:35Z","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"},"paper":{"abstract_excerpt":"For an edge-colored graph, a subgraph is called rainbow if all its edges have distinct colors. We show that if $G$ is an edge-colored graph of order $n$ and size $m$ using $c$ colors on its edges, and $m+c\\geq \\binom{n+1}{2}+k-1$ for a non-negative integer $k$, then $G$ contains at least $k$ rainbow triangles. For $n\\geq 3k$, we show that this result is best possible, and we completely characterize the class of edge-colored graphs for which this result is sharp. Furthermore, we show that an edge-colored graph $G$ contains at least $k$ rainbow triangles if $\\sum\\limits_{v\\in V(G)} d^c_G(v)\\geq ","authors_text":"Elena Mohr, Stefan Ehard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-11T12:31:48Z","title":"Rainbow triangles and cliques in edge-colored graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04980","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:fce536c91796bce296bf49008a3098b4d3d0a066ee5aab2e38478ba82cc99c8d","target":"record","created_at":"2026-05-18T00:03:35Z","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":"49b62ff27cd8cdfa0cbf3f325b069452a8b33f288d42517d5674ab38d8511043","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-11T12:31:48Z","title_canon_sha256":"12b10a264d5d9532b01e2f33bd5491f4872325f7c2b84562a3fb6c9693ac7c88"},"schema_version":"1.0","source":{"id":"1810.04980","kind":"arxiv","version":1}},"canonical_sha256":"f0a53393c72cbd5c034a688759cbd67ad3d29082779234a2d344da25d7b2dfc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a53393c72cbd5c034a688759cbd67ad3d29082779234a2d344da25d7b2dfc0","first_computed_at":"2026-05-18T00:03:35.357331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:35.357331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7fTk6F8VHf5+R6y/w34wwSRSCV2Hq/6UxdTZ8r8GYv6nUNVGxm8/zpeDLxcWxkThdGdXyR+dOV+aYvR9MLA4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:35.357915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fce536c91796bce296bf49008a3098b4d3d0a066ee5aab2e38478ba82cc99c8d","sha256:1ccb206433428703eeffe8bd191eb73ba375afb8b4be9bef415cb988290a5727"],"state_sha256":"d59f5c0e543ee6b2e47ac1856d03b6f43e476a5ff6921d5c8a18ba3237bb8362"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwds84umE4+PCZIMffo5dI69ejuxQlHzCDUpQK0fJcIKZUhCMgpjGCv9c6FbJ3s+GRCeaiZAJgO1CCJ0b8ihAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:51:23.934305Z","bundle_sha256":"9fcfc96584000ca99a23ea3f9f6d70959cf7dbb3f2cc07041f4ec4e880024f55"}}