{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NXOG3IYSTR3VSVGHU3D65OMCXU","short_pith_number":"pith:NXOG3IYS","schema_version":"1.0","canonical_sha256":"6ddc6da3129c775954c7a6c7eeb982bd011b4c3d3f9bc755e346e604b1f2cf9e","source":{"kind":"arxiv","id":"1609.00453","version":1},"attestation_state":"computed","paper":{"title":"The Hamilton-Waterloo Problem for $C_3$-factors and $C_n$-factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fen Chen, Haitao Cao, Li Wang","submitted_at":"2016-09-02T02:52:53Z","abstract_excerpt":"The Hamilton-Waterloo problem asks for a 2-factorization of $K_v$ (for $v$ odd) or $K_v$ minus a $1$-factor (for $v$ even) into $C_m$-factors and $C_n$-factors. We completely solve the Hamilton-Waterloo problem in the case of $C_3$-factors and $C_n$-factors for $n=4,5,7$."},"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":"1609.00453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T02:52:53Z","cross_cats_sorted":[],"title_canon_sha256":"263a1aba7f8d22df650096636ec06231b1f5d14368e0deb94af8a9287efc8575","abstract_canon_sha256":"f4be2fdc2e003799b4089b0ad3acc0b9021c172535a9b73e7878c52cbe905671"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:32.481204Z","signature_b64":"PNoD4ZhGf+mlgn8L4fxRYtM9cGOAM0VzeDCx2XxJ5qDtn6ZQsdPWVNzPKJvG5mxsa45KcDTpp8Xq6EuwsqBuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ddc6da3129c775954c7a6c7eeb982bd011b4c3d3f9bc755e346e604b1f2cf9e","last_reissued_at":"2026-05-18T00:33:32.480555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:32.480555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hamilton-Waterloo Problem for $C_3$-factors and $C_n$-factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fen Chen, Haitao Cao, Li Wang","submitted_at":"2016-09-02T02:52:53Z","abstract_excerpt":"The Hamilton-Waterloo problem asks for a 2-factorization of $K_v$ (for $v$ odd) or $K_v$ minus a $1$-factor (for $v$ even) into $C_m$-factors and $C_n$-factors. We completely solve the Hamilton-Waterloo problem in the case of $C_3$-factors and $C_n$-factors for $n=4,5,7$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00453","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":"1609.00453","created_at":"2026-05-18T00:33:32.480654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00453v1","created_at":"2026-05-18T00:33:32.480654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00453","created_at":"2026-05-18T00:33:32.480654+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXOG3IYSTR3V","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXOG3IYSTR3VSVGH","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXOG3IYS","created_at":"2026-05-18T12:30:36.002864+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/NXOG3IYSTR3VSVGHU3D65OMCXU","json":"https://pith.science/pith/NXOG3IYSTR3VSVGHU3D65OMCXU.json","graph_json":"https://pith.science/api/pith-number/NXOG3IYSTR3VSVGHU3D65OMCXU/graph.json","events_json":"https://pith.science/api/pith-number/NXOG3IYSTR3VSVGHU3D65OMCXU/events.json","paper":"https://pith.science/paper/NXOG3IYS"},"agent_actions":{"view_html":"https://pith.science/pith/NXOG3IYSTR3VSVGHU3D65OMCXU","download_json":"https://pith.science/pith/NXOG3IYSTR3VSVGHU3D65OMCXU.json","view_paper":"https://pith.science/paper/NXOG3IYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00453&json=true","fetch_graph":"https://pith.science/api/pith-number/NXOG3IYSTR3VSVGHU3D65OMCXU/graph.json","fetch_events":"https://pith.science/api/pith-number/NXOG3IYSTR3VSVGHU3D65OMCXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXOG3IYSTR3VSVGHU3D65OMCXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXOG3IYSTR3VSVGHU3D65OMCXU/action/storage_attestation","attest_author":"https://pith.science/pith/NXOG3IYSTR3VSVGHU3D65OMCXU/action/author_attestation","sign_citation":"https://pith.science/pith/NXOG3IYSTR3VSVGHU3D65OMCXU/action/citation_signature","submit_replication":"https://pith.science/pith/NXOG3IYSTR3VSVGHU3D65OMCXU/action/replication_record"}},"created_at":"2026-05-18T00:33:32.480654+00:00","updated_at":"2026-05-18T00:33:32.480654+00:00"}