{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CKFHKQND7ORXTMAJDDV5MEVDWR","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":"cf8dcbe41981f573ea7458944e0f7676db509aca6987094133b78ad4d8a2359b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-01T13:44:43Z","title_canon_sha256":"1099ca3dbb943fb96db9c158f24d0b126c0396487316e82e7eb9b659fd462192"},"schema_version":"1.0","source":{"id":"2505.00523","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.00523","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.00523v2","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00523","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"CKFHKQND7ORX","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_16","alias_value":"CKFHKQND7ORXTMAJ","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_8","alias_value":"CKFHKQND","created_at":"2026-07-05T11:48:03Z"}],"graph_snapshots":[{"event_id":"sha256:182f32f460d9a0b2fe7f49dd9501a538082fbfb6d4f771e6dcccf42bcdb206cf","target":"graph","created_at":"2026-07-05T11:48:03Z","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/2505.00523/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Answering a question of Erd\\H{o}s and Hajnal, Chen and Ma proved that for all \\(n\\geq600\\) every graph with \\(2n + 1\\) vertices and at least \\(n^2 + n+1\\) edges contains two vertices of equal degree connected by a path of length three. The complete bipartite graph $K_{n,n+1}$ shows that this edge bound is sharp. In this paper, we develop a novel approach to handle graphs with large equal degrees, which enables us to establish the result for all $n\\ge2$, thereby fully resolving the problem posed by Erd\\H{o}s and Hajnal.","authors_text":"Qinghou Zeng, Zhen Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-01T13:44:43Z","title":"A complement of the Erd\\H{o}s-Hajnal problem on paths with equal-degree endpoints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00523","kind":"arxiv","version":2},"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:06a922fd5580bfb5ffe958ba18cb29f13a60f0463ef11a9398f252ba01be7dd2","target":"record","created_at":"2026-07-05T11:48:03Z","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":"cf8dcbe41981f573ea7458944e0f7676db509aca6987094133b78ad4d8a2359b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-01T13:44:43Z","title_canon_sha256":"1099ca3dbb943fb96db9c158f24d0b126c0396487316e82e7eb9b659fd462192"},"schema_version":"1.0","source":{"id":"2505.00523","kind":"arxiv","version":2}},"canonical_sha256":"128a7541a3fba379b00918ebd612a3b4555b0efa5f27140cd0e1f36879b4df89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"128a7541a3fba379b00918ebd612a3b4555b0efa5f27140cd0e1f36879b4df89","first_computed_at":"2026-07-05T11:48:03.014846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:48:03.014846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uvu55dll1pMIQgjPSABSJ0nVVrWIVkGTOSgLG2umUTKjY3UPqQRjLrk1lfs8bvKUlP5UqrmmsHuB/MVU6asSAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:48:03.015542Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.00523","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06a922fd5580bfb5ffe958ba18cb29f13a60f0463ef11a9398f252ba01be7dd2","sha256:182f32f460d9a0b2fe7f49dd9501a538082fbfb6d4f771e6dcccf42bcdb206cf"],"state_sha256":"6d1f68c808f009132d75cac986d49a5700562f8deb56fa456bcbb15072867e62"}