{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4RIY3N7LRBDJQMKGC26OO4RG7P","short_pith_number":"pith:4RIY3N7L","schema_version":"1.0","canonical_sha256":"e4518db7eb884698314616bce77226fbe803fb8a892de6b1d29753f12aa67ed3","source":{"kind":"arxiv","id":"2407.15384","version":4},"attestation_state":"computed","paper":{"title":"Inversion diameter and treewidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haozhe Wang, Mei Lu, Yichen Wang, Yuxuan Yang","submitted_at":"2024-07-22T05:27:44Z","abstract_excerpt":"In an oriented graph $\\overrightarrow{G}$, the inversion of a subset $X$ of vertices is the operation that reverses the orientation of all arcs with both end-vertices in $X$. The inversion graph of a graph $G$, denoted by $\\mathcal{I}(G)$, is the graph whose vertices are orientations of $G$ in which two orientations $\\overrightarrow{G_1}$ and $\\overrightarrow{G_2}$ are adjacent if and only if there is an inversion transforming $\\overrightarrow{G_1}$ into $\\overrightarrow{G_2}$.The inversion diameter of a graph $G$ is the diameter of its inversion graph $\\mathcal{I}(G)$, denoted by $\\mathrm{dia"},"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":"2407.15384","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-22T05:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"dcaa05ae9079c943f9e561fd4f02ad93240c50eae9376f47b3d3f8b064f30f35","abstract_canon_sha256":"54ccc350e545d3f172a404dab6883b4ec8b3d14a6b0b43c76c1f9e10c113875a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:04.806455Z","signature_b64":"WQu/0muXvdN9CnD3/GCX0LECGnICuVAhr4ng7OxUE5/j/AcgMVg5L8My2OqVdiF7I5N5KWf35L018g/nfeDdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4518db7eb884698314616bce77226fbe803fb8a892de6b1d29753f12aa67ed3","last_reissued_at":"2026-05-20T00:04:04.805535Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:04.805535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inversion diameter and treewidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haozhe Wang, Mei Lu, Yichen Wang, Yuxuan Yang","submitted_at":"2024-07-22T05:27:44Z","abstract_excerpt":"In an oriented graph $\\overrightarrow{G}$, the inversion of a subset $X$ of vertices is the operation that reverses the orientation of all arcs with both end-vertices in $X$. The inversion graph of a graph $G$, denoted by $\\mathcal{I}(G)$, is the graph whose vertices are orientations of $G$ in which two orientations $\\overrightarrow{G_1}$ and $\\overrightarrow{G_2}$ are adjacent if and only if there is an inversion transforming $\\overrightarrow{G_1}$ into $\\overrightarrow{G_2}$.The inversion diameter of a graph $G$ is the diameter of its inversion graph $\\mathcal{I}(G)$, denoted by $\\mathrm{dia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.15384","kind":"arxiv","version":4},"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/2407.15384/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":"2407.15384","created_at":"2026-05-20T00:04:04.805655+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.15384v4","created_at":"2026-05-20T00:04:04.805655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.15384","created_at":"2026-05-20T00:04:04.805655+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RIY3N7LRBDJ","created_at":"2026-05-20T00:04:04.805655+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RIY3N7LRBDJQMKG","created_at":"2026-05-20T00:04:04.805655+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RIY3N7L","created_at":"2026-05-20T00:04:04.805655+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.22584","citing_title":"Increasing arc-connectivity by bounded- and fixed-size inversions","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P","json":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P.json","graph_json":"https://pith.science/api/pith-number/4RIY3N7LRBDJQMKGC26OO4RG7P/graph.json","events_json":"https://pith.science/api/pith-number/4RIY3N7LRBDJQMKGC26OO4RG7P/events.json","paper":"https://pith.science/paper/4RIY3N7L"},"agent_actions":{"view_html":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P","download_json":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P.json","view_paper":"https://pith.science/paper/4RIY3N7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.15384&json=true","fetch_graph":"https://pith.science/api/pith-number/4RIY3N7LRBDJQMKGC26OO4RG7P/graph.json","fetch_events":"https://pith.science/api/pith-number/4RIY3N7LRBDJQMKGC26OO4RG7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/action/storage_attestation","attest_author":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/action/author_attestation","sign_citation":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/action/citation_signature","submit_replication":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/action/replication_record"}},"created_at":"2026-05-20T00:04:04.805655+00:00","updated_at":"2026-05-20T00:04:04.805655+00:00"}