{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4RIY3N7LRBDJQMKGC26OO4RG7P","short_pith_number":"pith:4RIY3N7L","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"},"canonical_sha256":"e4518db7eb884698314616bce77226fbe803fb8a892de6b1d29753f12aa67ed3","source":{"kind":"arxiv","id":"2407.15384","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.15384","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"2407.15384v4","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.15384","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"4RIY3N7LRBDJ","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_16","alias_value":"4RIY3N7LRBDJQMKG","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_8","alias_value":"4RIY3N7L","created_at":"2026-05-20T00:04:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4RIY3N7LRBDJQMKGC26OO4RG7P","target":"record","payload":{"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"},"canonical_sha256":"e4518db7eb884698314616bce77226fbe803fb8a892de6b1d29753f12aa67ed3","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"},"source_kind":"arxiv","source_id":"2407.15384","source_version":4,"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-20T00:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVyH9rjf7nxzTGxxs1ySktB0UsqEITolKrIr11GIYPq1DC+maQwOLQ9D/q1sDbrZQswXml6u7dbZHIACEoVDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:47:56.580092Z"},"content_sha256":"3d66061f832bd041f0591bb3dd1795fc8ed8a16c4190fd545dc72321da7f6a88","schema_version":"1.0","event_id":"sha256:3d66061f832bd041f0591bb3dd1795fc8ed8a16c4190fd545dc72321da7f6a88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4RIY3N7LRBDJQMKGC26OO4RG7P","target":"graph","payload":{"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"},"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-20T00:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkI+GR3rwQUkz3QQARXYXa7biB6OMKS/7yaogSnFR6HobESyq5uqKAMjRwbI7R/NHutxkQ/I1YMG/Wttq+iZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:47:56.580948Z"},"content_sha256":"4aa3479b997f65022bdd226dc57b8e3ffbc80e39c97ae41f0d432bf03bd70e78","schema_version":"1.0","event_id":"sha256:4aa3479b997f65022bdd226dc57b8e3ffbc80e39c97ae41f0d432bf03bd70e78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/bundle.json","state_url":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/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-01T06:47:56Z","links":{"resolver":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P","bundle":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/bundle.json","state":"https://pith.science/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RIY3N7LRBDJQMKGC26OO4RG7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4RIY3N7LRBDJQMKGC26OO4RG7P","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":"54ccc350e545d3f172a404dab6883b4ec8b3d14a6b0b43c76c1f9e10c113875a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-22T05:27:44Z","title_canon_sha256":"dcaa05ae9079c943f9e561fd4f02ad93240c50eae9376f47b3d3f8b064f30f35"},"schema_version":"1.0","source":{"id":"2407.15384","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.15384","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"2407.15384v4","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.15384","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"4RIY3N7LRBDJ","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_16","alias_value":"4RIY3N7LRBDJQMKG","created_at":"2026-05-20T00:04:04Z"},{"alias_kind":"pith_short_8","alias_value":"4RIY3N7L","created_at":"2026-05-20T00:04:04Z"}],"graph_snapshots":[{"event_id":"sha256:4aa3479b997f65022bdd226dc57b8e3ffbc80e39c97ae41f0d432bf03bd70e78","target":"graph","created_at":"2026-05-20T00:04:04Z","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/2407.15384/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Haozhe Wang, Mei Lu, Yichen Wang, Yuxuan Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-22T05:27:44Z","title":"Inversion diameter and treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.15384","kind":"arxiv","version":4},"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:3d66061f832bd041f0591bb3dd1795fc8ed8a16c4190fd545dc72321da7f6a88","target":"record","created_at":"2026-05-20T00:04:04Z","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":"54ccc350e545d3f172a404dab6883b4ec8b3d14a6b0b43c76c1f9e10c113875a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-22T05:27:44Z","title_canon_sha256":"dcaa05ae9079c943f9e561fd4f02ad93240c50eae9376f47b3d3f8b064f30f35"},"schema_version":"1.0","source":{"id":"2407.15384","kind":"arxiv","version":4}},"canonical_sha256":"e4518db7eb884698314616bce77226fbe803fb8a892de6b1d29753f12aa67ed3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4518db7eb884698314616bce77226fbe803fb8a892de6b1d29753f12aa67ed3","first_computed_at":"2026-05-20T00:04:04.805535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:04.805535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WQu/0muXvdN9CnD3/GCX0LECGnICuVAhr4ng7OxUE5/j/AcgMVg5L8My2OqVdiF7I5N5KWf35L018g/nfeDdBg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:04.806455Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.15384","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d66061f832bd041f0591bb3dd1795fc8ed8a16c4190fd545dc72321da7f6a88","sha256:4aa3479b997f65022bdd226dc57b8e3ffbc80e39c97ae41f0d432bf03bd70e78"],"state_sha256":"6e51bff939ac94118af49570a4942e6184b7f08c838cc2f79e9a4225709ce14e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBSYoHdaW8X0/oN9Y9UChm7RvqaNtxBaduGT7ZGO1HgSIUktjFgB3TaHxFOEOvVtL6HtGnARLUfq1nXlTKiQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:47:56.585062Z","bundle_sha256":"6d8d320cd4b59eed81e3d3bc80cc5925c454083d76db819afdc7a601a9114a31"}}