{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:L5AYSP3UFIJMTUS6ZNNFYP3NGI","short_pith_number":"pith:L5AYSP3U","canonical_record":{"source":{"id":"1301.4657","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-20T13:35:02Z","cross_cats_sorted":[],"title_canon_sha256":"c1bd97c25c5b4d7dc2a49528641e8192598054de0eb967998869c06ad8231007","abstract_canon_sha256":"15f5931421aac95c35b43d7931b5c66799392295c87829ed575fc1debe9ece72"},"schema_version":"1.0"},"canonical_sha256":"5f41893f742a12c9d25ecb5a5c3f6d3210c3c58a59270ea10e6a08cf270a6ff5","source":{"kind":"arxiv","id":"1301.4657","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4657","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4657v2","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4657","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"pith_short_12","alias_value":"L5AYSP3UFIJM","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L5AYSP3UFIJMTUS6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L5AYSP3U","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:L5AYSP3UFIJMTUS6ZNNFYP3NGI","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4657","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-20T13:35:02Z","cross_cats_sorted":[],"title_canon_sha256":"c1bd97c25c5b4d7dc2a49528641e8192598054de0eb967998869c06ad8231007","abstract_canon_sha256":"15f5931421aac95c35b43d7931b5c66799392295c87829ed575fc1debe9ece72"},"schema_version":"1.0"},"canonical_sha256":"5f41893f742a12c9d25ecb5a5c3f6d3210c3c58a59270ea10e6a08cf270a6ff5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:25.030576Z","signature_b64":"CoQbMqJ+xdrKm5RPUBC0GnMiv4YgQqBbUgtGSiw81AbHO+ux9PiL2BIqwypWlV1cHrSU6ZyYH/CkgzSAIudUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f41893f742a12c9d25ecb5a5c3f6d3210c3c58a59270ea10e6a08cf270a6ff5","last_reissued_at":"2026-05-18T03:35:25.029904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:25.029904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4657","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-18T03:35:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/PTKwft0LRXmv2NwxxHxSIWHbg4cqR6fY27fh133o4oSCNQSGkpst3eaPqY+s8aDmvVGGquW5Ka7aB44OK3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T21:53:51.419730Z"},"content_sha256":"b50451deadd16336d5651b302cb4d09e4cf58f150c5da1c1e1f59e0d978248e0","schema_version":"1.0","event_id":"sha256:b50451deadd16336d5651b302cb4d09e4cf58f150c5da1c1e1f59e0d978248e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:L5AYSP3UFIJMTUS6ZNNFYP3NGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Extension of 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":"Hongliang Lu","submitted_at":"2013-01-20T13:35:02Z","abstract_excerpt":"Let $G$ be a graph with vertex set $V(G)$ and let $H:V(G)\\rightarrow 2^N$ be a set function associating with $G$. An $H$-factor of graph $G$ is a spanning subgraphs $F$ such that $$d_F(v)\\in H(v){4em}\\hbox{for every}v\\in V(G).$$ Let $f:V(G)\\rightarrow N$ be an even integer-valued function such that $f\\geq 4$ and let $H_f(v)=\\{1,3,...,f(v)-1, f(v)\\}$ for $v\\in V(G)$. In this paper, we investigate $H_f$-factors of graphs $G$ by using Lov\\'asz's structural descriptions. Let $o(G)$ denote the number of odd components of $G$.\n  We show that if one of the following conditions holds, then $G$ contain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4657","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-18T03:35:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAGxVmqN3obYeOpZb+G7fNbxQwf0JUKv6gLXTs5lrxLVTMA0TPEPEP0NP6VsKl6MfUM03qOHBZXuZNvoazB3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T21:53:51.420069Z"},"content_sha256":"069b142c64f497a0cbb2ebbcc95e603b71c0bc1c2f5e1040a8136008ba21d69a","schema_version":"1.0","event_id":"sha256:069b142c64f497a0cbb2ebbcc95e603b71c0bc1c2f5e1040a8136008ba21d69a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5AYSP3UFIJMTUS6ZNNFYP3NGI/bundle.json","state_url":"https://pith.science/pith/L5AYSP3UFIJMTUS6ZNNFYP3NGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5AYSP3UFIJMTUS6ZNNFYP3NGI/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-19T21:53:51Z","links":{"resolver":"https://pith.science/pith/L5AYSP3UFIJMTUS6ZNNFYP3NGI","bundle":"https://pith.science/pith/L5AYSP3UFIJMTUS6ZNNFYP3NGI/bundle.json","state":"https://pith.science/pith/L5AYSP3UFIJMTUS6ZNNFYP3NGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5AYSP3UFIJMTUS6ZNNFYP3NGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:L5AYSP3UFIJMTUS6ZNNFYP3NGI","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":"15f5931421aac95c35b43d7931b5c66799392295c87829ed575fc1debe9ece72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-20T13:35:02Z","title_canon_sha256":"c1bd97c25c5b4d7dc2a49528641e8192598054de0eb967998869c06ad8231007"},"schema_version":"1.0","source":{"id":"1301.4657","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4657","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4657v2","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4657","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"pith_short_12","alias_value":"L5AYSP3UFIJM","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L5AYSP3UFIJMTUS6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L5AYSP3U","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:069b142c64f497a0cbb2ebbcc95e603b71c0bc1c2f5e1040a8136008ba21d69a","target":"graph","created_at":"2026-05-18T03:35:25Z","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":"Let $G$ be a graph with vertex set $V(G)$ and let $H:V(G)\\rightarrow 2^N$ be a set function associating with $G$. An $H$-factor of graph $G$ is a spanning subgraphs $F$ such that $$d_F(v)\\in H(v){4em}\\hbox{for every}v\\in V(G).$$ Let $f:V(G)\\rightarrow N$ be an even integer-valued function such that $f\\geq 4$ and let $H_f(v)=\\{1,3,...,f(v)-1, f(v)\\}$ for $v\\in V(G)$. In this paper, we investigate $H_f$-factors of graphs $G$ by using Lov\\'asz's structural descriptions. Let $o(G)$ denote the number of odd components of $G$.\n  We show that if one of the following conditions holds, then $G$ contain","authors_text":"Hongliang Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-20T13:35:02Z","title":"An Extension of Cui-Kano's Characterization Problem on Graph Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4657","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:b50451deadd16336d5651b302cb4d09e4cf58f150c5da1c1e1f59e0d978248e0","target":"record","created_at":"2026-05-18T03:35:25Z","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":"15f5931421aac95c35b43d7931b5c66799392295c87829ed575fc1debe9ece72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-20T13:35:02Z","title_canon_sha256":"c1bd97c25c5b4d7dc2a49528641e8192598054de0eb967998869c06ad8231007"},"schema_version":"1.0","source":{"id":"1301.4657","kind":"arxiv","version":2}},"canonical_sha256":"5f41893f742a12c9d25ecb5a5c3f6d3210c3c58a59270ea10e6a08cf270a6ff5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f41893f742a12c9d25ecb5a5c3f6d3210c3c58a59270ea10e6a08cf270a6ff5","first_computed_at":"2026-05-18T03:35:25.029904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:25.029904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CoQbMqJ+xdrKm5RPUBC0GnMiv4YgQqBbUgtGSiw81AbHO+ux9PiL2BIqwypWlV1cHrSU6ZyYH/CkgzSAIudUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:25.030576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4657","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b50451deadd16336d5651b302cb4d09e4cf58f150c5da1c1e1f59e0d978248e0","sha256:069b142c64f497a0cbb2ebbcc95e603b71c0bc1c2f5e1040a8136008ba21d69a"],"state_sha256":"7ef67c2caae904ecb7b5e712d2877629142f14170364da4484308905647a6176"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAVJQBtChOWPqYO0bllbg8ywJ+yaYq0JsUXGSXxdxvRSMUMupI36XUNaaKRvLa3gJ5QMjFirkhW7PdPImmp7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T21:53:51.422299Z","bundle_sha256":"7bc221096b1154f3312a7a08c7908b04f4d03abe381a41d22be2b4792e53910e"}}