{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CKFHKQND7ORXTMAJDDV5MEVDWR","short_pith_number":"pith:CKFHKQND","schema_version":"1.0","canonical_sha256":"128a7541a3fba379b00918ebd612a3b4555b0efa5f27140cd0e1f36879b4df89","source":{"kind":"arxiv","id":"2505.00523","version":2},"attestation_state":"computed","paper":{"title":"A complement of the Erd\\H{o}s-Hajnal problem on paths with equal-degree endpoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qinghou Zeng, Zhen Liu","submitted_at":"2025-05-01T13:44:43Z","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."},"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":"2505.00523","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-01T13:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"1099ca3dbb943fb96db9c158f24d0b126c0396487316e82e7eb9b659fd462192","abstract_canon_sha256":"cf8dcbe41981f573ea7458944e0f7676db509aca6987094133b78ad4d8a2359b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:03.015542Z","signature_b64":"uvu55dll1pMIQgjPSABSJ0nVVrWIVkGTOSgLG2umUTKjY3UPqQRjLrk1lfs8bvKUlP5UqrmmsHuB/MVU6asSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"128a7541a3fba379b00918ebd612a3b4555b0efa5f27140cd0e1f36879b4df89","last_reissued_at":"2026-07-05T11:48:03.014846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:03.014846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A complement of the Erd\\H{o}s-Hajnal problem on paths with equal-degree endpoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qinghou Zeng, Zhen Liu","submitted_at":"2025-05-01T13:44:43Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00523","kind":"arxiv","version":2},"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/2505.00523/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":"2505.00523","created_at":"2026-07-05T11:48:03.014943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.00523v2","created_at":"2026-07-05T11:48:03.014943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00523","created_at":"2026-07-05T11:48:03.014943+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKFHKQND7ORX","created_at":"2026-07-05T11:48:03.014943+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKFHKQND7ORXTMAJ","created_at":"2026-07-05T11:48:03.014943+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKFHKQND","created_at":"2026-07-05T11:48:03.014943+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03825","citing_title":"A generalization of Erd\\H{o}s-Hajnal problem on paths with equal-degree endpoints","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11664","citing_title":"Paths of length five with equal-degree endpoints","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR","json":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR.json","graph_json":"https://pith.science/api/pith-number/CKFHKQND7ORXTMAJDDV5MEVDWR/graph.json","events_json":"https://pith.science/api/pith-number/CKFHKQND7ORXTMAJDDV5MEVDWR/events.json","paper":"https://pith.science/paper/CKFHKQND"},"agent_actions":{"view_html":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR","download_json":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR.json","view_paper":"https://pith.science/paper/CKFHKQND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.00523&json=true","fetch_graph":"https://pith.science/api/pith-number/CKFHKQND7ORXTMAJDDV5MEVDWR/graph.json","fetch_events":"https://pith.science/api/pith-number/CKFHKQND7ORXTMAJDDV5MEVDWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/action/storage_attestation","attest_author":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/action/author_attestation","sign_citation":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/action/citation_signature","submit_replication":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/action/replication_record"}},"created_at":"2026-07-05T11:48:03.014943+00:00","updated_at":"2026-07-05T11:48:03.014943+00:00"}