{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:2BYMKZCHECDHU7YG4ZT4YPZSWZ","short_pith_number":"pith:2BYMKZCH","canonical_record":{"source":{"id":"2304.04601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-10T14:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"a005ca5a53be753ef9936906dd735ef8e4c32a9e31337e38b56c0b91675cf3ec","abstract_canon_sha256":"0b84379b039f45973be9cc9a4e47a4936b0ce7d5643b246169606eeb784cff5a"},"schema_version":"1.0"},"canonical_sha256":"d070c5644720867a7f06e667cc3f32b648ff77e290dcaccb086575c7e9397032","source":{"kind":"arxiv","id":"2304.04601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.04601","created_at":"2026-07-05T05:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"2304.04601v1","created_at":"2026-07-05T05:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.04601","created_at":"2026-07-05T05:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"2BYMKZCHECDH","created_at":"2026-07-05T05:59:27Z"},{"alias_kind":"pith_short_16","alias_value":"2BYMKZCHECDHU7YG","created_at":"2026-07-05T05:59:27Z"},{"alias_kind":"pith_short_8","alias_value":"2BYMKZCH","created_at":"2026-07-05T05:59:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:2BYMKZCHECDHU7YG4ZT4YPZSWZ","target":"record","payload":{"canonical_record":{"source":{"id":"2304.04601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-10T14:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"a005ca5a53be753ef9936906dd735ef8e4c32a9e31337e38b56c0b91675cf3ec","abstract_canon_sha256":"0b84379b039f45973be9cc9a4e47a4936b0ce7d5643b246169606eeb784cff5a"},"schema_version":"1.0"},"canonical_sha256":"d070c5644720867a7f06e667cc3f32b648ff77e290dcaccb086575c7e9397032","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:27.956255Z","signature_b64":"3a05qWa9/cPlV93wKzOCVXZ+gDHx9g3nWHMHuZo3a+hsv2Mt6qB8inEX8lfvqGGpCM8O54+t22gzH+xtgcu5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d070c5644720867a7f06e667cc3f32b648ff77e290dcaccb086575c7e9397032","last_reissued_at":"2026-07-05T05:59:27.955845Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:27.955845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.04601","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-05T05:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XzR9g/dhAvNiK9OIXTpd3tqBFBoATwrcYTYo88q3lL9b55q9YFcxVhAVeYwRxqOwG718NRSQnUX5kuk1GoNqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T19:23:03.137308Z"},"content_sha256":"492baef43d7fc880f92e38ef21317d191890741ed7446a1a08980b2b735c10b9","schema_version":"1.0","event_id":"sha256:492baef43d7fc880f92e38ef21317d191890741ed7446a1a08980b2b735c10b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:2BYMKZCHECDHU7YG4ZT4YPZSWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A property on monochromatic copies of graphs containing a triangle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Chen, Jie Ma","submitted_at":"2023-04-10T14:16:25Z","abstract_excerpt":"A graph $H$ is called common and respectively, strongly common if the number of monochromatic copies of $H$ in a 2-edge-coloring $\\phi$ of a large clique is asymptotically minimised by the random coloring with an equal proportion of each color and respectively, by the random coloring with the same proportion of each color as in $\\phi$. A well-known theorem of Jagger, {\\v S}t'ov{\\' i}{\\v c}ek and Thomason states that every graph containing a $K_4$ is not common. Here we prove an analogous result that every graph containing a $K_3$ and with at least four edges is not strongly common."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.04601","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/2304.04601/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-05T05:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/V9BwD5cKa9c1VX/Oai90Xj0zmA4MWmKKoLklK7348uXbx/PQUyfHPsAwFrFEOE5JrrAP+iDnBW4buCPkBaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T19:23:03.137696Z"},"content_sha256":"02f33dbb5394698b710f7c595ff79c72875c7378d1a7724fb6c9e3b19fda8b60","schema_version":"1.0","event_id":"sha256:02f33dbb5394698b710f7c595ff79c72875c7378d1a7724fb6c9e3b19fda8b60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BYMKZCHECDHU7YG4ZT4YPZSWZ/bundle.json","state_url":"https://pith.science/pith/2BYMKZCHECDHU7YG4ZT4YPZSWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BYMKZCHECDHU7YG4ZT4YPZSWZ/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-12T19:23:03Z","links":{"resolver":"https://pith.science/pith/2BYMKZCHECDHU7YG4ZT4YPZSWZ","bundle":"https://pith.science/pith/2BYMKZCHECDHU7YG4ZT4YPZSWZ/bundle.json","state":"https://pith.science/pith/2BYMKZCHECDHU7YG4ZT4YPZSWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BYMKZCHECDHU7YG4ZT4YPZSWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2BYMKZCHECDHU7YG4ZT4YPZSWZ","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":"0b84379b039f45973be9cc9a4e47a4936b0ce7d5643b246169606eeb784cff5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-10T14:16:25Z","title_canon_sha256":"a005ca5a53be753ef9936906dd735ef8e4c32a9e31337e38b56c0b91675cf3ec"},"schema_version":"1.0","source":{"id":"2304.04601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.04601","created_at":"2026-07-05T05:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"2304.04601v1","created_at":"2026-07-05T05:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.04601","created_at":"2026-07-05T05:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"2BYMKZCHECDH","created_at":"2026-07-05T05:59:27Z"},{"alias_kind":"pith_short_16","alias_value":"2BYMKZCHECDHU7YG","created_at":"2026-07-05T05:59:27Z"},{"alias_kind":"pith_short_8","alias_value":"2BYMKZCH","created_at":"2026-07-05T05:59:27Z"}],"graph_snapshots":[{"event_id":"sha256:02f33dbb5394698b710f7c595ff79c72875c7378d1a7724fb6c9e3b19fda8b60","target":"graph","created_at":"2026-07-05T05:59:27Z","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/2304.04601/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $H$ is called common and respectively, strongly common if the number of monochromatic copies of $H$ in a 2-edge-coloring $\\phi$ of a large clique is asymptotically minimised by the random coloring with an equal proportion of each color and respectively, by the random coloring with the same proportion of each color as in $\\phi$. A well-known theorem of Jagger, {\\v S}t'ov{\\' i}{\\v c}ek and Thomason states that every graph containing a $K_4$ is not common. Here we prove an analogous result that every graph containing a $K_3$ and with at least four edges is not strongly common.","authors_text":"Hao Chen, Jie Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-10T14:16:25Z","title":"A property on monochromatic copies of graphs containing a triangle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.04601","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:492baef43d7fc880f92e38ef21317d191890741ed7446a1a08980b2b735c10b9","target":"record","created_at":"2026-07-05T05:59:27Z","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":"0b84379b039f45973be9cc9a4e47a4936b0ce7d5643b246169606eeb784cff5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-10T14:16:25Z","title_canon_sha256":"a005ca5a53be753ef9936906dd735ef8e4c32a9e31337e38b56c0b91675cf3ec"},"schema_version":"1.0","source":{"id":"2304.04601","kind":"arxiv","version":1}},"canonical_sha256":"d070c5644720867a7f06e667cc3f32b648ff77e290dcaccb086575c7e9397032","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d070c5644720867a7f06e667cc3f32b648ff77e290dcaccb086575c7e9397032","first_computed_at":"2026-07-05T05:59:27.955845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:59:27.955845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3a05qWa9/cPlV93wKzOCVXZ+gDHx9g3nWHMHuZo3a+hsv2Mt6qB8inEX8lfvqGGpCM8O54+t22gzH+xtgcu5Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:59:27.956255Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.04601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:492baef43d7fc880f92e38ef21317d191890741ed7446a1a08980b2b735c10b9","sha256:02f33dbb5394698b710f7c595ff79c72875c7378d1a7724fb6c9e3b19fda8b60"],"state_sha256":"fc78d23cf220c81a565e9221b106b8c7d44525c7d14904e6e220683373bde651"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNIIeBFK/zxhGozNJWLPDGD7ubkaa6Kvtam9gLuQw7W1ZJ8eh3oP1Oq6gPWZEz11z/3uOuepj72pvGH/CQYYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T19:23:03.142292Z","bundle_sha256":"e13aba052ba2a9f2b20f92f23e40f54c9b7e414a2bcaab79f34d866ac67bfa42"}}