{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZPS3QAGPX5B73OXWV2ECOIE22X","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":"4749358a8359630c9901f089d8ab3b9c5c74093e217256b4ff70c461a353e72e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-15T13:47:01Z","title_canon_sha256":"e94bb11a79ef88c7d8bde09f09271b11f8537c838e5ddfa7b1ad9e48da540e63"},"schema_version":"1.0","source":{"id":"1011.3381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3381","created_at":"2026-05-18T04:35:56Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3381v1","created_at":"2026-05-18T04:35:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3381","created_at":"2026-05-18T04:35:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZPS3QAGPX5B7","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZPS3QAGPX5B73OXW","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZPS3QAGP","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:c90c6b79e055895d7a1433649f548b3466a378c641cd5e8cc375af876b1ea89d","target":"graph","created_at":"2026-05-18T04:35:56Z","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"},"paper":{"abstract_excerpt":"In this paper, we show that if $k\\geq (\\nu+2)/4$, where $\\nu$ denotes the order of a graph, a non-bipartite graph $G$ is $k$-extendable if and only if it is $2k$-factor-critical. If $k\\geq (\\nu-3)/4$, a graph $G$ is $k\\ 1/2$-extendable if and only if it is $(2k+1)$-factor-critical. We also give examples to show that the two bounds are best possible. Our results are answers to a problem posted by Favaron [3] and Yu [11].","authors_text":"Dingjun Lou, Tao Wang, Zan-Bo Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-15T13:47:01Z","title":"Equivalence between Extendibility and Factor-Criticality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3381","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:7db5db6646d687fe83981be33245231f6065c44e10b08eb4f0be8252d116d839","target":"record","created_at":"2026-05-18T04:35:56Z","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":"4749358a8359630c9901f089d8ab3b9c5c74093e217256b4ff70c461a353e72e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-15T13:47:01Z","title_canon_sha256":"e94bb11a79ef88c7d8bde09f09271b11f8537c838e5ddfa7b1ad9e48da540e63"},"schema_version":"1.0","source":{"id":"1011.3381","kind":"arxiv","version":1}},"canonical_sha256":"cbe5b800cfbf43fdbaf6ae8827209ad5d19672bd4acf26a10e3f98488f9f6b20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbe5b800cfbf43fdbaf6ae8827209ad5d19672bd4acf26a10e3f98488f9f6b20","first_computed_at":"2026-05-18T04:35:56.016968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:56.016968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gQKMp6IJosWSneZ9NHL8+m1XWQnwp8dz5LSwRMrCTYl9ELp9k/pa++7V8t5qrEndfohZQvmCVs6q9MPdJJ2ABg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:56.017504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7db5db6646d687fe83981be33245231f6065c44e10b08eb4f0be8252d116d839","sha256:c90c6b79e055895d7a1433649f548b3466a378c641cd5e8cc375af876b1ea89d"],"state_sha256":"443d19b25bb72c50df0222111a42e0063710890f6418c75accf101eb0ddbbc8e"}