{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XHXTUSUYQORAYMQEASVSAUFBKI","short_pith_number":"pith:XHXTUSUY","schema_version":"1.0","canonical_sha256":"b9ef3a4a9883a20c320404ab2050a1522b23d6273b0e9f10ca32bca5668fa229","source":{"kind":"arxiv","id":"1404.5416","version":2},"attestation_state":"computed","paper":{"title":"A Note on Near-factor-critical Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ko-Wei Lih, Kuo-Ching Huang","submitted_at":"2014-04-22T08:22:58Z","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."},"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":"1404.5416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-22T08:22:58Z","cross_cats_sorted":[],"title_canon_sha256":"ac04f00cf1af40b28eb0aaa0f1ecfdb5470b4b206cbf374c919b63504c529c10","abstract_canon_sha256":"0859d1b65b85463aa8cc52b52f07d0e627ab372096a3945a3c56f35698cc3e08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:43.413479Z","signature_b64":"MS4Mkt+q8EjVcjHqPxCNP/lfaVA1ivMoECRl0DYW0L+GKvHiYNl2OWlhiEtMzFjJrU4UF5CgC2G2Sl4Em0OdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9ef3a4a9883a20c320404ab2050a1522b23d6273b0e9f10ca32bca5668fa229","last_reissued_at":"2026-05-18T02:51:43.412878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:43.412878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Near-factor-critical Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ko-Wei Lih, Kuo-Ching Huang","submitted_at":"2014-04-22T08:22:58Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5416","kind":"arxiv","version":2},"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":"1404.5416","created_at":"2026-05-18T02:51:43.412971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5416v2","created_at":"2026-05-18T02:51:43.412971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5416","created_at":"2026-05-18T02:51:43.412971+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHXTUSUYQORA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHXTUSUYQORAYMQE","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHXTUSUY","created_at":"2026-05-18T12:28:57.508820+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/XHXTUSUYQORAYMQEASVSAUFBKI","json":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI.json","graph_json":"https://pith.science/api/pith-number/XHXTUSUYQORAYMQEASVSAUFBKI/graph.json","events_json":"https://pith.science/api/pith-number/XHXTUSUYQORAYMQEASVSAUFBKI/events.json","paper":"https://pith.science/paper/XHXTUSUY"},"agent_actions":{"view_html":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI","download_json":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI.json","view_paper":"https://pith.science/paper/XHXTUSUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5416&json=true","fetch_graph":"https://pith.science/api/pith-number/XHXTUSUYQORAYMQEASVSAUFBKI/graph.json","fetch_events":"https://pith.science/api/pith-number/XHXTUSUYQORAYMQEASVSAUFBKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI/action/storage_attestation","attest_author":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI/action/author_attestation","sign_citation":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI/action/citation_signature","submit_replication":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI/action/replication_record"}},"created_at":"2026-05-18T02:51:43.412971+00:00","updated_at":"2026-05-18T02:51:43.412971+00:00"}