{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5BPR54HEPPQHMB4ONKJHCWQXBL","short_pith_number":"pith:5BPR54HE","schema_version":"1.0","canonical_sha256":"e85f1ef0e47be076078e6a92715a170aceef9e096631661602f84c1203421303","source":{"kind":"arxiv","id":"2212.11969","version":3},"attestation_state":"computed","paper":{"title":"Invertibility of digraphs and tournaments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alex Scott, Elizabeth Wilmer, Emil Powierski, Michael Savery, Noga Alon","submitted_at":"2022-12-22T18:52:33Z","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 "},"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":"2212.11969","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-22T18:52:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e180bca14b47b258618b8d87f731df568f13f0ea55b24d77885abc15684d8d86","abstract_canon_sha256":"40a0517332f0e58c4241f16a4e1715e1951a269704a375c91e977ce51076fa75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:59.129764Z","signature_b64":"OG4J5cGJuxcdRDzEBdQIrMTAboJ4rFV3LYDsKvdf6Bh2F5euhtqviHPc9uzYHYITBDcKlmu9WYPcHUn3a1bwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e85f1ef0e47be076078e6a92715a170aceef9e096631661602f84c1203421303","last_reissued_at":"2026-07-05T07:35:59.129378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:59.129378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Invertibility of digraphs and tournaments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alex Scott, Elizabeth Wilmer, Emil Powierski, Michael Savery, Noga Alon","submitted_at":"2022-12-22T18:52:33Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.11969","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/2212.11969/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":"2212.11969","created_at":"2026-07-05T07:35:59.129429+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.11969v3","created_at":"2026-07-05T07:35:59.129429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.11969","created_at":"2026-07-05T07:35:59.129429+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BPR54HEPPQH","created_at":"2026-07-05T07:35:59.129429+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BPR54HEPPQHMB4O","created_at":"2026-07-05T07:35:59.129429+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BPR54HE","created_at":"2026-07-05T07:35:59.129429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.04633","citing_title":"On the $(\\leq p)$-inversion diameter of oriented graphs","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5BPR54HEPPQHMB4ONKJHCWQXBL","json":"https://pith.science/pith/5BPR54HEPPQHMB4ONKJHCWQXBL.json","graph_json":"https://pith.science/api/pith-number/5BPR54HEPPQHMB4ONKJHCWQXBL/graph.json","events_json":"https://pith.science/api/pith-number/5BPR54HEPPQHMB4ONKJHCWQXBL/events.json","paper":"https://pith.science/paper/5BPR54HE"},"agent_actions":{"view_html":"https://pith.science/pith/5BPR54HEPPQHMB4ONKJHCWQXBL","download_json":"https://pith.science/pith/5BPR54HEPPQHMB4ONKJHCWQXBL.json","view_paper":"https://pith.science/paper/5BPR54HE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.11969&json=true","fetch_graph":"https://pith.science/api/pith-number/5BPR54HEPPQHMB4ONKJHCWQXBL/graph.json","fetch_events":"https://pith.science/api/pith-number/5BPR54HEPPQHMB4ONKJHCWQXBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BPR54HEPPQHMB4ONKJHCWQXBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BPR54HEPPQHMB4ONKJHCWQXBL/action/storage_attestation","attest_author":"https://pith.science/pith/5BPR54HEPPQHMB4ONKJHCWQXBL/action/author_attestation","sign_citation":"https://pith.science/pith/5BPR54HEPPQHMB4ONKJHCWQXBL/action/citation_signature","submit_replication":"https://pith.science/pith/5BPR54HEPPQHMB4ONKJHCWQXBL/action/replication_record"}},"created_at":"2026-07-05T07:35:59.129429+00:00","updated_at":"2026-07-05T07:35:59.129429+00:00"}