{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ABMAYLN2BXREBNJRFQ2OE73K5T","short_pith_number":"pith:ABMAYLN2","schema_version":"1.0","canonical_sha256":"00580c2dba0de240b5312c34e27f6aecc848be7614a3cfc808b9d8d01271affa","source":{"kind":"arxiv","id":"2405.16270","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Multiple-Hamiltonicity in Graphs of Bounded Degree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alek Westover, Brian Liu, Nathan S. Sheffield","submitted_at":"2024-05-25T15:14:01Z","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"},"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":"2405.16270","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-05-25T15:14:01Z","cross_cats_sorted":[],"title_canon_sha256":"3c8a4cf6e5acf3550e3505da692471eeecd89404028625e3c85f554435818745","abstract_canon_sha256":"6e7f77696696265f593dbacd330cbfe09af9cecd2429a3d91bfe896bca90b1f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:27.985702Z","signature_b64":"H8FNlyBHDvPZpFYBoKlBeXehhPXToLgZJy0wIhMhtOaHdUqDBX/MieuEghluXGb3gnZn6tycoUDN4Db0BjTRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00580c2dba0de240b5312c34e27f6aecc848be7614a3cfc808b9d8d01271affa","last_reissued_at":"2026-07-05T08:23:27.985295Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:27.985295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Multiple-Hamiltonicity in Graphs of Bounded Degree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alek Westover, Brian Liu, Nathan S. Sheffield","submitted_at":"2024-05-25T15:14:01Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16270","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.16270/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.16270","created_at":"2026-07-05T08:23:27.985359+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16270v1","created_at":"2026-07-05T08:23:27.985359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16270","created_at":"2026-07-05T08:23:27.985359+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABMAYLN2BXRE","created_at":"2026-07-05T08:23:27.985359+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABMAYLN2BXREBNJR","created_at":"2026-07-05T08:23:27.985359+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABMAYLN2","created_at":"2026-07-05T08:23:27.985359+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.10506","citing_title":"A Progressive Training Strategy for Vision-Language Models to Counteract Spatio-Temporal Hallucinations in Embodied Reasoning","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ABMAYLN2BXREBNJRFQ2OE73K5T","json":"https://pith.science/pith/ABMAYLN2BXREBNJRFQ2OE73K5T.json","graph_json":"https://pith.science/api/pith-number/ABMAYLN2BXREBNJRFQ2OE73K5T/graph.json","events_json":"https://pith.science/api/pith-number/ABMAYLN2BXREBNJRFQ2OE73K5T/events.json","paper":"https://pith.science/paper/ABMAYLN2"},"agent_actions":{"view_html":"https://pith.science/pith/ABMAYLN2BXREBNJRFQ2OE73K5T","download_json":"https://pith.science/pith/ABMAYLN2BXREBNJRFQ2OE73K5T.json","view_paper":"https://pith.science/paper/ABMAYLN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16270&json=true","fetch_graph":"https://pith.science/api/pith-number/ABMAYLN2BXREBNJRFQ2OE73K5T/graph.json","fetch_events":"https://pith.science/api/pith-number/ABMAYLN2BXREBNJRFQ2OE73K5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABMAYLN2BXREBNJRFQ2OE73K5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABMAYLN2BXREBNJRFQ2OE73K5T/action/storage_attestation","attest_author":"https://pith.science/pith/ABMAYLN2BXREBNJRFQ2OE73K5T/action/author_attestation","sign_citation":"https://pith.science/pith/ABMAYLN2BXREBNJRFQ2OE73K5T/action/citation_signature","submit_replication":"https://pith.science/pith/ABMAYLN2BXREBNJRFQ2OE73K5T/action/replication_record"}},"created_at":"2026-07-05T08:23:27.985359+00:00","updated_at":"2026-07-05T08:23:27.985359+00:00"}