{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:P3K6VNWZT7VBMCLHVKH5KYMLVT","short_pith_number":"pith:P3K6VNWZ","schema_version":"1.0","canonical_sha256":"7ed5eab6d99fea160967aa8fd5618baccb93379ffe4356d6df3063e5663853c9","source":{"kind":"arxiv","id":"1104.5113","version":1},"attestation_state":"computed","paper":{"title":"An Alternative Proof of the $H$-Factor Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Qinglin Yu","submitted_at":"2011-04-27T11:06:19Z","abstract_excerpt":"Let $H: V(G) \\rightarrow 2^{\\mathbb{N}}$ be a set mapping for a graph $G$. Given a spanning subgraph $F$ of $G$, $F$ is called a {\\it general factor} or an $H$-{\\it factor} of $G$ if $d_{F}(x)\\in H(x)$ for every vertex $x\\in V(G)$. $H$-factor problems are, in general, $NP$-complete problems and imply many well-known factor problems (e.g., perfect matchings, $f$-factor problems and $(g, f)$-factor problems) as special cases. Lov\\'asz [The factorization of graphs (II),\n  Acta Math. Hungar., 23 (1972), 223--246] gave a structure description and obtained a deficiency formula for $H$-optimal subgra"},"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":"1104.5113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-27T11:06:19Z","cross_cats_sorted":[],"title_canon_sha256":"8b50bc3d8f8d3b2d3a1337667a56afe719d8e376ef969832280dd64d6c945f25","abstract_canon_sha256":"923cc0c06ae748bb197fcf3570410a538e7912651e311dfdce860a5c9ca42960"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:22.610040Z","signature_b64":"z0urmk7wdAxpy1ySFHGKZpq0QkDV7H0jTbv5LtiYSDh6S6SjC2dPFJJyCCaDDCKZPN5Y4b6pZGChNo8SPTKqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ed5eab6d99fea160967aa8fd5618baccb93379ffe4356d6df3063e5663853c9","last_reissued_at":"2026-05-18T04:23:22.609496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:22.609496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Alternative Proof of the $H$-Factor Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Qinglin Yu","submitted_at":"2011-04-27T11:06:19Z","abstract_excerpt":"Let $H: V(G) \\rightarrow 2^{\\mathbb{N}}$ be a set mapping for a graph $G$. Given a spanning subgraph $F$ of $G$, $F$ is called a {\\it general factor} or an $H$-{\\it factor} of $G$ if $d_{F}(x)\\in H(x)$ for every vertex $x\\in V(G)$. $H$-factor problems are, in general, $NP$-complete problems and imply many well-known factor problems (e.g., perfect matchings, $f$-factor problems and $(g, f)$-factor problems) as special cases. Lov\\'asz [The factorization of graphs (II),\n  Acta Math. Hungar., 23 (1972), 223--246] gave a structure description and obtained a deficiency formula for $H$-optimal subgra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5113","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":"1104.5113","created_at":"2026-05-18T04:23:22.609582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5113v1","created_at":"2026-05-18T04:23:22.609582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5113","created_at":"2026-05-18T04:23:22.609582+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3K6VNWZT7VB","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3K6VNWZT7VBMCLH","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3K6VNWZ","created_at":"2026-05-18T12:26:39.201973+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/P3K6VNWZT7VBMCLHVKH5KYMLVT","json":"https://pith.science/pith/P3K6VNWZT7VBMCLHVKH5KYMLVT.json","graph_json":"https://pith.science/api/pith-number/P3K6VNWZT7VBMCLHVKH5KYMLVT/graph.json","events_json":"https://pith.science/api/pith-number/P3K6VNWZT7VBMCLHVKH5KYMLVT/events.json","paper":"https://pith.science/paper/P3K6VNWZ"},"agent_actions":{"view_html":"https://pith.science/pith/P3K6VNWZT7VBMCLHVKH5KYMLVT","download_json":"https://pith.science/pith/P3K6VNWZT7VBMCLHVKH5KYMLVT.json","view_paper":"https://pith.science/paper/P3K6VNWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5113&json=true","fetch_graph":"https://pith.science/api/pith-number/P3K6VNWZT7VBMCLHVKH5KYMLVT/graph.json","fetch_events":"https://pith.science/api/pith-number/P3K6VNWZT7VBMCLHVKH5KYMLVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3K6VNWZT7VBMCLHVKH5KYMLVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3K6VNWZT7VBMCLHVKH5KYMLVT/action/storage_attestation","attest_author":"https://pith.science/pith/P3K6VNWZT7VBMCLHVKH5KYMLVT/action/author_attestation","sign_citation":"https://pith.science/pith/P3K6VNWZT7VBMCLHVKH5KYMLVT/action/citation_signature","submit_replication":"https://pith.science/pith/P3K6VNWZT7VBMCLHVKH5KYMLVT/action/replication_record"}},"created_at":"2026-05-18T04:23:22.609582+00:00","updated_at":"2026-05-18T04:23:22.609582+00:00"}