{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4IKYFUYECDFCTZJL6KOS5JKZBA","short_pith_number":"pith:4IKYFUYE","schema_version":"1.0","canonical_sha256":"e21582d30410ca29e52bf29d2ea5590811bcb3218c37b53edfa4181f79129f8e","source":{"kind":"arxiv","id":"1409.0119","version":1},"attestation_state":"computed","paper":{"title":"The word problem in Hanoi Towers groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.GR","authors_text":"Ievgen Bondarenko","submitted_at":"2014-08-30T14:57:41Z","abstract_excerpt":"We prove that elements of the Hanoi Towers groups $\\mathcal{H}_m$ have depth bounded from above by a poly-logarithmic function $O(\\log^{m-2} n)$, where $n$ is the length of an element. Therefore the word problem in groups $\\mathcal{H}_m$ is solvable in subexponential time $\\exp(O(\\log^{m-2} n))$."},"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":"1409.0119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-08-30T14:57:41Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"fd04e9c54949779e9be3c4e6112d22dda652f3285a56540141f336ad7716e080","abstract_canon_sha256":"1becc6949544253326c766d6e04bc1460569f806c860dbc52801d30e1361a0ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:53.306840Z","signature_b64":"Xv9LvnWX6S+g5gDch9LiYhwf9s6dZH4Pj6emFheXLv+UXAHsbYmeQwmuDdmUaSTiP9viMzR1TmcE19TrQwj9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e21582d30410ca29e52bf29d2ea5590811bcb3218c37b53edfa4181f79129f8e","last_reissued_at":"2026-05-18T02:43:53.306291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:53.306291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The word problem in Hanoi Towers groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.GR","authors_text":"Ievgen Bondarenko","submitted_at":"2014-08-30T14:57:41Z","abstract_excerpt":"We prove that elements of the Hanoi Towers groups $\\mathcal{H}_m$ have depth bounded from above by a poly-logarithmic function $O(\\log^{m-2} n)$, where $n$ is the length of an element. Therefore the word problem in groups $\\mathcal{H}_m$ is solvable in subexponential time $\\exp(O(\\log^{m-2} n))$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0119","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":"1409.0119","created_at":"2026-05-18T02:43:53.306385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0119v1","created_at":"2026-05-18T02:43:53.306385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0119","created_at":"2026-05-18T02:43:53.306385+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IKYFUYECDFC","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IKYFUYECDFCTZJL","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IKYFUYE","created_at":"2026-05-18T12:28:14.216126+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/4IKYFUYECDFCTZJL6KOS5JKZBA","json":"https://pith.science/pith/4IKYFUYECDFCTZJL6KOS5JKZBA.json","graph_json":"https://pith.science/api/pith-number/4IKYFUYECDFCTZJL6KOS5JKZBA/graph.json","events_json":"https://pith.science/api/pith-number/4IKYFUYECDFCTZJL6KOS5JKZBA/events.json","paper":"https://pith.science/paper/4IKYFUYE"},"agent_actions":{"view_html":"https://pith.science/pith/4IKYFUYECDFCTZJL6KOS5JKZBA","download_json":"https://pith.science/pith/4IKYFUYECDFCTZJL6KOS5JKZBA.json","view_paper":"https://pith.science/paper/4IKYFUYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0119&json=true","fetch_graph":"https://pith.science/api/pith-number/4IKYFUYECDFCTZJL6KOS5JKZBA/graph.json","fetch_events":"https://pith.science/api/pith-number/4IKYFUYECDFCTZJL6KOS5JKZBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IKYFUYECDFCTZJL6KOS5JKZBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IKYFUYECDFCTZJL6KOS5JKZBA/action/storage_attestation","attest_author":"https://pith.science/pith/4IKYFUYECDFCTZJL6KOS5JKZBA/action/author_attestation","sign_citation":"https://pith.science/pith/4IKYFUYECDFCTZJL6KOS5JKZBA/action/citation_signature","submit_replication":"https://pith.science/pith/4IKYFUYECDFCTZJL6KOS5JKZBA/action/replication_record"}},"created_at":"2026-05-18T02:43:53.306385+00:00","updated_at":"2026-05-18T02:43:53.306385+00:00"}