{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WEHMWFHFK27D27IXSVVALOX2UL","short_pith_number":"pith:WEHMWFHF","schema_version":"1.0","canonical_sha256":"b10ecb14e556be3d7d17956a05bafaa2cfa947090e7174f74998122753e94617","source":{"kind":"arxiv","id":"1112.0748","version":1},"attestation_state":"computed","paper":{"title":"A Note on $\\{k,n-k\\}$-Factors of 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","submitted_at":"2011-12-04T12:15:44Z","abstract_excerpt":"Let $r$ be an odd integer, and $k$ an even integer. In this note, we present $r$-regular graphs which have no $\\{k,r-k\\}$-factors for all $1\\le k\\le {r\\over2}-1$. This gives a negative answer to a problem posed by Akbari and Kano recently."},"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":"1112.0748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-04T12:15:44Z","cross_cats_sorted":[],"title_canon_sha256":"0de649c9c2bf7795ed4826af3b0848d9dcba19fe511b009352cae28d8ce6fbce","abstract_canon_sha256":"e78dce29ee3cb9a526ed298a4c301f84bd199c476c10fcd7e97c4204c5ccc112"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:05.733810Z","signature_b64":"Ku/twz4bXDM/BI5W7DGvllveugh2zE0NmP2Lnxw5ufEqCfiBJ12mkH6cMPFJ8SxoiucCvgX2zmME5f2dIbFmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b10ecb14e556be3d7d17956a05bafaa2cfa947090e7174f74998122753e94617","last_reissued_at":"2026-05-18T04:07:05.733217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:05.733217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on $\\{k,n-k\\}$-Factors of 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","submitted_at":"2011-12-04T12:15:44Z","abstract_excerpt":"Let $r$ be an odd integer, and $k$ an even integer. In this note, we present $r$-regular graphs which have no $\\{k,r-k\\}$-factors for all $1\\le k\\le {r\\over2}-1$. This gives a negative answer to a problem posed by Akbari and Kano recently."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0748","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":"1112.0748","created_at":"2026-05-18T04:07:05.733305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0748v1","created_at":"2026-05-18T04:07:05.733305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0748","created_at":"2026-05-18T04:07:05.733305+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEHMWFHFK27D","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEHMWFHFK27D27IX","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEHMWFHF","created_at":"2026-05-18T12:26:44.992195+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/WEHMWFHFK27D27IXSVVALOX2UL","json":"https://pith.science/pith/WEHMWFHFK27D27IXSVVALOX2UL.json","graph_json":"https://pith.science/api/pith-number/WEHMWFHFK27D27IXSVVALOX2UL/graph.json","events_json":"https://pith.science/api/pith-number/WEHMWFHFK27D27IXSVVALOX2UL/events.json","paper":"https://pith.science/paper/WEHMWFHF"},"agent_actions":{"view_html":"https://pith.science/pith/WEHMWFHFK27D27IXSVVALOX2UL","download_json":"https://pith.science/pith/WEHMWFHFK27D27IXSVVALOX2UL.json","view_paper":"https://pith.science/paper/WEHMWFHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0748&json=true","fetch_graph":"https://pith.science/api/pith-number/WEHMWFHFK27D27IXSVVALOX2UL/graph.json","fetch_events":"https://pith.science/api/pith-number/WEHMWFHFK27D27IXSVVALOX2UL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEHMWFHFK27D27IXSVVALOX2UL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEHMWFHFK27D27IXSVVALOX2UL/action/storage_attestation","attest_author":"https://pith.science/pith/WEHMWFHFK27D27IXSVVALOX2UL/action/author_attestation","sign_citation":"https://pith.science/pith/WEHMWFHFK27D27IXSVVALOX2UL/action/citation_signature","submit_replication":"https://pith.science/pith/WEHMWFHFK27D27IXSVVALOX2UL/action/replication_record"}},"created_at":"2026-05-18T04:07:05.733305+00:00","updated_at":"2026-05-18T04:07:05.733305+00:00"}