{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ABMAYLN2BXREBNJRFQ2OE73K5T","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":"6e7f77696696265f593dbacd330cbfe09af9cecd2429a3d91bfe896bca90b1f3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-05-25T15:14:01Z","title_canon_sha256":"3c8a4cf6e5acf3550e3505da692471eeecd89404028625e3c85f554435818745"},"schema_version":"1.0","source":{"id":"2405.16270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.16270","created_at":"2026-07-05T08:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"2405.16270v1","created_at":"2026-07-05T08:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16270","created_at":"2026-07-05T08:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"ABMAYLN2BXRE","created_at":"2026-07-05T08:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"ABMAYLN2BXREBNJR","created_at":"2026-07-05T08:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"ABMAYLN2","created_at":"2026-07-05T08:23:27Z"}],"graph_snapshots":[{"event_id":"sha256:5b891c4119a7f27a2bf473656b0417695e2328b27ab94f9eedab1ac514f0d8df","target":"graph","created_at":"2026-07-05T08:23:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.16270/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the following generalization of the Hamiltonian cycle problem: Given integers $a,b$ and graph $G$, does there exist a closed walk in $G$ that visits every vertex at least $a$ times and at most $b$ times? Equivalently, does there exist a connected $[2a,2b]$ factor of $2b \\cdot G$ with all degrees even? This problem is NP-hard for any constants $1 \\leq a \\leq b$. However, the graphs produced by known reductions have maximum degree growing linearly in $b$. The case $a = b = 1 $ -- i.e. Hamiltonicity -- remains NP-hard even in $3$-regular graphs; a natural question is whether this is true","authors_text":"Alek Westover, Brian Liu, Nathan S. Sheffield","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-05-25T15:14:01Z","title":"Complexity of Multiple-Hamiltonicity in Graphs of Bounded Degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16270","kind":"arxiv","version":1},"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:76552378b1f3646213d141bc2d51fd8d3f7364df04fc0fc1b80a6f263969d0dd","target":"record","created_at":"2026-07-05T08:23:27Z","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":"6e7f77696696265f593dbacd330cbfe09af9cecd2429a3d91bfe896bca90b1f3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-05-25T15:14:01Z","title_canon_sha256":"3c8a4cf6e5acf3550e3505da692471eeecd89404028625e3c85f554435818745"},"schema_version":"1.0","source":{"id":"2405.16270","kind":"arxiv","version":1}},"canonical_sha256":"00580c2dba0de240b5312c34e27f6aecc848be7614a3cfc808b9d8d01271affa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00580c2dba0de240b5312c34e27f6aecc848be7614a3cfc808b9d8d01271affa","first_computed_at":"2026-07-05T08:23:27.985295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:23:27.985295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H8FNlyBHDvPZpFYBoKlBeXehhPXToLgZJy0wIhMhtOaHdUqDBX/MieuEghluXGb3gnZn6tycoUDN4Db0BjTRCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:23:27.985702Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.16270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76552378b1f3646213d141bc2d51fd8d3f7364df04fc0fc1b80a6f263969d0dd","sha256:5b891c4119a7f27a2bf473656b0417695e2328b27ab94f9eedab1ac514f0d8df"],"state_sha256":"5f70aebe5a4c2ba30af76026b6fcea7ea15962cab13f04f256f73c218db59576"}