{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JPRBNC3U44OUJUNN2H7KLKLVFB","short_pith_number":"pith:JPRBNC3U","canonical_record":{"source":{"id":"2305.10903","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-18T12:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"f12f07210336d44282a6033cc57258ab17747bb91b6b4af6ac6900ae296f3ac4","abstract_canon_sha256":"5095db23b0a260b0fe26b6d86e896c237c6cfd91311f8a290021ad2592e2b086"},"schema_version":"1.0"},"canonical_sha256":"4be2168b74e71d44d1add1fea5a975286e32e8b48fe70205d9317b7c4be296c9","source":{"kind":"arxiv","id":"2305.10903","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.10903","created_at":"2026-07-05T06:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"2305.10903v1","created_at":"2026-07-05T06:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.10903","created_at":"2026-07-05T06:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"JPRBNC3U44OU","created_at":"2026-07-05T06:11:28Z"},{"alias_kind":"pith_short_16","alias_value":"JPRBNC3U44OUJUNN","created_at":"2026-07-05T06:11:28Z"},{"alias_kind":"pith_short_8","alias_value":"JPRBNC3U","created_at":"2026-07-05T06:11:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JPRBNC3U44OUJUNN2H7KLKLVFB","target":"record","payload":{"canonical_record":{"source":{"id":"2305.10903","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-18T12:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"f12f07210336d44282a6033cc57258ab17747bb91b6b4af6ac6900ae296f3ac4","abstract_canon_sha256":"5095db23b0a260b0fe26b6d86e896c237c6cfd91311f8a290021ad2592e2b086"},"schema_version":"1.0"},"canonical_sha256":"4be2168b74e71d44d1add1fea5a975286e32e8b48fe70205d9317b7c4be296c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:28.011685Z","signature_b64":"VhMpHobxhtMPGgj5vwP7dqYzwzVQERcQSWUchgbJ9FbJA4fC0aVc8elF1ILcqL+NQzX70p/x+R2FIwzg/PSSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4be2168b74e71d44d1add1fea5a975286e32e8b48fe70205d9317b7c4be296c9","last_reissued_at":"2026-07-05T06:11:28.011253Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:28.011253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.10903","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-05T06:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qG4ZshkdZF1U4JvcpQrDwI09yMtgIFEA8CqKEgumH90yDlAavB6/RgT2DOEW9JcUC4dPAm4Aq9sTBRVRqY8mCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T23:42:26.038715Z"},"content_sha256":"584c5ae078ec5492ef7e6d130570300083e4afa41ddf41ca271643ede13c3de0","schema_version":"1.0","event_id":"sha256:584c5ae078ec5492ef7e6d130570300083e4afa41ddf41ca271643ede13c3de0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JPRBNC3U44OUJUNN2H7KLKLVFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strongly common graphs with odd girth are cycles","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leo Versteegen","submitted_at":"2023-05-18T12:02:29Z","abstract_excerpt":"A graph $H$ is called strongly common if for every coloring $\\phi$ of $K_n$ with two colors, the number of monochromatic copies of $H$ is at least the number of monochromatic copies of $H$ in a random coloring of $K_n$ with the same density of color classes as $\\phi$. In this note we prove that if a graph has odd girth but is not a cycle, then it is not strongly common. This answers a question of Chen and Ma."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.10903","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/2305.10903/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-05T06:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqaVyY1s9sKBRXNLMYelPTy0tqt8O+l3Sw8EbISC3ewcf+7okTw+Wx3n+SQzbWlBzeXhK008zoeGYcBEYzQ6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T23:42:26.039005Z"},"content_sha256":"c5e1b9676e3cc95540ff214518796b93496de20504b6dab4ce1ce1cca78a72b9","schema_version":"1.0","event_id":"sha256:c5e1b9676e3cc95540ff214518796b93496de20504b6dab4ce1ce1cca78a72b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/bundle.json","state_url":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/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-31T23:42:26Z","links":{"resolver":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB","bundle":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/bundle.json","state":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JPRBNC3U44OUJUNN2H7KLKLVFB","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":"5095db23b0a260b0fe26b6d86e896c237c6cfd91311f8a290021ad2592e2b086","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-18T12:02:29Z","title_canon_sha256":"f12f07210336d44282a6033cc57258ab17747bb91b6b4af6ac6900ae296f3ac4"},"schema_version":"1.0","source":{"id":"2305.10903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.10903","created_at":"2026-07-05T06:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"2305.10903v1","created_at":"2026-07-05T06:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.10903","created_at":"2026-07-05T06:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"JPRBNC3U44OU","created_at":"2026-07-05T06:11:28Z"},{"alias_kind":"pith_short_16","alias_value":"JPRBNC3U44OUJUNN","created_at":"2026-07-05T06:11:28Z"},{"alias_kind":"pith_short_8","alias_value":"JPRBNC3U","created_at":"2026-07-05T06:11:28Z"}],"graph_snapshots":[{"event_id":"sha256:c5e1b9676e3cc95540ff214518796b93496de20504b6dab4ce1ce1cca78a72b9","target":"graph","created_at":"2026-07-05T06:11: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/2305.10903/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $H$ is called strongly common if for every coloring $\\phi$ of $K_n$ with two colors, the number of monochromatic copies of $H$ is at least the number of monochromatic copies of $H$ in a random coloring of $K_n$ with the same density of color classes as $\\phi$. In this note we prove that if a graph has odd girth but is not a cycle, then it is not strongly common. This answers a question of Chen and Ma.","authors_text":"Leo Versteegen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-18T12:02:29Z","title":"Strongly common graphs with odd girth are cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.10903","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:584c5ae078ec5492ef7e6d130570300083e4afa41ddf41ca271643ede13c3de0","target":"record","created_at":"2026-07-05T06:11: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":"5095db23b0a260b0fe26b6d86e896c237c6cfd91311f8a290021ad2592e2b086","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-18T12:02:29Z","title_canon_sha256":"f12f07210336d44282a6033cc57258ab17747bb91b6b4af6ac6900ae296f3ac4"},"schema_version":"1.0","source":{"id":"2305.10903","kind":"arxiv","version":1}},"canonical_sha256":"4be2168b74e71d44d1add1fea5a975286e32e8b48fe70205d9317b7c4be296c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4be2168b74e71d44d1add1fea5a975286e32e8b48fe70205d9317b7c4be296c9","first_computed_at":"2026-07-05T06:11:28.011253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:11:28.011253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VhMpHobxhtMPGgj5vwP7dqYzwzVQERcQSWUchgbJ9FbJA4fC0aVc8elF1ILcqL+NQzX70p/x+R2FIwzg/PSSAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:11:28.011685Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.10903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:584c5ae078ec5492ef7e6d130570300083e4afa41ddf41ca271643ede13c3de0","sha256:c5e1b9676e3cc95540ff214518796b93496de20504b6dab4ce1ce1cca78a72b9"],"state_sha256":"3865694460eb0dcaefc882e70e78e75e9693204159db09e53ed0ad2444697bcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+iB2qAWhDImN7z3VJCHFErVJmWx7n7AM8L1wb1e/1WJCSVjgr4CqwYtUgQ4KzSBvbIeS1xWIYHD+O5qFnF5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T23:42:26.042573Z","bundle_sha256":"a31832a2b9f730ad0df4a4cf0575ab84017c1682e57e16d6d2482eebf19f84c4"}}