{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WDOHXNNZZ2GKL62FSONACP7IBH","short_pith_number":"pith:WDOHXNNZ","schema_version":"1.0","canonical_sha256":"b0dc7bb5b9ce8ca5fb45939a013fe809e7bb79a70f9cf5b4dcb2a18a37c74fef","source":{"kind":"arxiv","id":"1212.3940","version":1},"attestation_state":"computed","paper":{"title":"3-Factor-criticality of vertex-transitive graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Wuyang Sun","submitted_at":"2012-12-17T09:17:37Z","abstract_excerpt":"A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-Factor-critical graphs and 2-factor-critical graphs are factor-critical graphs and bicritical graphs, respectively. It is well known that every connected vertex-transitive graph of odd order is factor-critical and every connected non-bipartite vertex-transitive graph of even order is bicritical. In this paper, we show that a simple connected vertex-transitive graph of odd order at least 5 is 3-factor-critical if "},"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":"1212.3940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-17T09:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"3ce89b18c70ec8ff2d403e8eb9945b38dd4de1659b20cdacb723292357f345ee","abstract_canon_sha256":"737d18c8351f62596edef8ae71bb63767dde599c42bc87774f113554db45d359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:21.981349Z","signature_b64":"eVD9mzhVAV/y0IOraBU6Lkxpo29YHy9gtxkXsbk6EVGyNrca4lesIj89A04ALCHWrupbxtRrOcSq1FXDm6dWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0dc7bb5b9ce8ca5fb45939a013fe809e7bb79a70f9cf5b4dcb2a18a37c74fef","last_reissued_at":"2026-05-18T03:38:21.980745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:21.980745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3-Factor-criticality of vertex-transitive graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Wuyang Sun","submitted_at":"2012-12-17T09:17:37Z","abstract_excerpt":"A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-Factor-critical graphs and 2-factor-critical graphs are factor-critical graphs and bicritical graphs, respectively. It is well known that every connected vertex-transitive graph of odd order is factor-critical and every connected non-bipartite vertex-transitive graph of even order is bicritical. In this paper, we show that a simple connected vertex-transitive graph of odd order at least 5 is 3-factor-critical if "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3940","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":"1212.3940","created_at":"2026-05-18T03:38:21.980844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3940v1","created_at":"2026-05-18T03:38:21.980844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3940","created_at":"2026-05-18T03:38:21.980844+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDOHXNNZZ2GK","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDOHXNNZZ2GKL62F","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDOHXNNZ","created_at":"2026-05-18T12:27:25.539911+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/WDOHXNNZZ2GKL62FSONACP7IBH","json":"https://pith.science/pith/WDOHXNNZZ2GKL62FSONACP7IBH.json","graph_json":"https://pith.science/api/pith-number/WDOHXNNZZ2GKL62FSONACP7IBH/graph.json","events_json":"https://pith.science/api/pith-number/WDOHXNNZZ2GKL62FSONACP7IBH/events.json","paper":"https://pith.science/paper/WDOHXNNZ"},"agent_actions":{"view_html":"https://pith.science/pith/WDOHXNNZZ2GKL62FSONACP7IBH","download_json":"https://pith.science/pith/WDOHXNNZZ2GKL62FSONACP7IBH.json","view_paper":"https://pith.science/paper/WDOHXNNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3940&json=true","fetch_graph":"https://pith.science/api/pith-number/WDOHXNNZZ2GKL62FSONACP7IBH/graph.json","fetch_events":"https://pith.science/api/pith-number/WDOHXNNZZ2GKL62FSONACP7IBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDOHXNNZZ2GKL62FSONACP7IBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDOHXNNZZ2GKL62FSONACP7IBH/action/storage_attestation","attest_author":"https://pith.science/pith/WDOHXNNZZ2GKL62FSONACP7IBH/action/author_attestation","sign_citation":"https://pith.science/pith/WDOHXNNZZ2GKL62FSONACP7IBH/action/citation_signature","submit_replication":"https://pith.science/pith/WDOHXNNZZ2GKL62FSONACP7IBH/action/replication_record"}},"created_at":"2026-05-18T03:38:21.980844+00:00","updated_at":"2026-05-18T03:38:21.980844+00:00"}