{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BWDVCKKU6HNS4HOALDDSJCMFSK","short_pith_number":"pith:BWDVCKKU","canonical_record":{"source":{"id":"2511.21061","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-11-26T05:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"a842f256ed6e1c35ac8808402b46a535f7ea87cc3f6b8025b5efe6da598ac7de","abstract_canon_sha256":"dd978422a4937bb59212c1c54c2f2e57c9ea2f22c4517f181a6c660a91f8a186"},"schema_version":"1.0"},"canonical_sha256":"0d87512954f1db2e1dc058c724898592b973c05de3bf8c1c2a5d8b4de3f82f42","source":{"kind":"arxiv","id":"2511.21061","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.21061","created_at":"2026-06-23T02:13:18Z"},{"alias_kind":"arxiv_version","alias_value":"2511.21061v3","created_at":"2026-06-23T02:13:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.21061","created_at":"2026-06-23T02:13:18Z"},{"alias_kind":"pith_short_12","alias_value":"BWDVCKKU6HNS","created_at":"2026-06-23T02:13:18Z"},{"alias_kind":"pith_short_16","alias_value":"BWDVCKKU6HNS4HOA","created_at":"2026-06-23T02:13:18Z"},{"alias_kind":"pith_short_8","alias_value":"BWDVCKKU","created_at":"2026-06-23T02:13:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BWDVCKKU6HNS4HOALDDSJCMFSK","target":"record","payload":{"canonical_record":{"source":{"id":"2511.21061","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-11-26T05:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"a842f256ed6e1c35ac8808402b46a535f7ea87cc3f6b8025b5efe6da598ac7de","abstract_canon_sha256":"dd978422a4937bb59212c1c54c2f2e57c9ea2f22c4517f181a6c660a91f8a186"},"schema_version":"1.0"},"canonical_sha256":"0d87512954f1db2e1dc058c724898592b973c05de3bf8c1c2a5d8b4de3f82f42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:18.963720Z","signature_b64":"NLbSUCBVYctgLopiQWK8er7/uDpfqVM12QenuFIhsSyZURGwhiieClnL603zPjrp+7ZrWVWmvCBS7IBBUEVSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d87512954f1db2e1dc058c724898592b973c05de3bf8c1c2a5d8b4de3f82f42","last_reissued_at":"2026-06-23T02:13:18.963130Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:18.963130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.21061","source_version":3,"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:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"knNfi0bY82FaaBScEFHdpcRJ01ia57cbIofESu+QdOx6ioeApxY5t6FtmrxJ6ELrRUqr+aXHBXW4O7QdfN5EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:39:25.822019Z"},"content_sha256":"6fbc301df79c7876f8f235de25a715033de75e723436700a9c306be42023ef15","schema_version":"1.0","event_id":"sha256:6fbc301df79c7876f8f235de25a715033de75e723436700a9c306be42023ef15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BWDVCKKU6HNS4HOALDDSJCMFSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Density of rainbow triangles and properly colored $K_4$'s","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, J\\'ozsef Balogh, Peter Bradshaw, Ramon I. Garcia","submitted_at":"2025-11-26T05:00:45Z","abstract_excerpt":"We establish a sharp upper bound on the number of properly $3$-edge-colored $K_4$'s in graphs with $R$ red, $G$ green and $B$ blue edges. We give a computer-free flag-algebra proof of this bound, and we also convert our proof into a classical counting proof and an entropy proof.\n  Additionally, for every $k\\ge 4$, for a fixed rainbow coloring $F$ of a complete graph $K_k$, we give a sharp upper bound on the number copies of $F$ in a $\\binom{k}{2}$-edge-colored graph. Our proof of this result relies on a new flag-algebra version of H\\\"older's inequality.\n  We also give a computer-free flag-alge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.21061","kind":"arxiv","version":3},"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/2511.21061/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:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pedDNYQTDeX75+kXqXbW0OHYgLY4YNH1Z4pIP81Tx/1jIcthlc2414dx/uRZb+Mm9GLK2v3aHFDWX5gAhJcOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:39:25.822515Z"},"content_sha256":"471ceb2d043c949968af8d82424717bfd24f6977e9d06ef0a747c09542657702","schema_version":"1.0","event_id":"sha256:471ceb2d043c949968af8d82424717bfd24f6977e9d06ef0a747c09542657702"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWDVCKKU6HNS4HOALDDSJCMFSK/bundle.json","state_url":"https://pith.science/pith/BWDVCKKU6HNS4HOALDDSJCMFSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWDVCKKU6HNS4HOALDDSJCMFSK/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-06T04:39:25Z","links":{"resolver":"https://pith.science/pith/BWDVCKKU6HNS4HOALDDSJCMFSK","bundle":"https://pith.science/pith/BWDVCKKU6HNS4HOALDDSJCMFSK/bundle.json","state":"https://pith.science/pith/BWDVCKKU6HNS4HOALDDSJCMFSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWDVCKKU6HNS4HOALDDSJCMFSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BWDVCKKU6HNS4HOALDDSJCMFSK","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":"dd978422a4937bb59212c1c54c2f2e57c9ea2f22c4517f181a6c660a91f8a186","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-11-26T05:00:45Z","title_canon_sha256":"a842f256ed6e1c35ac8808402b46a535f7ea87cc3f6b8025b5efe6da598ac7de"},"schema_version":"1.0","source":{"id":"2511.21061","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.21061","created_at":"2026-06-23T02:13:18Z"},{"alias_kind":"arxiv_version","alias_value":"2511.21061v3","created_at":"2026-06-23T02:13:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.21061","created_at":"2026-06-23T02:13:18Z"},{"alias_kind":"pith_short_12","alias_value":"BWDVCKKU6HNS","created_at":"2026-06-23T02:13:18Z"},{"alias_kind":"pith_short_16","alias_value":"BWDVCKKU6HNS4HOA","created_at":"2026-06-23T02:13:18Z"},{"alias_kind":"pith_short_8","alias_value":"BWDVCKKU","created_at":"2026-06-23T02:13:18Z"}],"graph_snapshots":[{"event_id":"sha256:471ceb2d043c949968af8d82424717bfd24f6977e9d06ef0a747c09542657702","target":"graph","created_at":"2026-06-23T02:13:18Z","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/2511.21061/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We establish a sharp upper bound on the number of properly $3$-edge-colored $K_4$'s in graphs with $R$ red, $G$ green and $B$ blue edges. We give a computer-free flag-algebra proof of this bound, and we also convert our proof into a classical counting proof and an entropy proof.\n  Additionally, for every $k\\ge 4$, for a fixed rainbow coloring $F$ of a complete graph $K_k$, we give a sharp upper bound on the number copies of $F$ in a $\\binom{k}{2}$-edge-colored graph. Our proof of this result relies on a new flag-algebra version of H\\\"older's inequality.\n  We also give a computer-free flag-alge","authors_text":"Bernard Lidick\\'y, J\\'ozsef Balogh, Peter Bradshaw, Ramon I. Garcia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-11-26T05:00:45Z","title":"Density of rainbow triangles and properly colored $K_4$'s"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.21061","kind":"arxiv","version":3},"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:6fbc301df79c7876f8f235de25a715033de75e723436700a9c306be42023ef15","target":"record","created_at":"2026-06-23T02:13:18Z","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":"dd978422a4937bb59212c1c54c2f2e57c9ea2f22c4517f181a6c660a91f8a186","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-11-26T05:00:45Z","title_canon_sha256":"a842f256ed6e1c35ac8808402b46a535f7ea87cc3f6b8025b5efe6da598ac7de"},"schema_version":"1.0","source":{"id":"2511.21061","kind":"arxiv","version":3}},"canonical_sha256":"0d87512954f1db2e1dc058c724898592b973c05de3bf8c1c2a5d8b4de3f82f42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d87512954f1db2e1dc058c724898592b973c05de3bf8c1c2a5d8b4de3f82f42","first_computed_at":"2026-06-23T02:13:18.963130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:18.963130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NLbSUCBVYctgLopiQWK8er7/uDpfqVM12QenuFIhsSyZURGwhiieClnL603zPjrp+7ZrWVWmvCBS7IBBUEVSCw==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:18.963720Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.21061","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fbc301df79c7876f8f235de25a715033de75e723436700a9c306be42023ef15","sha256:471ceb2d043c949968af8d82424717bfd24f6977e9d06ef0a747c09542657702"],"state_sha256":"dbf7c26c90c923dd8720464ba47aa2ed9293b8700a753e64153ab9ab3907f3e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YgxDoYqsl0JbG2bUEGb5gcjAMaChqsQlh4GGOhWgdWXgpT3cXqDf6DpwuhztO5ZhGsOt+i7M/0FVv2YA/cPVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T04:39:25.825724Z","bundle_sha256":"98de0d02c562c4a3ebbfd41be0d456129e3c684548ac53d0bd98cf5805e01b71"}}