{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZG3JASDZUXEPQF5IJ4WOUKYW42","short_pith_number":"pith:ZG3JASDZ","schema_version":"1.0","canonical_sha256":"c9b6904879a5c8f817a84f2cea2b16e6b28a8f62a8d691b0e53ab46c2d184137","source":{"kind":"arxiv","id":"1109.4863","version":1},"attestation_state":"computed","paper":{"title":"On Cui-Kano's Characterization Problem on Graph Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David G. L. Wang, H. L. Lu","submitted_at":"2011-09-22T16:08:21Z","abstract_excerpt":"An $H_n$-factor of a graph $G$ is defined to be a spanning subgraph $F$ of $G$ such that each vertex has degree belonging to the set $\\{1,3,5,...,2n-1,2n\\}$ in $F$. In this paper, we investigate $H_n$-factors of graphs by using Lov\\'asz's structural descriptions to the degree prescribed subgraph problem. We find some sufficient conditions for the existence of an $H_n$-factor of a graph. In particular, we make progress on the characterization problem for a special family of graphs proposed by Cui and Kano in 1988."},"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":"1109.4863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-22T16:08:21Z","cross_cats_sorted":[],"title_canon_sha256":"74d54d22e08173487273c49e404d831701856d2cb04f67569df95151f53e05bf","abstract_canon_sha256":"1def62d8c871ee6c6af8ccbe700ab3b3236bec10f56580eb87bab7a443740ae7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:49.490837Z","signature_b64":"f9MWWFOl+DtjC4hqg1Ux95jsRfidGvYfhny3PnyJVWvtrqW6QnThj9H4mBR+X0IIIS/IKN+Vut2Tqcojo5gYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9b6904879a5c8f817a84f2cea2b16e6b28a8f62a8d691b0e53ab46c2d184137","last_reissued_at":"2026-05-18T01:33:49.490253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:49.490253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Cui-Kano's Characterization Problem on Graph Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David G. L. Wang, H. L. Lu","submitted_at":"2011-09-22T16:08:21Z","abstract_excerpt":"An $H_n$-factor of a graph $G$ is defined to be a spanning subgraph $F$ of $G$ such that each vertex has degree belonging to the set $\\{1,3,5,...,2n-1,2n\\}$ in $F$. In this paper, we investigate $H_n$-factors of graphs by using Lov\\'asz's structural descriptions to the degree prescribed subgraph problem. We find some sufficient conditions for the existence of an $H_n$-factor of a graph. In particular, we make progress on the characterization problem for a special family of graphs proposed by Cui and Kano in 1988."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4863","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":"1109.4863","created_at":"2026-05-18T01:33:49.490345+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4863v1","created_at":"2026-05-18T01:33:49.490345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4863","created_at":"2026-05-18T01:33:49.490345+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZG3JASDZUXEP","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZG3JASDZUXEPQF5I","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZG3JASDZ","created_at":"2026-05-18T12:26:47.523578+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/ZG3JASDZUXEPQF5IJ4WOUKYW42","json":"https://pith.science/pith/ZG3JASDZUXEPQF5IJ4WOUKYW42.json","graph_json":"https://pith.science/api/pith-number/ZG3JASDZUXEPQF5IJ4WOUKYW42/graph.json","events_json":"https://pith.science/api/pith-number/ZG3JASDZUXEPQF5IJ4WOUKYW42/events.json","paper":"https://pith.science/paper/ZG3JASDZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZG3JASDZUXEPQF5IJ4WOUKYW42","download_json":"https://pith.science/pith/ZG3JASDZUXEPQF5IJ4WOUKYW42.json","view_paper":"https://pith.science/paper/ZG3JASDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4863&json=true","fetch_graph":"https://pith.science/api/pith-number/ZG3JASDZUXEPQF5IJ4WOUKYW42/graph.json","fetch_events":"https://pith.science/api/pith-number/ZG3JASDZUXEPQF5IJ4WOUKYW42/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZG3JASDZUXEPQF5IJ4WOUKYW42/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZG3JASDZUXEPQF5IJ4WOUKYW42/action/storage_attestation","attest_author":"https://pith.science/pith/ZG3JASDZUXEPQF5IJ4WOUKYW42/action/author_attestation","sign_citation":"https://pith.science/pith/ZG3JASDZUXEPQF5IJ4WOUKYW42/action/citation_signature","submit_replication":"https://pith.science/pith/ZG3JASDZUXEPQF5IJ4WOUKYW42/action/replication_record"}},"created_at":"2026-05-18T01:33:49.490345+00:00","updated_at":"2026-05-18T01:33:49.490345+00:00"}