{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HSQDKAW7UQ5NPE4CVU5O3Y4ATI","short_pith_number":"pith:HSQDKAW7","schema_version":"1.0","canonical_sha256":"3ca03502dfa43ad79382ad3aede3809a204d953b17c57f96415f98b852179d7b","source":{"kind":"arxiv","id":"2510.18010","version":2},"attestation_state":"computed","paper":{"title":"On the expansion of Hanoi graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Frishberg, David Eppstein, William Maxwell","submitted_at":"2025-10-20T18:43:24Z","abstract_excerpt":"The famous Tower of Hanoi puzzle involves moving $n$ discs of distinct sizes from one of $p\\geq 3$ pegs (traditionally $p=3$) to another of the pegs, subject to the constraints that only one disc may be moved at a time, and no disc can ever be placed on a disc smaller than itself. Much is known about the Hanoi graph $H_p^n$, whose $p^n$ vertices represent the configurations of the puzzle, and whose edges represent the pairs of configurations separated by a single legal move. In a previous paper, the present authors presented nearly tight asymptotic bounds of $O((p-2)^n)$ and $\\Omega(n^{(1-p)/2"},"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":"2510.18010","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-20T18:43:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"695bb0d09619f9783351de14f5d8a44ba48203902cff8d244c8e2a3af26b6411","abstract_canon_sha256":"acd3bdaeef92202b749c56a566f3d25d42fe9ba88bcc4caccefad483d6e22045"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T00:14:00.609682Z","signature_b64":"JPyIw45khdYzAtp/CwGUbUKA2hpqwcR6s2kd8oIjUdEHWnkZLzrWfrBB+zDxPb4xwsiusF9eghrlXYqfcNo1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ca03502dfa43ad79382ad3aede3809a204d953b17c57f96415f98b852179d7b","last_reissued_at":"2026-06-29T00:14:00.609219Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T00:14:00.609219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the expansion of Hanoi graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Frishberg, David Eppstein, William Maxwell","submitted_at":"2025-10-20T18:43:24Z","abstract_excerpt":"The famous Tower of Hanoi puzzle involves moving $n$ discs of distinct sizes from one of $p\\geq 3$ pegs (traditionally $p=3$) to another of the pegs, subject to the constraints that only one disc may be moved at a time, and no disc can ever be placed on a disc smaller than itself. Much is known about the Hanoi graph $H_p^n$, whose $p^n$ vertices represent the configurations of the puzzle, and whose edges represent the pairs of configurations separated by a single legal move. In a previous paper, the present authors presented nearly tight asymptotic bounds of $O((p-2)^n)$ and $\\Omega(n^{(1-p)/2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.18010","kind":"arxiv","version":2},"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/2510.18010/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":"2510.18010","created_at":"2026-06-29T00:14:00.609275+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.18010v2","created_at":"2026-06-29T00:14:00.609275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.18010","created_at":"2026-06-29T00:14:00.609275+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSQDKAW7UQ5N","created_at":"2026-06-29T00:14:00.609275+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSQDKAW7UQ5NPE4C","created_at":"2026-06-29T00:14:00.609275+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSQDKAW7","created_at":"2026-06-29T00:14:00.609275+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/HSQDKAW7UQ5NPE4CVU5O3Y4ATI","json":"https://pith.science/pith/HSQDKAW7UQ5NPE4CVU5O3Y4ATI.json","graph_json":"https://pith.science/api/pith-number/HSQDKAW7UQ5NPE4CVU5O3Y4ATI/graph.json","events_json":"https://pith.science/api/pith-number/HSQDKAW7UQ5NPE4CVU5O3Y4ATI/events.json","paper":"https://pith.science/paper/HSQDKAW7"},"agent_actions":{"view_html":"https://pith.science/pith/HSQDKAW7UQ5NPE4CVU5O3Y4ATI","download_json":"https://pith.science/pith/HSQDKAW7UQ5NPE4CVU5O3Y4ATI.json","view_paper":"https://pith.science/paper/HSQDKAW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.18010&json=true","fetch_graph":"https://pith.science/api/pith-number/HSQDKAW7UQ5NPE4CVU5O3Y4ATI/graph.json","fetch_events":"https://pith.science/api/pith-number/HSQDKAW7UQ5NPE4CVU5O3Y4ATI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSQDKAW7UQ5NPE4CVU5O3Y4ATI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSQDKAW7UQ5NPE4CVU5O3Y4ATI/action/storage_attestation","attest_author":"https://pith.science/pith/HSQDKAW7UQ5NPE4CVU5O3Y4ATI/action/author_attestation","sign_citation":"https://pith.science/pith/HSQDKAW7UQ5NPE4CVU5O3Y4ATI/action/citation_signature","submit_replication":"https://pith.science/pith/HSQDKAW7UQ5NPE4CVU5O3Y4ATI/action/replication_record"}},"created_at":"2026-06-29T00:14:00.609275+00:00","updated_at":"2026-06-29T00:14:00.609275+00:00"}