{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CKFHKQND7ORXTMAJDDV5MEVDWR","short_pith_number":"pith:CKFHKQND","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"},"canonical_sha256":"128a7541a3fba379b00918ebd612a3b4555b0efa5f27140cd0e1f36879b4df89","source":{"kind":"arxiv","id":"2505.00523","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CKFHKQND7ORXTMAJDDV5MEVDWR","target":"record","payload":{"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"},"canonical_sha256":"128a7541a3fba379b00918ebd612a3b4555b0efa5f27140cd0e1f36879b4df89","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"},"source_kind":"arxiv","source_id":"2505.00523","source_version":2,"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-05T11:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i5uRe5n1imUVFjjB4UOm+9cfE1sQJdrO/7+Snj3iz9AFn6r3bgBZUP215c56qKZ+teidqcmYA7cA+uERN2ORBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:14:04.923544Z"},"content_sha256":"06a922fd5580bfb5ffe958ba18cb29f13a60f0463ef11a9398f252ba01be7dd2","schema_version":"1.0","event_id":"sha256:06a922fd5580bfb5ffe958ba18cb29f13a60f0463ef11a9398f252ba01be7dd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CKFHKQND7ORXTMAJDDV5MEVDWR","target":"graph","payload":{"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"},"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-05T11:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMhv3E9cO4NthBdSu6tL1KEYE3TLKArp98Et9DXXaElRRhB6EX0UI9gdTAdsSIuOgYvp4jAX+DbPP3lvW1TqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:14:04.924477Z"},"content_sha256":"182f32f460d9a0b2fe7f49dd9501a538082fbfb6d4f771e6dcccf42bcdb206cf","schema_version":"1.0","event_id":"sha256:182f32f460d9a0b2fe7f49dd9501a538082fbfb6d4f771e6dcccf42bcdb206cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/bundle.json","state_url":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/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-08-16T10:14:04Z","links":{"resolver":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR","bundle":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/bundle.json","state":"https://pith.science/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKFHKQND7ORXTMAJDDV5MEVDWR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i3/Jc8y5fgeWwqbXIxSHdBIkAigTHmkLqr8yAQoB5hyHdMGQmBRGvytD09JmlYZj16c4UMR/7fKEUVY3qLy/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:14:04.931764Z","bundle_sha256":"73a3a0869880099d5702d151352474f09c4fbef586739e58be3168a0e3d2bc28"}}