{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MY4V5WNAB4PNGDRS4JRYKRUI3V","short_pith_number":"pith:MY4V5WNA","schema_version":"1.0","canonical_sha256":"66395ed9a00f1ed30e32e263854688dd418b9e5f81d2954bb5dbfeb1a15955c8","source":{"kind":"arxiv","id":"2605.16956","version":1},"attestation_state":"computed","paper":{"title":"The Weighted Tower of Hanoi: Algebraic Structure, Phase Transitions, and Integer Sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The weighted Tower of Hanoi admits explicit closed forms for minimal transfer costs from matrix formulations of one-LDM and two-LDM strategies.","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andreas M. Hinza, El-Mehdi Mehiri","submitted_at":"2026-05-16T12:16:44Z","abstract_excerpt":"We develop a unified algebraic theory of the weighted Tower of Hanoi with arbitrary nonnegative symmetric move costs depending on both disc index and pegs. Starting from a general optimality recurrence with two competing strategies -- one largest-disc move (one-LDM) and two largest-disc moves (two-LDM) -- we derive complete matrix formulations for both regimes and obtain explicit closed forms for the minimal transfer cost.\n  The one-LDM dynamics is governed by a nontrivial linear operator whose spectral decomposition reveals a fundamental connection with the Jacobsthal and Lichtenberg sequence"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.16956","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T12:16:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"281a73f3630040c8d8d37e71bf33f2b6762fc57e0a5cd7e4d1cc5aaa9520c72e","abstract_canon_sha256":"db1df0b4a888e967d2177ea51a279ac6d27536041dea678ebe6c83af2dd7ab89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:32.809075Z","signature_b64":"kqRoluQ9FnpxEfAD/M/xeT8UOUmrVgV7a4kIBo4xgSpEnZQQR/BuN/mDzFwORde7pHfGobHQidGDi0rgGbONBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66395ed9a00f1ed30e32e263854688dd418b9e5f81d2954bb5dbfeb1a15955c8","last_reissued_at":"2026-05-20T00:03:32.808286Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:32.808286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Weighted Tower of Hanoi: Algebraic Structure, Phase Transitions, and Integer Sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The weighted Tower of Hanoi admits explicit closed forms for minimal transfer costs from matrix formulations of one-LDM and two-LDM strategies.","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andreas M. Hinza, El-Mehdi Mehiri","submitted_at":"2026-05-16T12:16:44Z","abstract_excerpt":"We develop a unified algebraic theory of the weighted Tower of Hanoi with arbitrary nonnegative symmetric move costs depending on both disc index and pegs. Starting from a general optimality recurrence with two competing strategies -- one largest-disc move (one-LDM) and two largest-disc moves (two-LDM) -- we derive complete matrix formulations for both regimes and obtain explicit closed forms for the minimal transfer cost.\n  The one-LDM dynamics is governed by a nontrivial linear operator whose spectral decomposition reveals a fundamental connection with the Jacobsthal and Lichtenberg sequence"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Starting from a general optimality recurrence with one-LDM and two-LDM strategies, the authors derive complete matrix formulations and obtain explicit closed forms for the minimal transfer cost, with the one-LDM dynamics governed by a linear operator whose spectral decomposition connects to the Jacobsthal and Lichtenberg sequences.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that the optimal solution is always achieved by one of the two competing strategies (one largest-disc move or two largest-disc moves) in the recurrence relation, without other hybrid or more complex move sequences becoming cheaper for arbitrary nonnegative symmetric weights.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The authors give matrix-based closed forms for minimal costs in weighted Tower of Hanoi problems, connect them to Jacobsthal and other integer sequences, and identify a phase transition in optimal move strategies when some moves are forbidden.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The weighted Tower of Hanoi admits explicit closed forms for minimal transfer costs from matrix formulations of one-LDM and two-LDM strategies.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"891e55a8165fe69f6c19c419e938135b84ac6d7471f5e40333cf83774440ee29"},"source":{"id":"2605.16956","kind":"arxiv","version":1},"verdict":{"id":"9ad81682-bfe5-45f6-be80-0dc5c3fee85c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:21:44.685533Z","strongest_claim":"Starting from a general optimality recurrence with one-LDM and two-LDM strategies, the authors derive complete matrix formulations and obtain explicit closed forms for the minimal transfer cost, with the one-LDM dynamics governed by a linear operator whose spectral decomposition connects to the Jacobsthal and Lichtenberg sequences.","one_line_summary":"The authors give matrix-based closed forms for minimal costs in weighted Tower of Hanoi problems, connect them to Jacobsthal and other integer sequences, and identify a phase transition in optimal move strategies when some moves are forbidden.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that the optimal solution is always achieved by one of the two competing strategies (one largest-disc move or two largest-disc moves) in the recurrence relation, without other hybrid or more complex move sequences becoming cheaper for arbitrary nonnegative symmetric weights.","pith_extraction_headline":"The weighted Tower of Hanoi admits explicit closed forms for minimal transfer costs from matrix formulations of one-LDM and two-LDM strategies."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16956/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T20:31:38.986450Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:19.070347Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T19:51:58.659732Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.234298Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.318810Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"0591484e1e2a3c8e8e36ab0e81aea93c80a0089fad2c7ef2dcf52b0a822fbc18"},"references":{"count":11,"sample":[{"doi":"10.37236/4252","year":2014,"title":"Aumann, S., G¨ otz, K. A. M., Hinz, A. M., & Petr, C. (2014). The number of moves of the largest disc in shortest paths on Hanoi graphs.The Electronic Journal of Combinatorics, 21(4), Article P4.38.ht","work_id":"05cec43a-f5ea-42dd-82b1-22d717160342","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1080/00029890.2025.2491975","year":2025,"title":"Wildberger and Dean Rubine","work_id":"30a95a4e-128f-46f9-bf2d-9b25d2fdbd92","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/0020-0255(92)90067-i","year":1992,"title":"Hinz, A. M. (1992). Shortest paths between regular states of the Tower of Hanoi.Information Sciences, 63(1–2), 173–181.https://doi.org/10.1016/0020-0255(92)90067-I 18","work_id":"26975ff3-3360-44f9-a878-ee994ab6f3aa","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1080/00150517.2017.12427786","year":2017,"title":"Hinz, A. M. (2017). The Lichtenberg sequence.The Fibonacci Quarterly, 55(1), 2–12.https: //doi.org/10.1080/00150517.2017.12427786","work_id":"b4370e52-b1f7-4be2-99b1-c7dd617fd313","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-319-73779-9","year":2018,"title":"M., Klavˇ zar, S., & Petr, C","work_id":"2eafb434-6e49-4928-8070-44b91553a7c1","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":11,"snapshot_sha256":"3a946151b349b9b72b8f32cc18fb47d85f4ad76d58062e2fc805e2a44547bbf3","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"49ad34c1b79289384c9dbb39aae9c58faed622be6d92c1a9f66cb88c6277fb25"},"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":"2605.16956","created_at":"2026-05-20T00:03:32.808431+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16956v1","created_at":"2026-05-20T00:03:32.808431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16956","created_at":"2026-05-20T00:03:32.808431+00:00"},{"alias_kind":"pith_short_12","alias_value":"MY4V5WNAB4PN","created_at":"2026-05-20T00:03:32.808431+00:00"},{"alias_kind":"pith_short_16","alias_value":"MY4V5WNAB4PNGDRS","created_at":"2026-05-20T00:03:32.808431+00:00"},{"alias_kind":"pith_short_8","alias_value":"MY4V5WNA","created_at":"2026-05-20T00:03:32.808431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MY4V5WNAB4PNGDRS4JRYKRUI3V","json":"https://pith.science/pith/MY4V5WNAB4PNGDRS4JRYKRUI3V.json","graph_json":"https://pith.science/api/pith-number/MY4V5WNAB4PNGDRS4JRYKRUI3V/graph.json","events_json":"https://pith.science/api/pith-number/MY4V5WNAB4PNGDRS4JRYKRUI3V/events.json","paper":"https://pith.science/paper/MY4V5WNA"},"agent_actions":{"view_html":"https://pith.science/pith/MY4V5WNAB4PNGDRS4JRYKRUI3V","download_json":"https://pith.science/pith/MY4V5WNAB4PNGDRS4JRYKRUI3V.json","view_paper":"https://pith.science/paper/MY4V5WNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16956&json=true","fetch_graph":"https://pith.science/api/pith-number/MY4V5WNAB4PNGDRS4JRYKRUI3V/graph.json","fetch_events":"https://pith.science/api/pith-number/MY4V5WNAB4PNGDRS4JRYKRUI3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MY4V5WNAB4PNGDRS4JRYKRUI3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MY4V5WNAB4PNGDRS4JRYKRUI3V/action/storage_attestation","attest_author":"https://pith.science/pith/MY4V5WNAB4PNGDRS4JRYKRUI3V/action/author_attestation","sign_citation":"https://pith.science/pith/MY4V5WNAB4PNGDRS4JRYKRUI3V/action/citation_signature","submit_replication":"https://pith.science/pith/MY4V5WNAB4PNGDRS4JRYKRUI3V/action/replication_record"}},"created_at":"2026-05-20T00:03:32.808431+00:00","updated_at":"2026-05-20T00:03:32.808431+00:00"}