{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5BPR54HEPPQHMB4ONKJHCWQXBL","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":"40a0517332f0e58c4241f16a4e1715e1951a269704a375c91e977ce51076fa75","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-22T18:52:33Z","title_canon_sha256":"e180bca14b47b258618b8d87f731df568f13f0ea55b24d77885abc15684d8d86"},"schema_version":"1.0","source":{"id":"2212.11969","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.11969","created_at":"2026-07-05T07:35:59Z"},{"alias_kind":"arxiv_version","alias_value":"2212.11969v3","created_at":"2026-07-05T07:35:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.11969","created_at":"2026-07-05T07:35:59Z"},{"alias_kind":"pith_short_12","alias_value":"5BPR54HEPPQH","created_at":"2026-07-05T07:35:59Z"},{"alias_kind":"pith_short_16","alias_value":"5BPR54HEPPQHMB4O","created_at":"2026-07-05T07:35:59Z"},{"alias_kind":"pith_short_8","alias_value":"5BPR54HE","created_at":"2026-07-05T07:35:59Z"}],"graph_snapshots":[{"event_id":"sha256:315216c72361c49d94bf9dea403a6b9790a5c93f801a5b7947cfb4061cd77317","target":"graph","created_at":"2026-07-05T07:35:59Z","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/2212.11969/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For an oriented graph $D$ and a set $X\\subseteq V(D)$, the inversion of $X$ in $D$ is the digraph obtained by reversing the orientations of the edges of $D$ with both endpoints in $X$. The inversion number of $D$, $\\textrm{inv}(D)$, is the minimum number of inversions which can be applied in turn to $D$ to produce an acyclic digraph. Answering a recent question of Bang-Jensen, da Silva, and Havet we show that, for each $k\\in\\mathbb{N}$ and tournament $T$, the problem of deciding whether $\\textrm{inv}(T)\\leq k$ is solvable in time $O_k(|V(T)|^2)$, which is tight for all $k$. In particular, the ","authors_text":"Alex Scott, Elizabeth Wilmer, Emil Powierski, Michael Savery, Noga Alon","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-22T18:52:33Z","title":"Invertibility of digraphs and tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.11969","kind":"arxiv","version":3},"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:f42d1f8040931f7d2f25a49eff8bf8a324d31900015f2d3ba629700685c8e621","target":"record","created_at":"2026-07-05T07:35:59Z","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":"40a0517332f0e58c4241f16a4e1715e1951a269704a375c91e977ce51076fa75","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-22T18:52:33Z","title_canon_sha256":"e180bca14b47b258618b8d87f731df568f13f0ea55b24d77885abc15684d8d86"},"schema_version":"1.0","source":{"id":"2212.11969","kind":"arxiv","version":3}},"canonical_sha256":"e85f1ef0e47be076078e6a92715a170aceef9e096631661602f84c1203421303","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e85f1ef0e47be076078e6a92715a170aceef9e096631661602f84c1203421303","first_computed_at":"2026-07-05T07:35:59.129378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:35:59.129378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OG4J5cGJuxcdRDzEBdQIrMTAboJ4rFV3LYDsKvdf6Bh2F5euhtqviHPc9uzYHYITBDcKlmu9WYPcHUn3a1bwBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:35:59.129764Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.11969","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f42d1f8040931f7d2f25a49eff8bf8a324d31900015f2d3ba629700685c8e621","sha256:315216c72361c49d94bf9dea403a6b9790a5c93f801a5b7947cfb4061cd77317"],"state_sha256":"3091e6621e6f3eb49a27552c5a20b840b630a5548d9202c22bb582e93ab8e87e"}