{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PAL7564GX723JDOA7NFCPLBRI4","short_pith_number":"pith:PAL7564G","canonical_record":{"source":{"id":"1906.05689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:48:23Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"80d6b217415ef26310215708e7370bee8b5c23ef0a03eee246b058830ac2ae8b","abstract_canon_sha256":"3b3f7f76c598174570ea91380d910eca02b82c1b3bfe511d7ed45f4f25792bd8"},"schema_version":"1.0"},"canonical_sha256":"7817fefb86bff5b48dc0fb4a27ac3147169660e2350dbbd7758586d4400dd173","source":{"kind":"arxiv","id":"1906.05689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05689","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05689v1","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05689","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"PAL7564GX723","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PAL7564GX723JDOA","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PAL7564G","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PAL7564GX723JDOA7NFCPLBRI4","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:48:23Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"80d6b217415ef26310215708e7370bee8b5c23ef0a03eee246b058830ac2ae8b","abstract_canon_sha256":"3b3f7f76c598174570ea91380d910eca02b82c1b3bfe511d7ed45f4f25792bd8"},"schema_version":"1.0"},"canonical_sha256":"7817fefb86bff5b48dc0fb4a27ac3147169660e2350dbbd7758586d4400dd173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:24.585285Z","signature_b64":"j9n5O4q1D959qIK4R6U3zR1SykyCp3PYgrSGGeXVlBk5fNtG0sjIc8Q+clPrh5S6HsH9VOxSzEkmr92LoXUXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7817fefb86bff5b48dc0fb4a27ac3147169660e2350dbbd7758586d4400dd173","last_reissued_at":"2026-05-17T23:43:24.584777Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:24.584777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05689","source_version":1,"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-17T23:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQimOm0jP755o7NPtHmr7ShesfYG+pQtFG2C+gtdwxARJPDVHAqWHpjS+4smg4C7oEb/FdbvYaaoMqb63HIQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:23:38.674489Z"},"content_sha256":"fe9d4cace0e199a4cb7cd36a80121118c119de0e8004ffeadc26b1d7a22a3b95","schema_version":"1.0","event_id":"sha256:fe9d4cace0e199a4cb7cd36a80121118c119de0e8004ffeadc26b1d7a22a3b95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PAL7564GX723JDOA7NFCPLBRI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of the vertex-minor problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Axel Dahlberg, Jonas Helsen, Stephanie Wehner","submitted_at":"2019-06-12T12:48:23Z","abstract_excerpt":"A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades and have found applications in other fields such as quantum information theory. Therefore it is natural to consider the computational complexity of deciding whether a given graph G has a vertex-minor isomorphic to another graph H, which was previously unknown. Here we prove that this decision problem is NP-complete, even when restricting H, G to be circle grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05689","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-17T23:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I9lAUBuXrLm2TQINJBcrU0h5wUOKGj1T/FTGbYZ3GaVEdFhI8EgKfV4rqHF8BjtMS4zAiSTp6DKaHoClJrXSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:23:38.674836Z"},"content_sha256":"925a1d893b00b42a9ad9063c02820f0a51e9dd8536a3ae3d87004adbb926bb9e","schema_version":"1.0","event_id":"sha256:925a1d893b00b42a9ad9063c02820f0a51e9dd8536a3ae3d87004adbb926bb9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAL7564GX723JDOA7NFCPLBRI4/bundle.json","state_url":"https://pith.science/pith/PAL7564GX723JDOA7NFCPLBRI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAL7564GX723JDOA7NFCPLBRI4/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-01T08:23:38Z","links":{"resolver":"https://pith.science/pith/PAL7564GX723JDOA7NFCPLBRI4","bundle":"https://pith.science/pith/PAL7564GX723JDOA7NFCPLBRI4/bundle.json","state":"https://pith.science/pith/PAL7564GX723JDOA7NFCPLBRI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAL7564GX723JDOA7NFCPLBRI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PAL7564GX723JDOA7NFCPLBRI4","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":"3b3f7f76c598174570ea91380d910eca02b82c1b3bfe511d7ed45f4f25792bd8","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:48:23Z","title_canon_sha256":"80d6b217415ef26310215708e7370bee8b5c23ef0a03eee246b058830ac2ae8b"},"schema_version":"1.0","source":{"id":"1906.05689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05689","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05689v1","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05689","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"PAL7564GX723","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PAL7564GX723JDOA","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PAL7564G","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:925a1d893b00b42a9ad9063c02820f0a51e9dd8536a3ae3d87004adbb926bb9e","target":"graph","created_at":"2026-05-17T23:43:24Z","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"},"paper":{"abstract_excerpt":"A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades and have found applications in other fields such as quantum information theory. Therefore it is natural to consider the computational complexity of deciding whether a given graph G has a vertex-minor isomorphic to another graph H, which was previously unknown. Here we prove that this decision problem is NP-complete, even when restricting H, G to be circle grap","authors_text":"Axel Dahlberg, Jonas Helsen, Stephanie Wehner","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:48:23Z","title":"The complexity of the vertex-minor problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05689","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:fe9d4cace0e199a4cb7cd36a80121118c119de0e8004ffeadc26b1d7a22a3b95","target":"record","created_at":"2026-05-17T23:43:24Z","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":"3b3f7f76c598174570ea91380d910eca02b82c1b3bfe511d7ed45f4f25792bd8","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:48:23Z","title_canon_sha256":"80d6b217415ef26310215708e7370bee8b5c23ef0a03eee246b058830ac2ae8b"},"schema_version":"1.0","source":{"id":"1906.05689","kind":"arxiv","version":1}},"canonical_sha256":"7817fefb86bff5b48dc0fb4a27ac3147169660e2350dbbd7758586d4400dd173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7817fefb86bff5b48dc0fb4a27ac3147169660e2350dbbd7758586d4400dd173","first_computed_at":"2026-05-17T23:43:24.584777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:24.584777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j9n5O4q1D959qIK4R6U3zR1SykyCp3PYgrSGGeXVlBk5fNtG0sjIc8Q+clPrh5S6HsH9VOxSzEkmr92LoXUXAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:24.585285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe9d4cace0e199a4cb7cd36a80121118c119de0e8004ffeadc26b1d7a22a3b95","sha256:925a1d893b00b42a9ad9063c02820f0a51e9dd8536a3ae3d87004adbb926bb9e"],"state_sha256":"5614c0b9cd5094ffc62a9a14e532a4cb3c7326d2e4f613b39647cdcd21395ba8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/dw5zWFRbItIcXEwzfZHGSADiT1ZMaFiagvgCA2M/CVfp5Hh99/n9kydR7wzI6yXOaMPjAW9crr5LEnPZBwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:23:38.676817Z","bundle_sha256":"4ae82f578f2290c01972f9b9fa4c857416232b24be0f7dc4c23d7c104aaee590"}}