{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BEJT6JHJHHRGK2YYQ5MI6TMWKB","short_pith_number":"pith:BEJT6JHJ","schema_version":"1.0","canonical_sha256":"09133f24e939e2656b1887588f4d96505a926f07be459eecf3718080c66abc16","source":{"kind":"arxiv","id":"1508.03674","version":1},"attestation_state":"computed","paper":{"title":"Representing Permutations with Few Moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander E. Holroyd, Lev Nachmanson, Sergey Bereg, Sergey Pupyrev","submitted_at":"2015-08-14T23:19:17Z","abstract_excerpt":"Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i to be a maximal subsequence of at least two consecutive permutations during which its positions form an arithmetic progression of common difference +1 or -1. We prove that for any initial and final permutations, there is a tangle connecting them in which each element makes at most 5 moves, and another in which the total number of moves is at most 4n. On the "},"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":"1508.03674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-14T23:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"72d61609df82114ab26f177b2fe6d3622bbc76138a3340cab508237f1364fa11","abstract_canon_sha256":"1194917981902dc74f282ddaf789c7a060df3bdfc79239ad0825e010c3b2612a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:15.458753Z","signature_b64":"F/kuJBrAb8j00WQvvLSOQLYn0Ap46I091fYHgT1J+CAet2Ui3Nnwf9CM1P80QvZQjEpi9wBNmVdQMds7AugtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09133f24e939e2656b1887588f4d96505a926f07be459eecf3718080c66abc16","last_reissued_at":"2026-05-18T01:35:15.458342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:15.458342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representing Permutations with Few Moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander E. Holroyd, Lev Nachmanson, Sergey Bereg, Sergey Pupyrev","submitted_at":"2015-08-14T23:19:17Z","abstract_excerpt":"Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i to be a maximal subsequence of at least two consecutive permutations during which its positions form an arithmetic progression of common difference +1 or -1. We prove that for any initial and final permutations, there is a tangle connecting them in which each element makes at most 5 moves, and another in which the total number of moves is at most 4n. On the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03674","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":"1508.03674","created_at":"2026-05-18T01:35:15.458397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03674v1","created_at":"2026-05-18T01:35:15.458397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03674","created_at":"2026-05-18T01:35:15.458397+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEJT6JHJHHRG","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEJT6JHJHHRGK2YY","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEJT6JHJ","created_at":"2026-05-18T12:29:14.074870+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/BEJT6JHJHHRGK2YYQ5MI6TMWKB","json":"https://pith.science/pith/BEJT6JHJHHRGK2YYQ5MI6TMWKB.json","graph_json":"https://pith.science/api/pith-number/BEJT6JHJHHRGK2YYQ5MI6TMWKB/graph.json","events_json":"https://pith.science/api/pith-number/BEJT6JHJHHRGK2YYQ5MI6TMWKB/events.json","paper":"https://pith.science/paper/BEJT6JHJ"},"agent_actions":{"view_html":"https://pith.science/pith/BEJT6JHJHHRGK2YYQ5MI6TMWKB","download_json":"https://pith.science/pith/BEJT6JHJHHRGK2YYQ5MI6TMWKB.json","view_paper":"https://pith.science/paper/BEJT6JHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03674&json=true","fetch_graph":"https://pith.science/api/pith-number/BEJT6JHJHHRGK2YYQ5MI6TMWKB/graph.json","fetch_events":"https://pith.science/api/pith-number/BEJT6JHJHHRGK2YYQ5MI6TMWKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEJT6JHJHHRGK2YYQ5MI6TMWKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEJT6JHJHHRGK2YYQ5MI6TMWKB/action/storage_attestation","attest_author":"https://pith.science/pith/BEJT6JHJHHRGK2YYQ5MI6TMWKB/action/author_attestation","sign_citation":"https://pith.science/pith/BEJT6JHJHHRGK2YYQ5MI6TMWKB/action/citation_signature","submit_replication":"https://pith.science/pith/BEJT6JHJHHRGK2YYQ5MI6TMWKB/action/replication_record"}},"created_at":"2026-05-18T01:35:15.458397+00:00","updated_at":"2026-05-18T01:35:15.458397+00:00"}