{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VHD6MPN5JPQFBOGGO2SXQBWMEJ","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":"054495d7901ccc0d07960146608b2d957d0e5187ff3978cfe27cd799654fea2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-08T13:55:36Z","title_canon_sha256":"269d5a8849bbc66f429fa0143c8aecec9513418f9ca0ce1312767d2e9c3e0508"},"schema_version":"1.0","source":{"id":"2305.04713","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.04713","created_at":"2026-07-05T06:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"2305.04713v2","created_at":"2026-07-05T06:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04713","created_at":"2026-07-05T06:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"VHD6MPN5JPQF","created_at":"2026-07-05T06:08:28Z"},{"alias_kind":"pith_short_16","alias_value":"VHD6MPN5JPQFBOGG","created_at":"2026-07-05T06:08:28Z"},{"alias_kind":"pith_short_8","alias_value":"VHD6MPN5","created_at":"2026-07-05T06:08:28Z"}],"graph_snapshots":[{"event_id":"sha256:046178a3c52deedd78ca8ed713efe65f8ee75799b0aa8c2103b3391a3b30d210","target":"graph","created_at":"2026-07-05T06:08:28Z","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/2305.04713/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A spanning subgraph $H$ of a graph $G$ is called a $P_{\\geq k}$-factor of $G$ if every component of $H$ is isomorphic to a path of order at least $k$, where $k\\geq2$ is an integer. A graph $G$ is called a $(P_{\\geq k},l)$-factor critical graph if $G-V'$ contains a $P_{\\geq k}$-factor for any $V'\\subseteq V(G)$ with $|V'|=l$. A graph $G$ is called a $(P_{\\geq k},m)$-factor deleted graph if $G-E'$ has a $P_{\\geq k}$-factor for any $E'\\subseteq E(G)$ with $|E'|=m$. Intuitively, if a graph is dense enough, it will have a $P_{\\geq 3}$-factor. In this paper, we give some sufficient conditions for a ","authors_text":"Guowei Dai, Hui Qin, Ting Jin, Yuan Chen, Yuan Yuan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-08T13:55:36Z","title":"Sufficient conditions for the existence of path-factors with given properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04713","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:b9e76ac04a22494808b3ac03f08d95426bf06d80366725ec5bf762ca8c4afda1","target":"record","created_at":"2026-07-05T06:08:28Z","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":"054495d7901ccc0d07960146608b2d957d0e5187ff3978cfe27cd799654fea2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-08T13:55:36Z","title_canon_sha256":"269d5a8849bbc66f429fa0143c8aecec9513418f9ca0ce1312767d2e9c3e0508"},"schema_version":"1.0","source":{"id":"2305.04713","kind":"arxiv","version":2}},"canonical_sha256":"a9c7e63dbd4be050b8c676a57806cc225d2c5e79550a8f2fa10b38a3adfcaa9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9c7e63dbd4be050b8c676a57806cc225d2c5e79550a8f2fa10b38a3adfcaa9e","first_computed_at":"2026-07-05T06:08:28.787164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:08:28.787164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"naexibp8LqvWQF3A/GtuocQwJjMy7eKh3CEM/LnRqCgGhHEWbX/HsolC7C3SKw5aoMQPfUaK0uTpuTcajpLjDw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:08:28.787737Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.04713","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9e76ac04a22494808b3ac03f08d95426bf06d80366725ec5bf762ca8c4afda1","sha256:046178a3c52deedd78ca8ed713efe65f8ee75799b0aa8c2103b3391a3b30d210"],"state_sha256":"092ce3d8f60d2db95bd781c0d2e1200f6ab000137628caeca75cb36f6d74f447"}