{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LUXJEFG4EGCHY5URZ2VF6TOTIE","short_pith_number":"pith:LUXJEFG4","schema_version":"1.0","canonical_sha256":"5d2e9214dc21847c7691ceaa5f4dd3412fd04022152fc500fed7ea5ebe3853ef","source":{"kind":"arxiv","id":"1102.4885","version":1},"attestation_state":"computed","paper":{"title":"The Tower of Hanoi problem on Path_h graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Amir Sapir, Daniel Berend, Shay Solomon","submitted_at":"2011-02-24T00:43:34Z","abstract_excerpt":"The generalized Tower of Hanoi problem with h \\ge 4 pegs is known to require a sub-exponentially fast growing number of moves in order to transfer a pile of n disks from one peg to another. In this paper we study the Path_h variant, where the pegs are placed along a line, and disks can be moved from a peg to its nearest neighbor(s) only.\n  Whereas in the simple variant there are h(h-1)/2 possible bi-directional interconnections among pegs, here there are only h-1 of them. Despite the significant reduction in the number of interconnections, the number of moves needed to transfer a pile of n dis"},"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":"1102.4885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-24T00:43:34Z","cross_cats_sorted":[],"title_canon_sha256":"4dc104c960802dd36e77b7b920b73f12a963911b41bf5792ac5a22a7993ef803","abstract_canon_sha256":"bdc1f5c236803214780bb39257877022494f72e73e30f8e569a882b677ea716f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:58.526214Z","signature_b64":"1D9nQX/uXPIrwlAbwWJV0xqvLcE++SdmVj5qup7rk6baOnTc96LF2z+cLbxstG/mtFJ7WDNyjWMH1Nm9us3wDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d2e9214dc21847c7691ceaa5f4dd3412fd04022152fc500fed7ea5ebe3853ef","last_reissued_at":"2026-05-18T04:27:58.525738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:58.525738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Tower of Hanoi problem on Path_h graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Amir Sapir, Daniel Berend, Shay Solomon","submitted_at":"2011-02-24T00:43:34Z","abstract_excerpt":"The generalized Tower of Hanoi problem with h \\ge 4 pegs is known to require a sub-exponentially fast growing number of moves in order to transfer a pile of n disks from one peg to another. In this paper we study the Path_h variant, where the pegs are placed along a line, and disks can be moved from a peg to its nearest neighbor(s) only.\n  Whereas in the simple variant there are h(h-1)/2 possible bi-directional interconnections among pegs, here there are only h-1 of them. Despite the significant reduction in the number of interconnections, the number of moves needed to transfer a pile of n dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4885","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":""},"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":"1102.4885","created_at":"2026-05-18T04:27:58.525807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4885v1","created_at":"2026-05-18T04:27:58.525807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4885","created_at":"2026-05-18T04:27:58.525807+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUXJEFG4EGCH","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUXJEFG4EGCHY5UR","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUXJEFG4","created_at":"2026-05-18T12:26:34.985390+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/LUXJEFG4EGCHY5URZ2VF6TOTIE","json":"https://pith.science/pith/LUXJEFG4EGCHY5URZ2VF6TOTIE.json","graph_json":"https://pith.science/api/pith-number/LUXJEFG4EGCHY5URZ2VF6TOTIE/graph.json","events_json":"https://pith.science/api/pith-number/LUXJEFG4EGCHY5URZ2VF6TOTIE/events.json","paper":"https://pith.science/paper/LUXJEFG4"},"agent_actions":{"view_html":"https://pith.science/pith/LUXJEFG4EGCHY5URZ2VF6TOTIE","download_json":"https://pith.science/pith/LUXJEFG4EGCHY5URZ2VF6TOTIE.json","view_paper":"https://pith.science/paper/LUXJEFG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4885&json=true","fetch_graph":"https://pith.science/api/pith-number/LUXJEFG4EGCHY5URZ2VF6TOTIE/graph.json","fetch_events":"https://pith.science/api/pith-number/LUXJEFG4EGCHY5URZ2VF6TOTIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUXJEFG4EGCHY5URZ2VF6TOTIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUXJEFG4EGCHY5URZ2VF6TOTIE/action/storage_attestation","attest_author":"https://pith.science/pith/LUXJEFG4EGCHY5URZ2VF6TOTIE/action/author_attestation","sign_citation":"https://pith.science/pith/LUXJEFG4EGCHY5URZ2VF6TOTIE/action/citation_signature","submit_replication":"https://pith.science/pith/LUXJEFG4EGCHY5URZ2VF6TOTIE/action/replication_record"}},"created_at":"2026-05-18T04:27:58.525807+00:00","updated_at":"2026-05-18T04:27:58.525807+00:00"}