{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:H43TQYJQY6FNTJC5QTNYWALVUV","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":"f8c602e4994df998625bee81fb9b64266ee18376ba8cbc4333b17434ac60d90c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-08T12:55:32Z","title_canon_sha256":"b54c8986a5829889ebd418b58aaea0c54694d6fe6566c5c3c1ec47d508be2729"},"schema_version":"1.0","source":{"id":"2311.04656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.04656","created_at":"2026-07-05T07:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"2311.04656v1","created_at":"2026-07-05T07:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04656","created_at":"2026-07-05T07:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"H43TQYJQY6FN","created_at":"2026-07-05T07:10:39Z"},{"alias_kind":"pith_short_16","alias_value":"H43TQYJQY6FNTJC5","created_at":"2026-07-05T07:10:39Z"},{"alias_kind":"pith_short_8","alias_value":"H43TQYJQ","created_at":"2026-07-05T07:10:39Z"}],"graph_snapshots":[{"event_id":"sha256:b27a7cb32ff5181155d46366e107dd37011e530d1b0df54180b23299b36474dc","target":"graph","created_at":"2026-07-05T07:10:39Z","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/2311.04656/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ contains a graph $H$ as a pivot-minor if $H$ can be obtained from $G$ by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. Pivot-minors have mainly been studied from a structural perspective. In this paper we perform the first systematic computational complexity study of pivot-minors. We first prove that the Pivot-Minor problem, which asks if a given graph $G$ contains a pivot-minor isomorphic to a given graph $H$, is NP-complete. If $H$ is not part of the input, we denote the problem by $H$-Pivot-Minor. We give","authors_text":"Dani\\\"el Paulusma, Fran\\c{c}ois Dross, Jisu Jeong, Konrad K. Dabrowski, Mamadou Moustapha Kant\\'e, O-joung Kwon, Sang-il Oum","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-08T12:55:32Z","title":"Computing pivot-minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04656","kind":"arxiv","version":1},"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:10203ccf7af42aef4cde8e791b099c9c7d2dd9be16c2579ab05f4917f2334141","target":"record","created_at":"2026-07-05T07:10:39Z","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":"f8c602e4994df998625bee81fb9b64266ee18376ba8cbc4333b17434ac60d90c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-08T12:55:32Z","title_canon_sha256":"b54c8986a5829889ebd418b58aaea0c54694d6fe6566c5c3c1ec47d508be2729"},"schema_version":"1.0","source":{"id":"2311.04656","kind":"arxiv","version":1}},"canonical_sha256":"3f37386130c78ad9a45d84db8b0175a55b1564d53477d974343e26d33a36a614","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f37386130c78ad9a45d84db8b0175a55b1564d53477d974343e26d33a36a614","first_computed_at":"2026-07-05T07:10:39.503401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:10:39.503401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UbEQuWhlaeMucScpJXzgeFKteF5PhO+/pj4CFobpqJO01WRSzhUDqS+53VVgChjQohN1pxLIvJiQPFYD2voaAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:10:39.503914Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.04656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10203ccf7af42aef4cde8e791b099c9c7d2dd9be16c2579ab05f4917f2334141","sha256:b27a7cb32ff5181155d46366e107dd37011e530d1b0df54180b23299b36474dc"],"state_sha256":"f1f45ec45d4af7438591388261ce23f00db2f0a993ee20d291a78dd18f52c28f"}