{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Y5LH72KIEKT7E5OENJ7YRZXRO7","short_pith_number":"pith:Y5LH72KI","schema_version":"1.0","canonical_sha256":"c7567fe94822a7f275c46a7f88e6f177fcbcb207093669ee4564af13b15c8e78","source":{"kind":"arxiv","id":"1210.5683","version":1},"attestation_state":"computed","paper":{"title":"On the Existence of General Factors in Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David G. L. Wang, Hongliang Lu, Qinglin Yu","submitted_at":"2012-10-21T04:23:24Z","abstract_excerpt":"Let $G$ be a graph, and $H\\colon V(G)\\to 2^\\mathbb{N}$ a set function associated with $G$. A spanning subgraph $F$ of $G$ is called an $H$-factor if the degree of any vertex $v$ in $F$ belongs to the set $H(v)$. This paper contains two results on the existence of $H$-factors in regular graphs. First, we construct an $r$-regular graph without some given $H^*$-factor. In particular, this gives a negative answer to a problem recently posed by Akbari and Kano. Second, by using Lov\\'asz's characterization theorem on the existence of $(g, f)$-factors, we find a sharp condition for the existence of g"},"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":"1210.5683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-21T04:23:24Z","cross_cats_sorted":[],"title_canon_sha256":"bf2de0daa2281e794948e7942c833d94113d85df347bac9b599e3cfe95bdd027","abstract_canon_sha256":"4dbdeb8d05dea378df6d8ebbc809daca3cbc5a0be6dec6ceaae3430f18fa9d5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:43.334104Z","signature_b64":"tSZx+/UplwMDTii/NfkL/97Wt+rsFMVkLe53s0qy9yMkYFzPEgVA9Ay4PDiH2MAYHNZOvY2BI98Y6qSwmXA5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7567fe94822a7f275c46a7f88e6f177fcbcb207093669ee4564af13b15c8e78","last_reissued_at":"2026-05-18T03:42:43.333418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:43.333418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Existence of General Factors in Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David G. L. Wang, Hongliang Lu, Qinglin Yu","submitted_at":"2012-10-21T04:23:24Z","abstract_excerpt":"Let $G$ be a graph, and $H\\colon V(G)\\to 2^\\mathbb{N}$ a set function associated with $G$. A spanning subgraph $F$ of $G$ is called an $H$-factor if the degree of any vertex $v$ in $F$ belongs to the set $H(v)$. This paper contains two results on the existence of $H$-factors in regular graphs. First, we construct an $r$-regular graph without some given $H^*$-factor. In particular, this gives a negative answer to a problem recently posed by Akbari and Kano. Second, by using Lov\\'asz's characterization theorem on the existence of $(g, f)$-factors, we find a sharp condition for the existence of g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5683","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":"1210.5683","created_at":"2026-05-18T03:42:43.333520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.5683v1","created_at":"2026-05-18T03:42:43.333520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5683","created_at":"2026-05-18T03:42:43.333520+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5LH72KIEKT7","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5LH72KIEKT7E5OE","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5LH72KI","created_at":"2026-05-18T12:27:27.928770+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/Y5LH72KIEKT7E5OENJ7YRZXRO7","json":"https://pith.science/pith/Y5LH72KIEKT7E5OENJ7YRZXRO7.json","graph_json":"https://pith.science/api/pith-number/Y5LH72KIEKT7E5OENJ7YRZXRO7/graph.json","events_json":"https://pith.science/api/pith-number/Y5LH72KIEKT7E5OENJ7YRZXRO7/events.json","paper":"https://pith.science/paper/Y5LH72KI"},"agent_actions":{"view_html":"https://pith.science/pith/Y5LH72KIEKT7E5OENJ7YRZXRO7","download_json":"https://pith.science/pith/Y5LH72KIEKT7E5OENJ7YRZXRO7.json","view_paper":"https://pith.science/paper/Y5LH72KI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.5683&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5LH72KIEKT7E5OENJ7YRZXRO7/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5LH72KIEKT7E5OENJ7YRZXRO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5LH72KIEKT7E5OENJ7YRZXRO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5LH72KIEKT7E5OENJ7YRZXRO7/action/storage_attestation","attest_author":"https://pith.science/pith/Y5LH72KIEKT7E5OENJ7YRZXRO7/action/author_attestation","sign_citation":"https://pith.science/pith/Y5LH72KIEKT7E5OENJ7YRZXRO7/action/citation_signature","submit_replication":"https://pith.science/pith/Y5LH72KIEKT7E5OENJ7YRZXRO7/action/replication_record"}},"created_at":"2026-05-18T03:42:43.333520+00:00","updated_at":"2026-05-18T03:42:43.333520+00:00"}