{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JPRBNC3U44OUJUNN2H7KLKLVFB","short_pith_number":"pith:JPRBNC3U","schema_version":"1.0","canonical_sha256":"4be2168b74e71d44d1add1fea5a975286e32e8b48fe70205d9317b7c4be296c9","source":{"kind":"arxiv","id":"2305.10903","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.10903","created_at":"2026-07-05T06:11:28.011309+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.10903v1","created_at":"2026-07-05T06:11:28.011309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.10903","created_at":"2026-07-05T06:11:28.011309+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPRBNC3U44OU","created_at":"2026-07-05T06:11:28.011309+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPRBNC3U44OUJUNN","created_at":"2026-07-05T06:11:28.011309+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPRBNC3U","created_at":"2026-07-05T06:11:28.011309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB","json":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB.json","graph_json":"https://pith.science/api/pith-number/JPRBNC3U44OUJUNN2H7KLKLVFB/graph.json","events_json":"https://pith.science/api/pith-number/JPRBNC3U44OUJUNN2H7KLKLVFB/events.json","paper":"https://pith.science/paper/JPRBNC3U"},"agent_actions":{"view_html":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB","download_json":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB.json","view_paper":"https://pith.science/paper/JPRBNC3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.10903&json=true","fetch_graph":"https://pith.science/api/pith-number/JPRBNC3U44OUJUNN2H7KLKLVFB/graph.json","fetch_events":"https://pith.science/api/pith-number/JPRBNC3U44OUJUNN2H7KLKLVFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/action/storage_attestation","attest_author":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/action/author_attestation","sign_citation":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/action/citation_signature","submit_replication":"https://pith.science/pith/JPRBNC3U44OUJUNN2H7KLKLVFB/action/replication_record"}},"created_at":"2026-07-05T06:11:28.011309+00:00","updated_at":"2026-07-05T06:11:28.011309+00:00"}