{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OCBRZOQTIOAUSUCYMOL7X3ICKU","short_pith_number":"pith:OCBRZOQT","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"},"canonical_sha256":"70831cba1343814950586397fbed02550f625a2dd18fd6eae91907b582f2ed91","source":{"kind":"arxiv","id":"1402.4867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4867","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4867v1","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4867","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"OCBRZOQTIOAU","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OCBRZOQTIOAUSUCY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OCBRZOQT","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OCBRZOQTIOAUSUCYMOL7X3ICKU","target":"record","payload":{"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"},"canonical_sha256":"70831cba1343814950586397fbed02550f625a2dd18fd6eae91907b582f2ed91","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"},"source_kind":"arxiv","source_id":"1402.4867","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhd/LXhwqMWr8A1FPuCvfUdIi6JKRloSzPodL1j1BpLivqR51+Noku7FiJpRT9AvRuXa43K3+ASPy839dzyQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:12:26.497163Z"},"content_sha256":"0d79c572525939b87d7519891f1a637a7444d8f4b9233de0c4bb6cd9bb771ff4","schema_version":"1.0","event_id":"sha256:0d79c572525939b87d7519891f1a637a7444d8f4b9233de0c4bb6cd9bb771ff4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OCBRZOQTIOAUSUCYMOL7X3ICKU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7o4igNQkTESR+vwtRr2Aam5OZpLObE9/qBBYst/zrgjDYnBGsg8aErDxEx246LfjPwTV2u8nVZyGJucdN5ODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:12:26.497520Z"},"content_sha256":"9b38ee1a8b0ff60381dc2d04a11d941615af8d6e4102b3d478590b42932f4c0a","schema_version":"1.0","event_id":"sha256:9b38ee1a8b0ff60381dc2d04a11d941615af8d6e4102b3d478590b42932f4c0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/bundle.json","state_url":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T06:12:26Z","links":{"resolver":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU","bundle":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/bundle.json","state":"https://pith.science/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCBRZOQTIOAUSUCYMOL7X3ICKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OCBRZOQTIOAUSUCYMOL7X3ICKU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1ffe99539940088a21102f0ebb173d486f0e68d6579034e690e7f97ca84db1ee","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-20T02:26:28Z","title_canon_sha256":"0c3cdf87a3b6d1371e4359b053fc25c1d802d90a55fcdf6acb876939f0f87118"},"schema_version":"1.0","source":{"id":"1402.4867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4867","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4867v1","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4867","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"OCBRZOQTIOAU","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OCBRZOQTIOAUSUCY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OCBRZOQT","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:9b38ee1a8b0ff60381dc2d04a11d941615af8d6e4102b3d478590b42932f4c0a","target":"graph","created_at":"2026-05-18T02:58:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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).","authors_text":"Anke van Zuylen, Frans Schalekamp, Gexin Yu, James Bieron","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-20T02:26:28Z","title":"An Upper Bound on the Number of Circular Transpositions to Sort a Permutation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4867","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d79c572525939b87d7519891f1a637a7444d8f4b9233de0c4bb6cd9bb771ff4","target":"record","created_at":"2026-05-18T02:58:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1ffe99539940088a21102f0ebb173d486f0e68d6579034e690e7f97ca84db1ee","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-20T02:26:28Z","title_canon_sha256":"0c3cdf87a3b6d1371e4359b053fc25c1d802d90a55fcdf6acb876939f0f87118"},"schema_version":"1.0","source":{"id":"1402.4867","kind":"arxiv","version":1}},"canonical_sha256":"70831cba1343814950586397fbed02550f625a2dd18fd6eae91907b582f2ed91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70831cba1343814950586397fbed02550f625a2dd18fd6eae91907b582f2ed91","first_computed_at":"2026-05-18T02:58:31.933029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:31.933029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hWs1FzSDPo/XUpK/UVfCD+rcND5ceW/kjD1hA/o6F45vsIPrgaK70R0RV95bQT1/+SyU4mmihJfOntHNJBOJDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:31.933917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d79c572525939b87d7519891f1a637a7444d8f4b9233de0c4bb6cd9bb771ff4","sha256:9b38ee1a8b0ff60381dc2d04a11d941615af8d6e4102b3d478590b42932f4c0a"],"state_sha256":"f345dff56acf6eca0f863b49173ab285e32f2e8fbf615d57b8e913bcb1bf1088"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJ/6Iz471eASwS0CBNOJs75o3RGipkykSk8LcVYg/RZYy5eJYuMZfOZUTcEBFeLWxoZJHhUe9EWigQhomsY/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:12:26.499470Z","bundle_sha256":"b6a725721d34c4e341a50da4d1d3b62562f958a6450448053626365acdaeab31"}}