{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KT2RTOLLSRJ3LXCPCLRYOWHC4J","short_pith_number":"pith:KT2RTOLL","schema_version":"1.0","canonical_sha256":"54f519b96b9453b5dc4f12e38758e2e2616ac2b275efce0fc91d4d523b48bb79","source":{"kind":"arxiv","id":"2607.04368","version":1},"attestation_state":"computed","paper":{"title":"Paths of even length with equal-degree endpoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaizhe Chen, Qinghou Zeng, Zhen Liu","submitted_at":"2026-07-05T15:54:44Z","abstract_excerpt":"Addressing a question posed by Erd\\H{o}s and Hajnal, Chen and Ma proved that, for all $n \\ge 600$, the complete bipartite graph $K_{n,n+1}$ is the unique graph on $2n+1$ vertices with at least $n^2+n$ edges that contains no two vertices of equal degree joined by a path of length three. In this paper, we extend this result and prove that for every fixed integer \\(\\ell\\ge 2\\) and sufficiently large \\(n\\), the unique \\(2n\\)-vertex graph with at least \\((n^2+n)/2\\) edges that contains no two vertices of equal degree joined by a path of length \\(2\\ell\\) is the half graph \\(H_n\\). This resolves the "},"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":"2607.04368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-05T15:54:44Z","cross_cats_sorted":[],"title_canon_sha256":"083481757b19b340b0929e4844110f13072d3d8a8cdaedd722e3a62fa1b6dca2","abstract_canon_sha256":"d8348174be2a4a8502484c5dc651a07e38220bd718e4a367b670a9697eed18ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:11.048511Z","signature_b64":"Y52nsnG4soNs6dcxEyTDsmMKM90iW1hs1lqi3k6sApLoKjSjT1NUFhMQTRzCvquGwDIFWADAOohcIQLidR3JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54f519b96b9453b5dc4f12e38758e2e2616ac2b275efce0fc91d4d523b48bb79","last_reissued_at":"2026-07-07T02:19:11.047775Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:11.047775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Paths of even length with equal-degree endpoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaizhe Chen, Qinghou Zeng, Zhen Liu","submitted_at":"2026-07-05T15:54:44Z","abstract_excerpt":"Addressing a question posed by Erd\\H{o}s and Hajnal, Chen and Ma proved that, for all $n \\ge 600$, the complete bipartite graph $K_{n,n+1}$ is the unique graph on $2n+1$ vertices with at least $n^2+n$ edges that contains no two vertices of equal degree joined by a path of length three. In this paper, we extend this result and prove that for every fixed integer \\(\\ell\\ge 2\\) and sufficiently large \\(n\\), the unique \\(2n\\)-vertex graph with at least \\((n^2+n)/2\\) edges that contains no two vertices of equal degree joined by a path of length \\(2\\ell\\) is the half graph \\(H_n\\). This resolves the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04368","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/2607.04368/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":"2607.04368","created_at":"2026-07-07T02:19:11.047881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04368v1","created_at":"2026-07-07T02:19:11.047881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04368","created_at":"2026-07-07T02:19:11.047881+00:00"},{"alias_kind":"pith_short_12","alias_value":"KT2RTOLLSRJ3","created_at":"2026-07-07T02:19:11.047881+00:00"},{"alias_kind":"pith_short_16","alias_value":"KT2RTOLLSRJ3LXCP","created_at":"2026-07-07T02:19:11.047881+00:00"},{"alias_kind":"pith_short_8","alias_value":"KT2RTOLL","created_at":"2026-07-07T02:19:11.047881+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/KT2RTOLLSRJ3LXCPCLRYOWHC4J","json":"https://pith.science/pith/KT2RTOLLSRJ3LXCPCLRYOWHC4J.json","graph_json":"https://pith.science/api/pith-number/KT2RTOLLSRJ3LXCPCLRYOWHC4J/graph.json","events_json":"https://pith.science/api/pith-number/KT2RTOLLSRJ3LXCPCLRYOWHC4J/events.json","paper":"https://pith.science/paper/KT2RTOLL"},"agent_actions":{"view_html":"https://pith.science/pith/KT2RTOLLSRJ3LXCPCLRYOWHC4J","download_json":"https://pith.science/pith/KT2RTOLLSRJ3LXCPCLRYOWHC4J.json","view_paper":"https://pith.science/paper/KT2RTOLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04368&json=true","fetch_graph":"https://pith.science/api/pith-number/KT2RTOLLSRJ3LXCPCLRYOWHC4J/graph.json","fetch_events":"https://pith.science/api/pith-number/KT2RTOLLSRJ3LXCPCLRYOWHC4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KT2RTOLLSRJ3LXCPCLRYOWHC4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KT2RTOLLSRJ3LXCPCLRYOWHC4J/action/storage_attestation","attest_author":"https://pith.science/pith/KT2RTOLLSRJ3LXCPCLRYOWHC4J/action/author_attestation","sign_citation":"https://pith.science/pith/KT2RTOLLSRJ3LXCPCLRYOWHC4J/action/citation_signature","submit_replication":"https://pith.science/pith/KT2RTOLLSRJ3LXCPCLRYOWHC4J/action/replication_record"}},"created_at":"2026-07-07T02:19:11.047881+00:00","updated_at":"2026-07-07T02:19:11.047881+00:00"}