{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OCBRZOQTIOAUSUCYMOL7X3ICKU","short_pith_number":"pith:OCBRZOQT","schema_version":"1.0","canonical_sha256":"70831cba1343814950586397fbed02550f625a2dd18fd6eae91907b582f2ed91","source":{"kind":"arxiv","id":"1402.4867","version":1},"attestation_state":"computed","paper":{"title":"An Upper Bound on the Number of Circular Transpositions to Sort a Permutation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anke van Zuylen, Frans Schalekamp, Gexin Yu, James Bieron","submitted_at":"2014-02-20T02:26:28Z","abstract_excerpt":"We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n-1)/2$ adjacent transpositions. We show that, if we allow all adjacent transpositions, as well as the transposition that interchanges the element in position 1 with the element in the last position, then the number of transpositions needed is at most $n^2/4$. This answers an open question posed by Feng, Chitturi and Sudborough (2010)."},"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":"1402.4867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-20T02:26:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0c3cdf87a3b6d1371e4359b053fc25c1d802d90a55fcdf6acb876939f0f87118","abstract_canon_sha256":"1ffe99539940088a21102f0ebb173d486f0e68d6579034e690e7f97ca84db1ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:31.933917Z","signature_b64":"hWs1FzSDPo/XUpK/UVfCD+rcND5ceW/kjD1hA/o6F45vsIPrgaK70R0RV95bQT1/+SyU4mmihJfOntHNJBOJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70831cba1343814950586397fbed02550f625a2dd18fd6eae91907b582f2ed91","last_reissued_at":"2026-05-18T02:58:31.933029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:31.933029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Upper Bound on the Number of Circular Transpositions to Sort a Permutation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anke van Zuylen, Frans Schalekamp, Gexin Yu, James Bieron","submitted_at":"2014-02-20T02:26:28Z","abstract_excerpt":"We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n-1)/2$ adjacent transpositions. We show that, if we allow all adjacent transpositions, as well as the transposition that interchanges the element in position 1 with the element in the last position, then the number of transpositions needed is at most $n^2/4$. This answers an open question posed by Feng, Chitturi and Sudborough (2010)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4867","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":"1402.4867","created_at":"2026-05-18T02:58:31.933181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4867v1","created_at":"2026-05-18T02:58:31.933181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4867","created_at":"2026-05-18T02:58:31.933181+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCBRZOQTIOAU","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCBRZOQTIOAUSUCY","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCBRZOQT","created_at":"2026-05-18T12:28:41.024544+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/OCBRZOQTIOAUSUCYMOL7X3ICKU","json":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU.json","graph_json":"https://pith.science/api/pith-number/OCBRZOQTIOAUSUCYMOL7X3ICKU/graph.json","events_json":"https://pith.science/api/pith-number/OCBRZOQTIOAUSUCYMOL7X3ICKU/events.json","paper":"https://pith.science/paper/OCBRZOQT"},"agent_actions":{"view_html":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU","download_json":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU.json","view_paper":"https://pith.science/paper/OCBRZOQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4867&json=true","fetch_graph":"https://pith.science/api/pith-number/OCBRZOQTIOAUSUCYMOL7X3ICKU/graph.json","fetch_events":"https://pith.science/api/pith-number/OCBRZOQTIOAUSUCYMOL7X3ICKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/action/storage_attestation","attest_author":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/action/author_attestation","sign_citation":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/action/citation_signature","submit_replication":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/action/replication_record"}},"created_at":"2026-05-18T02:58:31.933181+00:00","updated_at":"2026-05-18T02:58:31.933181+00:00"}