{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RZHETCEL22HDNNEO2VFX7NQNJI","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":"95e0b7ecc1381c43f17b59766af391353d96c50d79f86f317f720a9dbc3ab77d","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2024-10-14T15:07:12Z","title_canon_sha256":"1083c90a4da4f7ff32af6397cbd1c5d2553bdd8f018d91744d1a37f103bb4e08"},"schema_version":"1.0","source":{"id":"2410.10595","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10595","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10595v2","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10595","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"RZHETCEL22HD","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"pith_short_16","alias_value":"RZHETCEL22HDNNEO","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"pith_short_8","alias_value":"RZHETCEL","created_at":"2026-06-12T01:09:06Z"}],"graph_snapshots":[{"event_id":"sha256:6d25f2cb627ea6f0157e7938a2b6d7a18c4b116e3a258fe9210a9451e27d9b57","target":"graph","created_at":"2026-06-12T01:09:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.10595/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An $n$-strand braid is order-preserving if its action on the free group $F_n$ preserves some bi-order of $F_n$. A braid $\\beta$ is order-preserving if and only if the link $L$ obtained as the union of the closure of $\\beta$ and its axis has bi-orderable complement. We describe and implement an algorithm which, given a non-order-preserving braid $\\beta$, confirms this property and returns a proof that $\\beta$ is indeed not order-preserving. Guided by the algorithm, we prove that the infinite family of simple 3-braids $\\sigma_1\\sigma_2^{2m+1}$ are not order-preserving for any integer $m$.","authors_text":"Hannah Turner, Jonathan Johnson, Nancy Scherich","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2024-10-14T15:07:12Z","title":"Searching for non-order-preserving braids algorithmically"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10595","kind":"arxiv","version":2},"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:d05e3ed99300c9cf444519c5599c039b6a11147096e0d447c1ecdc2b5d5017b7","target":"record","created_at":"2026-06-12T01:09:06Z","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":"95e0b7ecc1381c43f17b59766af391353d96c50d79f86f317f720a9dbc3ab77d","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2024-10-14T15:07:12Z","title_canon_sha256":"1083c90a4da4f7ff32af6397cbd1c5d2553bdd8f018d91744d1a37f103bb4e08"},"schema_version":"1.0","source":{"id":"2410.10595","kind":"arxiv","version":2}},"canonical_sha256":"8e4e49888bd68e36b48ed54b7fb60d4a106f30b354ea10a8acb972d3b34d37ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e4e49888bd68e36b48ed54b7fb60d4a106f30b354ea10a8acb972d3b34d37ac","first_computed_at":"2026-06-12T01:09:06.007243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:06.007243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"249Bvj+qNKIulFLfruplw6Baop30Iha9UkcaV2S8wzUL8K2IkY6vg2Grwzh79kioond6yjgck+LMiHCjMXZsCg==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:06.008259Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.10595","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d05e3ed99300c9cf444519c5599c039b6a11147096e0d447c1ecdc2b5d5017b7","sha256:6d25f2cb627ea6f0157e7938a2b6d7a18c4b116e3a258fe9210a9451e27d9b57"],"state_sha256":"613734195115672281a942e450c49e6c0df46bfe6ba5d9437713de67b23ca352"}