{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FVHIKA3IEV3A4RSQCRYLAFSJJK","short_pith_number":"pith:FVHIKA3I","schema_version":"1.0","canonical_sha256":"2d4e85036825760e46501470b016494a8d2a1748262f21e7a8ef9b14defcbe8b","source":{"kind":"arxiv","id":"1710.04551","version":1},"attestation_state":"computed","paper":{"title":"The Trees of Hanoi","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.HO"],"primary_cat":"cs.FL","authors_text":"Joost Engelfriet","submitted_at":"2017-10-12T14:56:56Z","abstract_excerpt":"The game of the Towers of Hanoi is generalized to binary trees. First, a straightforward solution of the game is discussed. Second, a shorter solution is presented, which is then shown to be optimal."},"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":"1710.04551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-10-12T14:56:56Z","cross_cats_sorted":["cs.DS","math.HO"],"title_canon_sha256":"b17c2cbd22b91a03d57f1d0f66bfd49def1f75ef6bc2064a84f24b2146562138","abstract_canon_sha256":"dbd82a4f788e2f8b2d7b46c016d9dc8dde222535775d8ad88e0b7c645f92ad1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:00.699791Z","signature_b64":"tFVWAQPs7zEqo6cxAKbXu722I0Sp/XfSzACbJSobvd+Cn1VRWVzTKzJnSOv3gg2sFR50X1Qmdj9dlmAgbL6IBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d4e85036825760e46501470b016494a8d2a1748262f21e7a8ef9b14defcbe8b","last_reissued_at":"2026-05-18T00:33:00.699077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:00.699077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Trees of Hanoi","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.HO"],"primary_cat":"cs.FL","authors_text":"Joost Engelfriet","submitted_at":"2017-10-12T14:56:56Z","abstract_excerpt":"The game of the Towers of Hanoi is generalized to binary trees. First, a straightforward solution of the game is discussed. Second, a shorter solution is presented, which is then shown to be optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04551","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":"1710.04551","created_at":"2026-05-18T00:33:00.699190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04551v1","created_at":"2026-05-18T00:33:00.699190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04551","created_at":"2026-05-18T00:33:00.699190+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVHIKA3IEV3A","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVHIKA3IEV3A4RSQ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVHIKA3I","created_at":"2026-05-18T12:31:15.632608+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/FVHIKA3IEV3A4RSQCRYLAFSJJK","json":"https://pith.science/pith/FVHIKA3IEV3A4RSQCRYLAFSJJK.json","graph_json":"https://pith.science/api/pith-number/FVHIKA3IEV3A4RSQCRYLAFSJJK/graph.json","events_json":"https://pith.science/api/pith-number/FVHIKA3IEV3A4RSQCRYLAFSJJK/events.json","paper":"https://pith.science/paper/FVHIKA3I"},"agent_actions":{"view_html":"https://pith.science/pith/FVHIKA3IEV3A4RSQCRYLAFSJJK","download_json":"https://pith.science/pith/FVHIKA3IEV3A4RSQCRYLAFSJJK.json","view_paper":"https://pith.science/paper/FVHIKA3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04551&json=true","fetch_graph":"https://pith.science/api/pith-number/FVHIKA3IEV3A4RSQCRYLAFSJJK/graph.json","fetch_events":"https://pith.science/api/pith-number/FVHIKA3IEV3A4RSQCRYLAFSJJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVHIKA3IEV3A4RSQCRYLAFSJJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVHIKA3IEV3A4RSQCRYLAFSJJK/action/storage_attestation","attest_author":"https://pith.science/pith/FVHIKA3IEV3A4RSQCRYLAFSJJK/action/author_attestation","sign_citation":"https://pith.science/pith/FVHIKA3IEV3A4RSQCRYLAFSJJK/action/citation_signature","submit_replication":"https://pith.science/pith/FVHIKA3IEV3A4RSQCRYLAFSJJK/action/replication_record"}},"created_at":"2026-05-18T00:33:00.699190+00:00","updated_at":"2026-05-18T00:33:00.699190+00:00"}