{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MY4V5WNAB4PNGDRS4JRYKRUI3V","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"db1df0b4a888e967d2177ea51a279ac6d27536041dea678ebe6c83af2dd7ab89","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T12:16:44Z","title_canon_sha256":"281a73f3630040c8d8d37e71bf33f2b6762fc57e0a5cd7e4d1cc5aaa9520c72e"},"schema_version":"1.0","source":{"id":"2605.16956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16956","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16956v1","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16956","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"MY4V5WNAB4PN","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"MY4V5WNAB4PNGDRS","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"MY4V5WNA","created_at":"2026-05-20T00:03:32Z"}],"graph_snapshots":[{"event_id":"sha256:9a68823331b81d63ba9dff414fb922baefc9d9402d0f468f84efb5bb8523a713","target":"graph","created_at":"2026-05-20T00:03:32Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The weighted Tower of Hanoi admits explicit closed forms for minimal transfer costs from matrix formulations of one-LDM and two-LDM strategies."}],"snapshot_sha256":"891e55a8165fe69f6c19c419e938135b84ac6d7471f5e40333cf83774440ee29"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"49ad34c1b79289384c9dbb39aae9c58faed622be6d92c1a9f66cb88c6277fb25"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.16956/integrity.json","findings":[],"snapshot_sha256":"0591484e1e2a3c8e8e36ab0e81aea93c80a0089fad2c7ef2dcf52b0a822fbc18","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andreas M. Hinza, El-Mehdi Mehiri","cross_cats":["cs.DM"],"headline":"The weighted Tower of Hanoi admits explicit closed forms for minimal transfer costs from matrix formulations of one-LDM and two-LDM strategies.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T12:16:44Z","title":"The Weighted Tower of Hanoi: Algebraic Structure, Phase Transitions, and Integer Sequences"},"references":{"count":11,"internal_anchors":0,"resolved_work":11,"sample":[{"cited_arxiv_id":"","doi":"10.37236/4252","is_internal_anchor":false,"ref_index":1,"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","year":2014},{"cited_arxiv_id":"","doi":"10.1080/00029890.2025.2491975","is_internal_anchor":false,"ref_index":2,"title":"Wildberger and Dean Rubine","work_id":"30a95a4e-128f-46f9-bf2d-9b25d2fdbd92","year":2025},{"cited_arxiv_id":"","doi":"10.1016/0020-0255(92)90067-i","is_internal_anchor":false,"ref_index":3,"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","year":1992},{"cited_arxiv_id":"","doi":"10.1080/00150517.2017.12427786","is_internal_anchor":false,"ref_index":4,"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","year":2017},{"cited_arxiv_id":"","doi":"10.1007/978-3-319-73779-9","is_internal_anchor":false,"ref_index":5,"title":"M., Klavˇ zar, S., & Petr, C","work_id":"2eafb434-6e49-4928-8070-44b91553a7c1","year":2018}],"snapshot_sha256":"3a946151b349b9b72b8f32cc18fb47d85f4ad76d58062e2fc805e2a44547bbf3"},"source":{"id":"2605.16956","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:21:44.685533Z","id":"9ad81682-bfe5-45f6-be80-0dc5c3fee85c","model_set":{"reader":"grok-4.3"},"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","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.","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.","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."}},"verdict_id":"9ad81682-bfe5-45f6-be80-0dc5c3fee85c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:394865b1fc05df6c27f70f7b2c27132e80e2e95a9d00335fe3ab960250d3bee7","target":"record","created_at":"2026-05-20T00:03:32Z","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":"db1df0b4a888e967d2177ea51a279ac6d27536041dea678ebe6c83af2dd7ab89","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T12:16:44Z","title_canon_sha256":"281a73f3630040c8d8d37e71bf33f2b6762fc57e0a5cd7e4d1cc5aaa9520c72e"},"schema_version":"1.0","source":{"id":"2605.16956","kind":"arxiv","version":1}},"canonical_sha256":"66395ed9a00f1ed30e32e263854688dd418b9e5f81d2954bb5dbfeb1a15955c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66395ed9a00f1ed30e32e263854688dd418b9e5f81d2954bb5dbfeb1a15955c8","first_computed_at":"2026-05-20T00:03:32.808286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:32.808286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kqRoluQ9FnpxEfAD/M/xeT8UOUmrVgV7a4kIBo4xgSpEnZQQR/BuN/mDzFwORde7pHfGobHQidGDi0rgGbONBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:32.809075Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:394865b1fc05df6c27f70f7b2c27132e80e2e95a9d00335fe3ab960250d3bee7","sha256:9a68823331b81d63ba9dff414fb922baefc9d9402d0f468f84efb5bb8523a713","sha256:1c78d7d2ea2e7422385a8bdd20803be6275dd56c55289c9ab0fc2ffe075087b6"],"state_sha256":"16664953be487d8f01fac72b5b42ed799ed6d5c6d605d6d70f0a907727b6d2ea"}