{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KZCJ5MAJMBRVMPWOYMT7FBHNVD","short_pith_number":"pith:KZCJ5MAJ","canonical_record":{"source":{"id":"1108.4494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-23T04:53:51Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"a04df386e11cd62eddb963e5cd7ece809605ac989206657a9ded3a5c02a8efaa","abstract_canon_sha256":"b72b6afd8e12f5412270c75ae2e4e661dbb23184c79b28ebf15777704fe7abd9"},"schema_version":"1.0"},"canonical_sha256":"56449eb0096063563ecec327f284eda8fd295dad0d073f83a1047f74a5dfcd86","source":{"kind":"arxiv","id":"1108.4494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4494","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4494v1","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4494","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"KZCJ5MAJMBRV","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KZCJ5MAJMBRVMPWO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KZCJ5MAJ","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KZCJ5MAJMBRVMPWOYMT7FBHNVD","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-23T04:53:51Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"a04df386e11cd62eddb963e5cd7ece809605ac989206657a9ded3a5c02a8efaa","abstract_canon_sha256":"b72b6afd8e12f5412270c75ae2e4e661dbb23184c79b28ebf15777704fe7abd9"},"schema_version":"1.0"},"canonical_sha256":"56449eb0096063563ecec327f284eda8fd295dad0d073f83a1047f74a5dfcd86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:54.449777Z","signature_b64":"15K3soj0XgKj6bLBejb/OlG1VTe1fgLTzi0ptz1mF7SbBYZt607Coeke+FcBwYcpymIb7T836g2gsgMqbzM/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56449eb0096063563ecec327f284eda8fd295dad0d073f83a1047f74a5dfcd86","last_reissued_at":"2026-05-18T04:14:54.449209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:54.449209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4494","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ga56aU4yPIn0tATJ1XLbxhuaMcdy9+9M/wGE68oMWgorlsDRkGTVEKBI17PKkK4EnTbcuKA9840FOfy54q7vBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:21:48.108476Z"},"content_sha256":"4ebefeaa6daa673cafe3639998c4a5622426e6dd5e24df592476d48b0773fa09","schema_version":"1.0","event_id":"sha256:4ebefeaa6daa673cafe3639998c4a5622426e6dd5e24df592476d48b0773fa09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KZCJ5MAJMBRVMPWOYMT7FBHNVD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Twin Towers of Hanoi","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.GR"],"primary_cat":"math.CO","authors_text":"Zoran Sunic","submitted_at":"2011-08-23T04:53:51Z","abstract_excerpt":"In the Twin Towers of Hanoi version of the well known Towers of Hanoi Problem there are two coupled sets of pegs. In each move, one chooses a pair of pegs in one of the sets and performs the only possible legal transfer of a disk between the chosen pegs (the smallest disk from one of the pegs is moved to the other peg), but also, simultaneously, between the corresponding pair of pegs in the coupled set (thus the same sequence of moves is always used in both sets). We provide upper and lower bounds on the length of the optimal solutions to problems of the following type. Given an initial and a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4494","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+b6ClxdsykFrW2EYgiAm67+NN+QmE5mAhcuRrbqdNwq59TgZdIo2xQZ4eiwEGAVOf5nGbrLlj3daL2EleCtYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:21:48.108834Z"},"content_sha256":"1f93013c631b5e44d3b5bc71193372158a355ade7806e01c3a40cc6cced016f6","schema_version":"1.0","event_id":"sha256:1f93013c631b5e44d3b5bc71193372158a355ade7806e01c3a40cc6cced016f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZCJ5MAJMBRVMPWOYMT7FBHNVD/bundle.json","state_url":"https://pith.science/pith/KZCJ5MAJMBRVMPWOYMT7FBHNVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZCJ5MAJMBRVMPWOYMT7FBHNVD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T19:21:48Z","links":{"resolver":"https://pith.science/pith/KZCJ5MAJMBRVMPWOYMT7FBHNVD","bundle":"https://pith.science/pith/KZCJ5MAJMBRVMPWOYMT7FBHNVD/bundle.json","state":"https://pith.science/pith/KZCJ5MAJMBRVMPWOYMT7FBHNVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZCJ5MAJMBRVMPWOYMT7FBHNVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KZCJ5MAJMBRVMPWOYMT7FBHNVD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b72b6afd8e12f5412270c75ae2e4e661dbb23184c79b28ebf15777704fe7abd9","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-23T04:53:51Z","title_canon_sha256":"a04df386e11cd62eddb963e5cd7ece809605ac989206657a9ded3a5c02a8efaa"},"schema_version":"1.0","source":{"id":"1108.4494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4494","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4494v1","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4494","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"KZCJ5MAJMBRV","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KZCJ5MAJMBRVMPWO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KZCJ5MAJ","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:1f93013c631b5e44d3b5bc71193372158a355ade7806e01c3a40cc6cced016f6","target":"graph","created_at":"2026-05-18T04:14:54Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In the Twin Towers of Hanoi version of the well known Towers of Hanoi Problem there are two coupled sets of pegs. In each move, one chooses a pair of pegs in one of the sets and performs the only possible legal transfer of a disk between the chosen pegs (the smallest disk from one of the pegs is moved to the other peg), but also, simultaneously, between the corresponding pair of pegs in the coupled set (thus the same sequence of moves is always used in both sets). We provide upper and lower bounds on the length of the optimal solutions to problems of the following type. Given an initial and a ","authors_text":"Zoran Sunic","cross_cats":["cs.DM","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-23T04:53:51Z","title":"Twin Towers of Hanoi"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4494","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4ebefeaa6daa673cafe3639998c4a5622426e6dd5e24df592476d48b0773fa09","target":"record","created_at":"2026-05-18T04:14:54Z","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":"b72b6afd8e12f5412270c75ae2e4e661dbb23184c79b28ebf15777704fe7abd9","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-23T04:53:51Z","title_canon_sha256":"a04df386e11cd62eddb963e5cd7ece809605ac989206657a9ded3a5c02a8efaa"},"schema_version":"1.0","source":{"id":"1108.4494","kind":"arxiv","version":1}},"canonical_sha256":"56449eb0096063563ecec327f284eda8fd295dad0d073f83a1047f74a5dfcd86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56449eb0096063563ecec327f284eda8fd295dad0d073f83a1047f74a5dfcd86","first_computed_at":"2026-05-18T04:14:54.449209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:54.449209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"15K3soj0XgKj6bLBejb/OlG1VTe1fgLTzi0ptz1mF7SbBYZt607Coeke+FcBwYcpymIb7T836g2gsgMqbzM/Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:54.449777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ebefeaa6daa673cafe3639998c4a5622426e6dd5e24df592476d48b0773fa09","sha256:1f93013c631b5e44d3b5bc71193372158a355ade7806e01c3a40cc6cced016f6"],"state_sha256":"890769e0e41c6ba3dd74d24a78b67abeb7804fe18788f2d0454d0ac2b3e59c29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mz7EDXAQTKyd+MpJ+KM0zYCKzRNFxfmmJjETnz4Yv+hiK0+Mvqx3wUY7H+Y1yWwUllomtlCBr749UOAL3jemCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T19:21:48.110889Z","bundle_sha256":"c57b51ab7fda49a84b1720e61397628fd0a213a8edde002cf63ad3f5c9cbb639"}}