{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JXPPDV2AW3LAPPJYAMV5T72N4B","short_pith_number":"pith:JXPPDV2A","canonical_record":{"source":{"id":"2503.19569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-25T11:36:02Z","cross_cats_sorted":[],"title_canon_sha256":"90d34aba0a86201ce0a201f6b8050197a9038f451560bbe48cdd7075002dbf91","abstract_canon_sha256":"8dadff9a0e3e9ab04eaa6557528322dc0a5c7bb9df10857b9a60dcf2814319a6"},"schema_version":"1.0"},"canonical_sha256":"4ddef1d740b6d607bd38032bd9ff4de0453503c5e84655801de5fdfc0c073fa8","source":{"kind":"arxiv","id":"2503.19569","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.19569","created_at":"2026-07-05T10:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"2503.19569v1","created_at":"2026-07-05T10:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.19569","created_at":"2026-07-05T10:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"JXPPDV2AW3LA","created_at":"2026-07-05T10:38:57Z"},{"alias_kind":"pith_short_16","alias_value":"JXPPDV2AW3LAPPJY","created_at":"2026-07-05T10:38:57Z"},{"alias_kind":"pith_short_8","alias_value":"JXPPDV2A","created_at":"2026-07-05T10:38:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JXPPDV2AW3LAPPJYAMV5T72N4B","target":"record","payload":{"canonical_record":{"source":{"id":"2503.19569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-25T11:36:02Z","cross_cats_sorted":[],"title_canon_sha256":"90d34aba0a86201ce0a201f6b8050197a9038f451560bbe48cdd7075002dbf91","abstract_canon_sha256":"8dadff9a0e3e9ab04eaa6557528322dc0a5c7bb9df10857b9a60dcf2814319a6"},"schema_version":"1.0"},"canonical_sha256":"4ddef1d740b6d607bd38032bd9ff4de0453503c5e84655801de5fdfc0c073fa8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:57.364044Z","signature_b64":"CfCdUIltw4XrrrFf/40rNbc1kayVa+OByqHcAELNmge8reBUNhU70ns/KXeVyE+Nswh2iRmx+V6MvlkfL6r2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ddef1d740b6d607bd38032bd9ff4de0453503c5e84655801de5fdfc0c073fa8","last_reissued_at":"2026-07-05T10:38:57.363520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:57.363520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.19569","source_version":1,"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-05T10:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrkXtP4vK1BDmm0fUdkH9L0y49mKbFryKeMVESUlmNxrznzpupjrVPkWv6aP2DWm34vpW8+7vjYZTYUS2vmUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T15:56:47.570220Z"},"content_sha256":"711cab61281a3ef47d89ef79624e0cf7ae34241101af0d698ab0d0eadbbdcc9d","schema_version":"1.0","event_id":"sha256:711cab61281a3ef47d89ef79624e0cf7ae34241101af0d698ab0d0eadbbdcc9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JXPPDV2AW3LAPPJYAMV5T72N4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A problem of Erd\\H{o}s and Hajnal on paths with equal-degree endpoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Kaizhe Chen","submitted_at":"2025-03-25T11:36:02Z","abstract_excerpt":"We address a problem posed by Erd\\H{o}s and Hajnal in 1991, proving that for all $n \\geq 600$, every $(2n+1)$-vertex graph with 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}$ demonstrates that this edge bound is sharp. We further establish an analogous result for graphs with even order and investigate several related extremal problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.19569","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/2503.19569/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-05T10:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8P0e/BM51XfugbJ36XNvjPy+cUM+biPk4lb+Uq7oXRTr8+fn717I8XAlJkkku23nb9kGF+DjmktbJHLkYfduAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T15:56:47.570606Z"},"content_sha256":"6538aadb9116fe952e9a7bfe0a1f414341f9964d74c37d93362410fe4841a652","schema_version":"1.0","event_id":"sha256:6538aadb9116fe952e9a7bfe0a1f414341f9964d74c37d93362410fe4841a652"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXPPDV2AW3LAPPJYAMV5T72N4B/bundle.json","state_url":"https://pith.science/pith/JXPPDV2AW3LAPPJYAMV5T72N4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXPPDV2AW3LAPPJYAMV5T72N4B/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-07-14T15:56:47Z","links":{"resolver":"https://pith.science/pith/JXPPDV2AW3LAPPJYAMV5T72N4B","bundle":"https://pith.science/pith/JXPPDV2AW3LAPPJYAMV5T72N4B/bundle.json","state":"https://pith.science/pith/JXPPDV2AW3LAPPJYAMV5T72N4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXPPDV2AW3LAPPJYAMV5T72N4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JXPPDV2AW3LAPPJYAMV5T72N4B","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":"8dadff9a0e3e9ab04eaa6557528322dc0a5c7bb9df10857b9a60dcf2814319a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-25T11:36:02Z","title_canon_sha256":"90d34aba0a86201ce0a201f6b8050197a9038f451560bbe48cdd7075002dbf91"},"schema_version":"1.0","source":{"id":"2503.19569","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.19569","created_at":"2026-07-05T10:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"2503.19569v1","created_at":"2026-07-05T10:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.19569","created_at":"2026-07-05T10:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"JXPPDV2AW3LA","created_at":"2026-07-05T10:38:57Z"},{"alias_kind":"pith_short_16","alias_value":"JXPPDV2AW3LAPPJY","created_at":"2026-07-05T10:38:57Z"},{"alias_kind":"pith_short_8","alias_value":"JXPPDV2A","created_at":"2026-07-05T10:38:57Z"}],"graph_snapshots":[{"event_id":"sha256:6538aadb9116fe952e9a7bfe0a1f414341f9964d74c37d93362410fe4841a652","target":"graph","created_at":"2026-07-05T10:38:57Z","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/2503.19569/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address a problem posed by Erd\\H{o}s and Hajnal in 1991, proving that for all $n \\geq 600$, every $(2n+1)$-vertex graph with 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}$ demonstrates that this edge bound is sharp. We further establish an analogous result for graphs with even order and investigate several related extremal problems.","authors_text":"Jie Ma, Kaizhe Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-25T11:36:02Z","title":"A problem of Erd\\H{o}s and Hajnal on paths with equal-degree endpoints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.19569","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:711cab61281a3ef47d89ef79624e0cf7ae34241101af0d698ab0d0eadbbdcc9d","target":"record","created_at":"2026-07-05T10:38:57Z","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":"8dadff9a0e3e9ab04eaa6557528322dc0a5c7bb9df10857b9a60dcf2814319a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-25T11:36:02Z","title_canon_sha256":"90d34aba0a86201ce0a201f6b8050197a9038f451560bbe48cdd7075002dbf91"},"schema_version":"1.0","source":{"id":"2503.19569","kind":"arxiv","version":1}},"canonical_sha256":"4ddef1d740b6d607bd38032bd9ff4de0453503c5e84655801de5fdfc0c073fa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ddef1d740b6d607bd38032bd9ff4de0453503c5e84655801de5fdfc0c073fa8","first_computed_at":"2026-07-05T10:38:57.363520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:38:57.363520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CfCdUIltw4XrrrFf/40rNbc1kayVa+OByqHcAELNmge8reBUNhU70ns/KXeVyE+Nswh2iRmx+V6MvlkfL6r2BA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:38:57.364044Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.19569","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:711cab61281a3ef47d89ef79624e0cf7ae34241101af0d698ab0d0eadbbdcc9d","sha256:6538aadb9116fe952e9a7bfe0a1f414341f9964d74c37d93362410fe4841a652"],"state_sha256":"f7f1074dbadfc21cc59246673bed603209f46f2d26b9a0cfe935afcfbfbd9edb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"viPvqIdyJwCUxKEm/zC4z8EIRddXoO056d+O+GnLEZ2LzSgUUNsA5V/BBFdEQjGK23OKGLtd7cArNyMmXMpdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T15:56:47.573069Z","bundle_sha256":"c04e07448fcf9d58dbbb74b27e097f964235337dc73425c0bb2a5c6b1411debf"}}