{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MBK7OUB6GIZKHNYYEICPI654VW","short_pith_number":"pith:MBK7OUB6","schema_version":"1.0","canonical_sha256":"6055f7503e3232a3b7182204f47bbcadb89ff59be8b14e13dddc26465398fe76","source":{"kind":"arxiv","id":"1710.00647","version":3},"attestation_state":"computed","paper":{"title":"Almost resolvable $k$-cycle systems with $k\\equiv 2\\pmod 4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"H. Cao, L. Wang","submitted_at":"2017-09-25T00:36:19Z","abstract_excerpt":"In this paper, we show that if $k\\geq 6$ and $k \\equiv 2 \\pmod 4$, then there exists an almost resolvable $k$-cycle system of order $2kt+1$ for all $t\\ge 1$ except possibly for $t=2$ and $k\\geq 14$. Thus we give a partial solution to an open problem posed by Lindner, Meszka, and Rosa (J. Combin. Des., vol. 17, pp.404-410, 2009)."},"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":"1710.00647","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-25T00:36:19Z","cross_cats_sorted":[],"title_canon_sha256":"6621a7932fc1e754c794b7d421d8e9a4a3df20f1b00da5c5c8231726f57df625","abstract_canon_sha256":"c396af8442eb22314c9896b961935e88d517d7638b3a2b6a20d52d3be8725191"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:24.126893Z","signature_b64":"NgvIhP/TTkUNaiJUi9KVGMlhmRIePSzPaWTdCvQbaxsLMJcw28nrYs2/51zfLBpGDBnm/gXYLLADt16k2mzaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6055f7503e3232a3b7182204f47bbcadb89ff59be8b14e13dddc26465398fe76","last_reissued_at":"2026-05-18T00:17:24.126194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:24.126194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost resolvable $k$-cycle systems with $k\\equiv 2\\pmod 4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"H. Cao, L. Wang","submitted_at":"2017-09-25T00:36:19Z","abstract_excerpt":"In this paper, we show that if $k\\geq 6$ and $k \\equiv 2 \\pmod 4$, then there exists an almost resolvable $k$-cycle system of order $2kt+1$ for all $t\\ge 1$ except possibly for $t=2$ and $k\\geq 14$. Thus we give a partial solution to an open problem posed by Lindner, Meszka, and Rosa (J. Combin. Des., vol. 17, pp.404-410, 2009)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00647","kind":"arxiv","version":3},"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":"1710.00647","created_at":"2026-05-18T00:17:24.126333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00647v3","created_at":"2026-05-18T00:17:24.126333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00647","created_at":"2026-05-18T00:17:24.126333+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBK7OUB6GIZK","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBK7OUB6GIZKHNYY","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBK7OUB6","created_at":"2026-05-18T12:31:31.346846+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/MBK7OUB6GIZKHNYYEICPI654VW","json":"https://pith.science/pith/MBK7OUB6GIZKHNYYEICPI654VW.json","graph_json":"https://pith.science/api/pith-number/MBK7OUB6GIZKHNYYEICPI654VW/graph.json","events_json":"https://pith.science/api/pith-number/MBK7OUB6GIZKHNYYEICPI654VW/events.json","paper":"https://pith.science/paper/MBK7OUB6"},"agent_actions":{"view_html":"https://pith.science/pith/MBK7OUB6GIZKHNYYEICPI654VW","download_json":"https://pith.science/pith/MBK7OUB6GIZKHNYYEICPI654VW.json","view_paper":"https://pith.science/paper/MBK7OUB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00647&json=true","fetch_graph":"https://pith.science/api/pith-number/MBK7OUB6GIZKHNYYEICPI654VW/graph.json","fetch_events":"https://pith.science/api/pith-number/MBK7OUB6GIZKHNYYEICPI654VW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBK7OUB6GIZKHNYYEICPI654VW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBK7OUB6GIZKHNYYEICPI654VW/action/storage_attestation","attest_author":"https://pith.science/pith/MBK7OUB6GIZKHNYYEICPI654VW/action/author_attestation","sign_citation":"https://pith.science/pith/MBK7OUB6GIZKHNYYEICPI654VW/action/citation_signature","submit_replication":"https://pith.science/pith/MBK7OUB6GIZKHNYYEICPI654VW/action/replication_record"}},"created_at":"2026-05-18T00:17:24.126333+00:00","updated_at":"2026-05-18T00:17:24.126333+00:00"}