{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XHXTUSUYQORAYMQEASVSAUFBKI","short_pith_number":"pith:XHXTUSUY","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"},"canonical_sha256":"b9ef3a4a9883a20c320404ab2050a1522b23d6273b0e9f10ca32bca5668fa229","source":{"kind":"arxiv","id":"1404.5416","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XHXTUSUYQORAYMQEASVSAUFBKI","target":"record","payload":{"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"},"canonical_sha256":"b9ef3a4a9883a20c320404ab2050a1522b23d6273b0e9f10ca32bca5668fa229","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"},"source_kind":"arxiv","source_id":"1404.5416","source_version":2,"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:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFlAUDnzzi+CXJvOxS0t6NqWsESPix3hY/9PwJ+j8PvomYeFZOiXGK1yr4X0D6AeNLw+g45zj4LmF80aDLwTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:37:35.965010Z"},"content_sha256":"38c439675d67139d7b434d7d7779e55c4f354b1e9bd84e73260e201c8508a297","schema_version":"1.0","event_id":"sha256:38c439675d67139d7b434d7d7779e55c4f354b1e9bd84e73260e201c8508a297"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XHXTUSUYQORAYMQEASVSAUFBKI","target":"graph","payload":{"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"},"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:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RE7k+PgJ6zrnb8apXk7N/Gj82OUA/eNlhQ3Yg2w5emfZXUHeaP6xlNajKt46t6ZC14FRLHYydkyQqF+BqvQ0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:37:35.965383Z"},"content_sha256":"cb087aac7dbc537a4b24c7b8a3a3d125a9e3e40929f86d78aaeeb0a94434af8a","schema_version":"1.0","event_id":"sha256:cb087aac7dbc537a4b24c7b8a3a3d125a9e3e40929f86d78aaeeb0a94434af8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI/bundle.json","state_url":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHXTUSUYQORAYMQEASVSAUFBKI/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-24T20:37:35Z","links":{"resolver":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI","bundle":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI/bundle.json","state":"https://pith.science/pith/XHXTUSUYQORAYMQEASVSAUFBKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHXTUSUYQORAYMQEASVSAUFBKI/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5tAhylYDK45i/vlRZ+njjEcSjZV8BvPz52fjCehbnaBf9eYVJ6ku1oSCSE+lgk9tsKO/4Aubq2i654EhfUbCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:37:35.967518Z","bundle_sha256":"0c8ff6bd64c4af1eed9756adba2ec25b38cb2641bd302dadb94f0d4d08b8a021"}}