{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:23XYCYULXDUWNFCHIXGMLYQPGP","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":"490a0169b94a0846ab0039438adcacab5627f3fdc160b635339e5e13b16f7f0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-02T00:20:51Z","title_canon_sha256":"9aeb6ef7a4eaff57f6d147db36ff80d041e58bac24dc2645786a10cc166e89ea"},"schema_version":"1.0","source":{"id":"1908.00665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00665","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00665v1","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00665","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"23XYCYULXDUW","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"pith_short_16","alias_value":"23XYCYULXDUWNFCH","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"pith_short_8","alias_value":"23XYCYUL","created_at":"2026-07-04T23:51:08Z"}],"graph_snapshots":[{"event_id":"sha256:7ec271956b04c4bc2871cc062172bc17dc3eef3cf236d64ebb915dc6eb6554e6","target":"graph","created_at":"2026-07-04T23:51:08Z","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/1908.00665/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Erd\\H{o}s-Gallai Theorem states that every graph of average degree more than $l-2$ contains a path of order $l$ for $l\\ge 2$. In this paper, we obtain a stability version of the Erd\\H{o}s-Gallai Theorem in terms of minimum degree. Let $G$ be a connected graph of order $n$ and $F=(\\bigcup_{i=1}^kP_{2a_i})\\bigcup(\\bigcup_{i=1}^lP_{2b_i+1})$ be $k+l$ disjoint paths of order $2a_1, \\ldots, 2a_{k}, 2b_1+1, \\ldots, 2b_l+1,$ respectively, where $k\\ge 0$, $0\\le l\\le 2$, and $k+l\\geq 2$. If the minimum degree $\\delta(G)\\ge \\sum_{i=1}^ka_i+\\sum_{i=1}^lb_i-1$, then $F\\subseteq G$ except several class","authors_text":"Ming-Zhu Chen, Xiao-Dong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-02T00:20:51Z","title":"Erdos-Gallai Stability Theorem for Linear Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00665","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:ac63c8a321f16b22c5747a11d85f9664ce67e249d44ead89c7c51b1e85747ccc","target":"record","created_at":"2026-07-04T23:51:08Z","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":"490a0169b94a0846ab0039438adcacab5627f3fdc160b635339e5e13b16f7f0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-02T00:20:51Z","title_canon_sha256":"9aeb6ef7a4eaff57f6d147db36ff80d041e58bac24dc2645786a10cc166e89ea"},"schema_version":"1.0","source":{"id":"1908.00665","kind":"arxiv","version":1}},"canonical_sha256":"d6ef81628bb8e966944745ccc5e20f33e8c7afc8333841487fd32696bb87a86b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6ef81628bb8e966944745ccc5e20f33e8c7afc8333841487fd32696bb87a86b","first_computed_at":"2026-07-04T23:51:08.007969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:08.007969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZCPFf3NvDGs8spO7/GPX5CcfX5egFB+aZColkEM0YNjD8c2AoVurLBbiaq+Yse8UlBck56fahWmjUMH5UxQvBw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:08.008462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac63c8a321f16b22c5747a11d85f9664ce67e249d44ead89c7c51b1e85747ccc","sha256:7ec271956b04c4bc2871cc062172bc17dc3eef3cf236d64ebb915dc6eb6554e6"],"state_sha256":"346dce07fa20ce17beac88c1f6fa06c06eabed427c39f0bc31edadbb4fdd27a4"}