{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XHXTUSUYQORAYMQEASVSAUFBKI","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":"0859d1b65b85463aa8cc52b52f07d0e627ab372096a3945a3c56f35698cc3e08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-22T08:22:58Z","title_canon_sha256":"ac04f00cf1af40b28eb0aaa0f1ecfdb5470b4b206cbf374c919b63504c529c10"},"schema_version":"1.0","source":{"id":"1404.5416","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5416","created_at":"2026-05-18T02:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5416v2","created_at":"2026-05-18T02:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5416","created_at":"2026-05-18T02:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"XHXTUSUYQORA","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XHXTUSUYQORAYMQE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XHXTUSUY","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:cb087aac7dbc537a4b24c7b8a3a3d125a9e3e40929f86d78aaeeb0a94434af8a","target":"graph","created_at":"2026-05-18T02:51:43Z","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 near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove that a connected graph $G$ is near-factor-critical if and only if it has a perfect matching. We also characterize disconnected near-factor-critical graphs.","authors_text":"Ko-Wei Lih, Kuo-Ching Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-22T08:22:58Z","title":"A Note on Near-factor-critical Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5416","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:38c439675d67139d7b434d7d7779e55c4f354b1e9bd84e73260e201c8508a297","target":"record","created_at":"2026-05-18T02:51:43Z","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":"0859d1b65b85463aa8cc52b52f07d0e627ab372096a3945a3c56f35698cc3e08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-22T08:22:58Z","title_canon_sha256":"ac04f00cf1af40b28eb0aaa0f1ecfdb5470b4b206cbf374c919b63504c529c10"},"schema_version":"1.0","source":{"id":"1404.5416","kind":"arxiv","version":2}},"canonical_sha256":"b9ef3a4a9883a20c320404ab2050a1522b23d6273b0e9f10ca32bca5668fa229","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9ef3a4a9883a20c320404ab2050a1522b23d6273b0e9f10ca32bca5668fa229","first_computed_at":"2026-05-18T02:51:43.412878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:43.412878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MS4Mkt+q8EjVcjHqPxCNP/lfaVA1ivMoECRl0DYW0L+GKvHiYNl2OWlhiEtMzFjJrU4UF5CgC2G2Sl4Em0OdCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:43.413479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5416","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38c439675d67139d7b434d7d7779e55c4f354b1e9bd84e73260e201c8508a297","sha256:cb087aac7dbc537a4b24c7b8a3a3d125a9e3e40929f86d78aaeeb0a94434af8a"],"state_sha256":"6e5d8133ec22658bec287563fa5a9276359a17fe4aaffc841538a7da67100097"}