{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HGKDH622MM3KOZF5UCEDOFIC2C","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":"37b2b98f2eee25f899ff7e7fae248dd9d55a841fc5b0146d931ec8096d5f4ee6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-10T13:12:27Z","title_canon_sha256":"9d7bd3b85d93e79cfd3f76c010b427894d65b05c27350263fc34b2bc36fd3a77"},"schema_version":"1.0","source":{"id":"2408.05547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.05547","created_at":"2026-07-05T08:54:21Z"},{"alias_kind":"arxiv_version","alias_value":"2408.05547v1","created_at":"2026-07-05T08:54:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05547","created_at":"2026-07-05T08:54:21Z"},{"alias_kind":"pith_short_12","alias_value":"HGKDH622MM3K","created_at":"2026-07-05T08:54:21Z"},{"alias_kind":"pith_short_16","alias_value":"HGKDH622MM3KOZF5","created_at":"2026-07-05T08:54:21Z"},{"alias_kind":"pith_short_8","alias_value":"HGKDH622","created_at":"2026-07-05T08:54:21Z"}],"graph_snapshots":[{"event_id":"sha256:5a4b5f1ca2e05ac0bc04dac2318651e09bdb176a0783de09d1b20deb62881f87","target":"graph","created_at":"2026-07-05T08:54:21Z","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/2408.05547/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a graph. For $x\\in V(G)$, let $N(x)=\\{y\\in V(G)\\colon xy\\in E(G)\\}$. The minimum common degree of $G$, denoted by $\\delta_{2}(G)$, is defined as the minimum of $|N(x)\\cap N(y)|$ over all non-edges $xy$ of $G$. In 1982, H\\\"{a}ggkvist showed that every triangle-free graph with minimum degree greater than $\\lfloor\\frac{3n}{8}\\rfloor$ is homomorphic to a cycle of length 5. In this paper, we prove that every triangle-free graph with minimum common degree greater than $\\lfloor\\frac{n}{8}\\rfloor$ is homomorphic to a cycle of length 5, which implies H\\\"{a}ggkvist's result. The balanced blow","authors_text":"Fan Zhao, Jian Wang, Weihua Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-10T13:12:27Z","title":"Triangle-free Graphs with Large Minimum Common Degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05547","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:a090f9e34ed4bb196f91967d3830f02aed5c495af4247e49687f8c168313d9e0","target":"record","created_at":"2026-07-05T08:54:21Z","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":"37b2b98f2eee25f899ff7e7fae248dd9d55a841fc5b0146d931ec8096d5f4ee6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-10T13:12:27Z","title_canon_sha256":"9d7bd3b85d93e79cfd3f76c010b427894d65b05c27350263fc34b2bc36fd3a77"},"schema_version":"1.0","source":{"id":"2408.05547","kind":"arxiv","version":1}},"canonical_sha256":"399433fb5a6336a764bda088371502d089852a197a0315951ae1624e6d63722d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"399433fb5a6336a764bda088371502d089852a197a0315951ae1624e6d63722d","first_computed_at":"2026-07-05T08:54:21.670274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:54:21.670274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tgS4O/NK9CXUpfZciDkl/WX2honAsGlmMXvpQ9sG9opFSg91r3SlgSZTlje5egmeLy+QL3dHzGnVIVkK6FV/Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:54:21.670715Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.05547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a090f9e34ed4bb196f91967d3830f02aed5c495af4247e49687f8c168313d9e0","sha256:5a4b5f1ca2e05ac0bc04dac2318651e09bdb176a0783de09d1b20deb62881f87"],"state_sha256":"037bb5163eac6c05a20b5e59f8d64351d177413134d7cb6c5a37b3acb7cdd49a"}