{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6BHXCYXU3SD77OVZRDBP5IW3GP","short_pith_number":"pith:6BHXCYXU","schema_version":"1.0","canonical_sha256":"f04f7162f4dc87ffbab988c2fea2db33e70f4a9c2da402c2fdfb94728834c35e","source":{"kind":"arxiv","id":"1505.08121","version":1},"attestation_state":"computed","paper":{"title":"The Hamilton-Waterloo Problem with $C_4$ and $C_m$ Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sibel \\\"Ozkan, U\\u{g}ur Odaba\\c{s}{\\i}","submitted_at":"2015-05-29T17:43:15Z","abstract_excerpt":"The Hamilton-Waterloo problem with uniform cycle sizes asks for a $2-$ factorization of the complete graph $K_v$ (for odd {\\em v}) or $K_v$ minus a $1-$factor (for even {\\em v}) where $r$ of the factors consist of $n-$cycles and $s$ of the factors consist of $m-$cycles with $r+s=\\left \\lfloor \\frac{v-1}{2} \\right \\rfloor$. In this paper, the Hamilton-Waterloo Problem with $4-$cycle and $m-$cycle factors for odd $m\\geq 3$ is studied and all possible solutions with a few possible exceptions are determined."},"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":"1505.08121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T17:43:15Z","cross_cats_sorted":[],"title_canon_sha256":"085530666481dc520c2b853124ffad703053c0a2918e6ee7ca0675d014289578","abstract_canon_sha256":"d47ed0684b2b277eada7791a1786ff2f623a9e06ae9e9e323e2aa928e2e3693f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:59.625890Z","signature_b64":"duJ9E4CyLEJ3WLjc5qM9jxMXeuyPtbaSLNV31Soz1x3IWGMtxbM3Zlfldirh3kFU9Akn8jNqT+IIi4vCJvd6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f04f7162f4dc87ffbab988c2fea2db33e70f4a9c2da402c2fdfb94728834c35e","last_reissued_at":"2026-05-18T01:59:59.625307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:59.625307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hamilton-Waterloo Problem with $C_4$ and $C_m$ Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sibel \\\"Ozkan, U\\u{g}ur Odaba\\c{s}{\\i}","submitted_at":"2015-05-29T17:43:15Z","abstract_excerpt":"The Hamilton-Waterloo problem with uniform cycle sizes asks for a $2-$ factorization of the complete graph $K_v$ (for odd {\\em v}) or $K_v$ minus a $1-$factor (for even {\\em v}) where $r$ of the factors consist of $n-$cycles and $s$ of the factors consist of $m-$cycles with $r+s=\\left \\lfloor \\frac{v-1}{2} \\right \\rfloor$. In this paper, the Hamilton-Waterloo Problem with $4-$cycle and $m-$cycle factors for odd $m\\geq 3$ is studied and all possible solutions with a few possible exceptions are determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08121","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":"1505.08121","created_at":"2026-05-18T01:59:59.625389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.08121v1","created_at":"2026-05-18T01:59:59.625389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08121","created_at":"2026-05-18T01:59:59.625389+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BHXCYXU3SD7","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BHXCYXU3SD77OVZ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BHXCYXU","created_at":"2026-05-18T12:29:07.941421+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/6BHXCYXU3SD77OVZRDBP5IW3GP","json":"https://pith.science/pith/6BHXCYXU3SD77OVZRDBP5IW3GP.json","graph_json":"https://pith.science/api/pith-number/6BHXCYXU3SD77OVZRDBP5IW3GP/graph.json","events_json":"https://pith.science/api/pith-number/6BHXCYXU3SD77OVZRDBP5IW3GP/events.json","paper":"https://pith.science/paper/6BHXCYXU"},"agent_actions":{"view_html":"https://pith.science/pith/6BHXCYXU3SD77OVZRDBP5IW3GP","download_json":"https://pith.science/pith/6BHXCYXU3SD77OVZRDBP5IW3GP.json","view_paper":"https://pith.science/paper/6BHXCYXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.08121&json=true","fetch_graph":"https://pith.science/api/pith-number/6BHXCYXU3SD77OVZRDBP5IW3GP/graph.json","fetch_events":"https://pith.science/api/pith-number/6BHXCYXU3SD77OVZRDBP5IW3GP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BHXCYXU3SD77OVZRDBP5IW3GP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BHXCYXU3SD77OVZRDBP5IW3GP/action/storage_attestation","attest_author":"https://pith.science/pith/6BHXCYXU3SD77OVZRDBP5IW3GP/action/author_attestation","sign_citation":"https://pith.science/pith/6BHXCYXU3SD77OVZRDBP5IW3GP/action/citation_signature","submit_replication":"https://pith.science/pith/6BHXCYXU3SD77OVZRDBP5IW3GP/action/replication_record"}},"created_at":"2026-05-18T01:59:59.625389+00:00","updated_at":"2026-05-18T01:59:59.625389+00:00"}