{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VTVZTD7HLRG7YYIX6P736L5NLV","short_pith_number":"pith:VTVZTD7H","schema_version":"1.0","canonical_sha256":"aceb998fe75c4dfc6117f3ffbf2fad5d50775f34d84d77164a54e6ad8b0c3f8e","source":{"kind":"arxiv","id":"2307.14143","version":1},"attestation_state":"computed","paper":{"title":"Higher-dimensional cubical sliding puzzles","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM","math.GR","math.GT","math.HO"],"primary_cat":"math.CO","authors_text":"\\'Erika Rold\\'an, Moritz Beyer, Peter Voran, Stefano Mereta","submitted_at":"2023-07-26T12:17:41Z","abstract_excerpt":"We introduce higher-dimensional cubical sliding puzzles that are inspired by the classical 15 Puzzle from the 1880s. In our puzzles, on a $d$-dimensional cube, a labeled token can be slid from one vertex to another if it is topologically free to move on lower-dimensional faces. We analyze the solvability of these puzzles by studying how the puzzle graph changes with the number of labeled tokens vs empty vertices. We give characterizations of the different regimes ranging from being completely stuck (and thus all puzzles unsolvable) to having only one giant component where almost all puzzles ca"},"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":"2307.14143","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-26T12:17:41Z","cross_cats_sorted":["cs.DM","math.GR","math.GT","math.HO"],"title_canon_sha256":"7672d9c24a71a72b657e643844178f31f96ac30dd997b7b65b81e6d534e1de84","abstract_canon_sha256":"718ec3ba0899a063400b950189dcf51aaac41026c98acc92df06263b5ea86ede"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:58.260232Z","signature_b64":"A4XpFEJAfC5pY3sYRPy1fGdSWLLdhPKSyj5iwDEy39zh9cwFkvi1WvWUlx0wUNwNGXXzJ+7dJ5foBiVNhrzhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aceb998fe75c4dfc6117f3ffbf2fad5d50775f34d84d77164a54e6ad8b0c3f8e","last_reissued_at":"2026-07-05T06:34:58.259864Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:58.259864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-dimensional cubical sliding puzzles","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM","math.GR","math.GT","math.HO"],"primary_cat":"math.CO","authors_text":"\\'Erika Rold\\'an, Moritz Beyer, Peter Voran, Stefano Mereta","submitted_at":"2023-07-26T12:17:41Z","abstract_excerpt":"We introduce higher-dimensional cubical sliding puzzles that are inspired by the classical 15 Puzzle from the 1880s. In our puzzles, on a $d$-dimensional cube, a labeled token can be slid from one vertex to another if it is topologically free to move on lower-dimensional faces. We analyze the solvability of these puzzles by studying how the puzzle graph changes with the number of labeled tokens vs empty vertices. We give characterizations of the different regimes ranging from being completely stuck (and thus all puzzles unsolvable) to having only one giant component where almost all puzzles ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.14143","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.14143/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":"2307.14143","created_at":"2026-07-05T06:34:58.259931+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.14143v1","created_at":"2026-07-05T06:34:58.259931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.14143","created_at":"2026-07-05T06:34:58.259931+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTVZTD7HLRG7","created_at":"2026-07-05T06:34:58.259931+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTVZTD7HLRG7YYIX","created_at":"2026-07-05T06:34:58.259931+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTVZTD7H","created_at":"2026-07-05T06:34:58.259931+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.01937","citing_title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VTVZTD7HLRG7YYIX6P736L5NLV","json":"https://pith.science/pith/VTVZTD7HLRG7YYIX6P736L5NLV.json","graph_json":"https://pith.science/api/pith-number/VTVZTD7HLRG7YYIX6P736L5NLV/graph.json","events_json":"https://pith.science/api/pith-number/VTVZTD7HLRG7YYIX6P736L5NLV/events.json","paper":"https://pith.science/paper/VTVZTD7H"},"agent_actions":{"view_html":"https://pith.science/pith/VTVZTD7HLRG7YYIX6P736L5NLV","download_json":"https://pith.science/pith/VTVZTD7HLRG7YYIX6P736L5NLV.json","view_paper":"https://pith.science/paper/VTVZTD7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.14143&json=true","fetch_graph":"https://pith.science/api/pith-number/VTVZTD7HLRG7YYIX6P736L5NLV/graph.json","fetch_events":"https://pith.science/api/pith-number/VTVZTD7HLRG7YYIX6P736L5NLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTVZTD7HLRG7YYIX6P736L5NLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTVZTD7HLRG7YYIX6P736L5NLV/action/storage_attestation","attest_author":"https://pith.science/pith/VTVZTD7HLRG7YYIX6P736L5NLV/action/author_attestation","sign_citation":"https://pith.science/pith/VTVZTD7HLRG7YYIX6P736L5NLV/action/citation_signature","submit_replication":"https://pith.science/pith/VTVZTD7HLRG7YYIX6P736L5NLV/action/replication_record"}},"created_at":"2026-07-05T06:34:58.259931+00:00","updated_at":"2026-07-05T06:34:58.259931+00:00"}