{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TYP5QPALUPZJ5ZQVYRPOIIOUNZ","short_pith_number":"pith:TYP5QPAL","schema_version":"1.0","canonical_sha256":"9e1fd83c0ba3f29ee615c45ee421d46e5929bb58e3d508b3225d3109ed385e86","source":{"kind":"arxiv","id":"2605.27617","version":1},"attestation_state":"computed","paper":{"title":"The $k$-out-of-$n$ picture-hanging puzzle: shorter solutions for small $k$ and $n-k$","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Tom Verhoeff","submitted_at":"2026-05-26T19:31:30Z","abstract_excerpt":"The picture-hanging puzzle, popularized by Demaine et al. (2014), asks for a way to wrap a wire around $n$ nails such that the picture hangs as long as fewer than $k$ nails are removed, but falls as soon as any $k$ are removed. Solutions correspond to words in the free group $F_n$. We give explicit, deterministic, polynomial-length constructions for two regimes: $2$-out-of-$n$ with word length at most $\\tfrac{8}{3}n^{\\log_2 6} - 4n^2$, and $(n-2)$-out-of-$n$ with word length $6n\\log_2(n/2)$, both for $n$ a power of two. These improve on W\\\"astlund's quasi-polynomial deterministic construction "},"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":"2605.27617","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T19:31:30Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"2017c92543f880cb2fbecf3d46a130fa5d13c0f0fcd23b48c398ef6c40a8b1fe","abstract_canon_sha256":"8a1d3dfd85f336718edbeaa9f3352d0c73b84c330eace29edff7f262132b78b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:18.385791Z","signature_b64":"lglfWVrJQSx5jTWRrZgzYZDasnxqT0LhTxXoP8wv+wh+MQoh26HhpXAlYTIQ+lf0UNWdhw2/VtfxzxWUeq/XAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e1fd83c0ba3f29ee615c45ee421d46e5929bb58e3d508b3225d3109ed385e86","last_reissued_at":"2026-05-28T01:04:18.385193Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:18.385193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $k$-out-of-$n$ picture-hanging puzzle: shorter solutions for small $k$ and $n-k$","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Tom Verhoeff","submitted_at":"2026-05-26T19:31:30Z","abstract_excerpt":"The picture-hanging puzzle, popularized by Demaine et al. (2014), asks for a way to wrap a wire around $n$ nails such that the picture hangs as long as fewer than $k$ nails are removed, but falls as soon as any $k$ are removed. Solutions correspond to words in the free group $F_n$. We give explicit, deterministic, polynomial-length constructions for two regimes: $2$-out-of-$n$ with word length at most $\\tfrac{8}{3}n^{\\log_2 6} - 4n^2$, and $(n-2)$-out-of-$n$ with word length $6n\\log_2(n/2)$, both for $n$ a power of two. These improve on W\\\"astlund's quasi-polynomial deterministic construction "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27617","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/2605.27617/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":"2605.27617","created_at":"2026-05-28T01:04:18.385291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27617v1","created_at":"2026-05-28T01:04:18.385291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27617","created_at":"2026-05-28T01:04:18.385291+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYP5QPALUPZJ","created_at":"2026-05-28T01:04:18.385291+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYP5QPALUPZJ5ZQV","created_at":"2026-05-28T01:04:18.385291+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYP5QPAL","created_at":"2026-05-28T01:04:18.385291+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/TYP5QPALUPZJ5ZQVYRPOIIOUNZ","json":"https://pith.science/pith/TYP5QPALUPZJ5ZQVYRPOIIOUNZ.json","graph_json":"https://pith.science/api/pith-number/TYP5QPALUPZJ5ZQVYRPOIIOUNZ/graph.json","events_json":"https://pith.science/api/pith-number/TYP5QPALUPZJ5ZQVYRPOIIOUNZ/events.json","paper":"https://pith.science/paper/TYP5QPAL"},"agent_actions":{"view_html":"https://pith.science/pith/TYP5QPALUPZJ5ZQVYRPOIIOUNZ","download_json":"https://pith.science/pith/TYP5QPALUPZJ5ZQVYRPOIIOUNZ.json","view_paper":"https://pith.science/paper/TYP5QPAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27617&json=true","fetch_graph":"https://pith.science/api/pith-number/TYP5QPALUPZJ5ZQVYRPOIIOUNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TYP5QPALUPZJ5ZQVYRPOIIOUNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYP5QPALUPZJ5ZQVYRPOIIOUNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYP5QPALUPZJ5ZQVYRPOIIOUNZ/action/storage_attestation","attest_author":"https://pith.science/pith/TYP5QPALUPZJ5ZQVYRPOIIOUNZ/action/author_attestation","sign_citation":"https://pith.science/pith/TYP5QPALUPZJ5ZQVYRPOIIOUNZ/action/citation_signature","submit_replication":"https://pith.science/pith/TYP5QPALUPZJ5ZQVYRPOIIOUNZ/action/replication_record"}},"created_at":"2026-05-28T01:04:18.385291+00:00","updated_at":"2026-05-28T01:04:18.385291+00:00"}