{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:23GRXNCEZLA7CSVGHCSXUKW5QA","short_pith_number":"pith:23GRXNCE","schema_version":"1.0","canonical_sha256":"d6cd1bb444cac1f14aa638a57a2add800bf1f7412535461ef32206d7fb14a7d8","source":{"kind":"arxiv","id":"2510.18529","version":3},"attestation_state":"computed","paper":{"title":"Circular sorting, strong complete mappings and wreath product constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Carla Groenland, Dion Gijswijt, Paul Bastide, Rohinee Joshi","submitted_at":"2025-10-21T11:16:05Z","abstract_excerpt":"We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort $n$ labelled points on a circle by transpositions. Imagine that the vertices of a cycle of length $n$ are labelled by the elements $1,\\dots,n$. We are allowed to change this labelling by swapping the labels of any two vertices on the cycle. How many swaps are needed to obtain a labelling that has the elements $1,\\dots,n$ in clockwise order?\n  We provide evidence for their conjecture that at most $n-3$ transpositions are needed to sort a circular permutation when $n$ is not prime. W"},"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":"2510.18529","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-10-21T11:16:05Z","cross_cats_sorted":[],"title_canon_sha256":"9435af2bd802cdabfb9ccbff86437d20fff90900468c45b783b4ea507b44444c","abstract_canon_sha256":"4489d8842117347eecbab134d2c33cee2d784bf9eed70abc556d658b2e891fd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:14.246193Z","signature_b64":"2oDerlirvMqtDfNY9rFbyL761GF+TH3sMi4RXH3son9RmQpBMLTQSH8EEHkhI2l8haf+JW/VDjKaiDC7UTe+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6cd1bb444cac1f14aa638a57a2add800bf1f7412535461ef32206d7fb14a7d8","last_reissued_at":"2026-06-19T16:11:14.245685Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:14.245685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circular sorting, strong complete mappings and wreath product constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Carla Groenland, Dion Gijswijt, Paul Bastide, Rohinee Joshi","submitted_at":"2025-10-21T11:16:05Z","abstract_excerpt":"We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort $n$ labelled points on a circle by transpositions. Imagine that the vertices of a cycle of length $n$ are labelled by the elements $1,\\dots,n$. We are allowed to change this labelling by swapping the labels of any two vertices on the cycle. How many swaps are needed to obtain a labelling that has the elements $1,\\dots,n$ in clockwise order?\n  We provide evidence for their conjecture that at most $n-3$ transpositions are needed to sort a circular permutation when $n$ is not prime. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.18529","kind":"arxiv","version":3},"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/2510.18529/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":"2510.18529","created_at":"2026-06-19T16:11:14.245742+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.18529v3","created_at":"2026-06-19T16:11:14.245742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.18529","created_at":"2026-06-19T16:11:14.245742+00:00"},{"alias_kind":"pith_short_12","alias_value":"23GRXNCEZLA7","created_at":"2026-06-19T16:11:14.245742+00:00"},{"alias_kind":"pith_short_16","alias_value":"23GRXNCEZLA7CSVG","created_at":"2026-06-19T16:11:14.245742+00:00"},{"alias_kind":"pith_short_8","alias_value":"23GRXNCE","created_at":"2026-06-19T16:11:14.245742+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/23GRXNCEZLA7CSVGHCSXUKW5QA","json":"https://pith.science/pith/23GRXNCEZLA7CSVGHCSXUKW5QA.json","graph_json":"https://pith.science/api/pith-number/23GRXNCEZLA7CSVGHCSXUKW5QA/graph.json","events_json":"https://pith.science/api/pith-number/23GRXNCEZLA7CSVGHCSXUKW5QA/events.json","paper":"https://pith.science/paper/23GRXNCE"},"agent_actions":{"view_html":"https://pith.science/pith/23GRXNCEZLA7CSVGHCSXUKW5QA","download_json":"https://pith.science/pith/23GRXNCEZLA7CSVGHCSXUKW5QA.json","view_paper":"https://pith.science/paper/23GRXNCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.18529&json=true","fetch_graph":"https://pith.science/api/pith-number/23GRXNCEZLA7CSVGHCSXUKW5QA/graph.json","fetch_events":"https://pith.science/api/pith-number/23GRXNCEZLA7CSVGHCSXUKW5QA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23GRXNCEZLA7CSVGHCSXUKW5QA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23GRXNCEZLA7CSVGHCSXUKW5QA/action/storage_attestation","attest_author":"https://pith.science/pith/23GRXNCEZLA7CSVGHCSXUKW5QA/action/author_attestation","sign_citation":"https://pith.science/pith/23GRXNCEZLA7CSVGHCSXUKW5QA/action/citation_signature","submit_replication":"https://pith.science/pith/23GRXNCEZLA7CSVGHCSXUKW5QA/action/replication_record"}},"created_at":"2026-06-19T16:11:14.245742+00:00","updated_at":"2026-06-19T16:11:14.245742+00:00"}