{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QO3EWCUXBYZQWHO237MWZYWC4H","short_pith_number":"pith:QO3EWCUX","canonical_record":{"source":{"id":"1409.2117","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-09-07T13:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"6060befc400595be0e3dabde196167d3febdda2568831cae596eab5c0861a774","abstract_canon_sha256":"d305700ca1accd8765062184ef01223233cdcd1155459b207dfba6867a5de6ae"},"schema_version":"1.0"},"canonical_sha256":"83b64b0a970e330b1ddadfd96ce2c2e1ca38d96bf4275605cceb7690fda853ed","source":{"kind":"arxiv","id":"1409.2117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2117","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2117v1","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2117","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"QO3EWCUXBYZQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QO3EWCUXBYZQWHO2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QO3EWCUX","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QO3EWCUXBYZQWHO237MWZYWC4H","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2117","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-09-07T13:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"6060befc400595be0e3dabde196167d3febdda2568831cae596eab5c0861a774","abstract_canon_sha256":"d305700ca1accd8765062184ef01223233cdcd1155459b207dfba6867a5de6ae"},"schema_version":"1.0"},"canonical_sha256":"83b64b0a970e330b1ddadfd96ce2c2e1ca38d96bf4275605cceb7690fda853ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:17.832077Z","signature_b64":"jKYcjyx+uveAcOZVXqY71i9e11RANEktbrdplkOozuihepFbawvYBNxSKaPp2rMDGkn/f0nzl+pLspvA/MLcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b64b0a970e330b1ddadfd96ce2c2e1ca38d96bf4275605cceb7690fda853ed","last_reissued_at":"2026-05-18T02:43:17.831467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:17.831467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2117","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ze4fS8HKO4Lw0TL3Ga6kV7CGBliuqrZ9o1YrsjtdFdfA57KhOdrUq9tfJJi1ixThIrNe9iMXQVkVvLKNf8kABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T01:40:25.081001Z"},"content_sha256":"eb665d075ecfed47e27161f828044701e8dd328b780a3805a6dfd89d3a44d437","schema_version":"1.0","event_id":"sha256:eb665d075ecfed47e27161f828044701e8dd328b780a3805a6dfd89d3a44d437"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QO3EWCUXBYZQWHO237MWZYWC4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"4-Factor-criticality of vertex-transitive graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Wuyang Sun","submitted_at":"2014-09-07T13:12:42Z","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 well-known factor-critical graphs and bicritical graphs, respectively. It is known that if a connected vertex-transitive graph has odd order, then it is factor-critical, otherwise it is elementary bipartite or bicritical. In this paper, we show that a connected vertex-transitive non-bipartite graph of even order at least 6 is 4-factor-critical if and only if"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2117","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIYCrxYLuCjbGvEI1DYkSLYv4Ay8Oc2o3VFLplf63o6XwBG5aCzSsMZpUMfFuMCeO9b8//XXOBZQL0NH02lJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T01:40:25.081358Z"},"content_sha256":"695e4900b6ef343c22293c974fd668b02e35bd77e60cbcb79a0da7dc4770b643","schema_version":"1.0","event_id":"sha256:695e4900b6ef343c22293c974fd668b02e35bd77e60cbcb79a0da7dc4770b643"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QO3EWCUXBYZQWHO237MWZYWC4H/bundle.json","state_url":"https://pith.science/pith/QO3EWCUXBYZQWHO237MWZYWC4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QO3EWCUXBYZQWHO237MWZYWC4H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T01:40:25Z","links":{"resolver":"https://pith.science/pith/QO3EWCUXBYZQWHO237MWZYWC4H","bundle":"https://pith.science/pith/QO3EWCUXBYZQWHO237MWZYWC4H/bundle.json","state":"https://pith.science/pith/QO3EWCUXBYZQWHO237MWZYWC4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QO3EWCUXBYZQWHO237MWZYWC4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QO3EWCUXBYZQWHO237MWZYWC4H","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":"d305700ca1accd8765062184ef01223233cdcd1155459b207dfba6867a5de6ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-09-07T13:12:42Z","title_canon_sha256":"6060befc400595be0e3dabde196167d3febdda2568831cae596eab5c0861a774"},"schema_version":"1.0","source":{"id":"1409.2117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2117","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2117v1","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2117","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"QO3EWCUXBYZQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QO3EWCUXBYZQWHO2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QO3EWCUX","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:695e4900b6ef343c22293c974fd668b02e35bd77e60cbcb79a0da7dc4770b643","target":"graph","created_at":"2026-05-18T02:43:17Z","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":"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 well-known factor-critical graphs and bicritical graphs, respectively. It is known that if a connected vertex-transitive graph has odd order, then it is factor-critical, otherwise it is elementary bipartite or bicritical. In this paper, we show that a connected vertex-transitive non-bipartite graph of even order at least 6 is 4-factor-critical if and only if","authors_text":"Heping Zhang, Wuyang Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-09-07T13:12:42Z","title":"4-Factor-criticality of vertex-transitive graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2117","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:eb665d075ecfed47e27161f828044701e8dd328b780a3805a6dfd89d3a44d437","target":"record","created_at":"2026-05-18T02:43:17Z","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":"d305700ca1accd8765062184ef01223233cdcd1155459b207dfba6867a5de6ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-09-07T13:12:42Z","title_canon_sha256":"6060befc400595be0e3dabde196167d3febdda2568831cae596eab5c0861a774"},"schema_version":"1.0","source":{"id":"1409.2117","kind":"arxiv","version":1}},"canonical_sha256":"83b64b0a970e330b1ddadfd96ce2c2e1ca38d96bf4275605cceb7690fda853ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83b64b0a970e330b1ddadfd96ce2c2e1ca38d96bf4275605cceb7690fda853ed","first_computed_at":"2026-05-18T02:43:17.831467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:17.831467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jKYcjyx+uveAcOZVXqY71i9e11RANEktbrdplkOozuihepFbawvYBNxSKaPp2rMDGkn/f0nzl+pLspvA/MLcAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:17.832077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb665d075ecfed47e27161f828044701e8dd328b780a3805a6dfd89d3a44d437","sha256:695e4900b6ef343c22293c974fd668b02e35bd77e60cbcb79a0da7dc4770b643"],"state_sha256":"eda0e9c8786bb803ca7c43ca14b9c6e3fc09dab3df3ca2f52dc1c8b89ce7a438"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCUnujkW7yf++FJ750gCklCW396St6cdur92HvMjdIL0hsY4GQ4D7VX4KotTKKIeLI0cIZtqUaPoDQpFo1hjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T01:40:25.083326Z","bundle_sha256":"0259b2a7e30af554cc98943b3469aad70f7894fa43e532105c4c95c598a8aaa5"}}