{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZPS3QAGPX5B73OXWV2ECOIE22X","short_pith_number":"pith:ZPS3QAGP","schema_version":"1.0","canonical_sha256":"cbe5b800cfbf43fdbaf6ae8827209ad5d19672bd4acf26a10e3f98488f9f6b20","source":{"kind":"arxiv","id":"1011.3381","version":1},"attestation_state":"computed","paper":{"title":"Equivalence between Extendibility and Factor-Criticality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dingjun Lou, Tao Wang, Zan-Bo Zhang","submitted_at":"2010-11-15T13:47:01Z","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]."},"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":"1011.3381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-15T13:47:01Z","cross_cats_sorted":[],"title_canon_sha256":"e94bb11a79ef88c7d8bde09f09271b11f8537c838e5ddfa7b1ad9e48da540e63","abstract_canon_sha256":"4749358a8359630c9901f089d8ab3b9c5c74093e217256b4ff70c461a353e72e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:56.017504Z","signature_b64":"gQKMp6IJosWSneZ9NHL8+m1XWQnwp8dz5LSwRMrCTYl9ELp9k/pa++7V8t5qrEndfohZQvmCVs6q9MPdJJ2ABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbe5b800cfbf43fdbaf6ae8827209ad5d19672bd4acf26a10e3f98488f9f6b20","last_reissued_at":"2026-05-18T04:35:56.016968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:56.016968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalence between Extendibility and Factor-Criticality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dingjun Lou, Tao Wang, Zan-Bo Zhang","submitted_at":"2010-11-15T13:47:01Z","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]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3381","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":""},"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":"1011.3381","created_at":"2026-05-18T04:35:56.017042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3381v1","created_at":"2026-05-18T04:35:56.017042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3381","created_at":"2026-05-18T04:35:56.017042+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPS3QAGPX5B7","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPS3QAGPX5B73OXW","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPS3QAGP","created_at":"2026-05-18T12:26:18.847500+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/ZPS3QAGPX5B73OXWV2ECOIE22X","json":"https://pith.science/pith/ZPS3QAGPX5B73OXWV2ECOIE22X.json","graph_json":"https://pith.science/api/pith-number/ZPS3QAGPX5B73OXWV2ECOIE22X/graph.json","events_json":"https://pith.science/api/pith-number/ZPS3QAGPX5B73OXWV2ECOIE22X/events.json","paper":"https://pith.science/paper/ZPS3QAGP"},"agent_actions":{"view_html":"https://pith.science/pith/ZPS3QAGPX5B73OXWV2ECOIE22X","download_json":"https://pith.science/pith/ZPS3QAGPX5B73OXWV2ECOIE22X.json","view_paper":"https://pith.science/paper/ZPS3QAGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3381&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPS3QAGPX5B73OXWV2ECOIE22X/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPS3QAGPX5B73OXWV2ECOIE22X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPS3QAGPX5B73OXWV2ECOIE22X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPS3QAGPX5B73OXWV2ECOIE22X/action/storage_attestation","attest_author":"https://pith.science/pith/ZPS3QAGPX5B73OXWV2ECOIE22X/action/author_attestation","sign_citation":"https://pith.science/pith/ZPS3QAGPX5B73OXWV2ECOIE22X/action/citation_signature","submit_replication":"https://pith.science/pith/ZPS3QAGPX5B73OXWV2ECOIE22X/action/replication_record"}},"created_at":"2026-05-18T04:35:56.017042+00:00","updated_at":"2026-05-18T04:35:56.017042+00:00"}