{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4MKBMB6MVRUWQJWCDEWETS4UVB","short_pith_number":"pith:4MKBMB6M","canonical_record":{"source":{"id":"1606.04383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-14T14:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"967b9fad3a15c646adb46d6e1faf1bff9e26075fc49ef8d644376ca0f08ef493","abstract_canon_sha256":"02f31b971a711a1ec7466d7eb5a5d50e70d256de17faa36833938eeb86ac9300"},"schema_version":"1.0"},"canonical_sha256":"e3141607ccac696826c2192c49cb94a85fc95321113bdb245ee73576e4c588a0","source":{"kind":"arxiv","id":"1606.04383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04383","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04383v1","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04383","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"4MKBMB6MVRUW","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4MKBMB6MVRUWQJWC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4MKBMB6M","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4MKBMB6MVRUWQJWCDEWETS4UVB","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-14T14:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"967b9fad3a15c646adb46d6e1faf1bff9e26075fc49ef8d644376ca0f08ef493","abstract_canon_sha256":"02f31b971a711a1ec7466d7eb5a5d50e70d256de17faa36833938eeb86ac9300"},"schema_version":"1.0"},"canonical_sha256":"e3141607ccac696826c2192c49cb94a85fc95321113bdb245ee73576e4c588a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:25.671539Z","signature_b64":"96kVQfj4NjkpxgXIi5xs/EdL6acDBmlaECewMF8ot4H44gdSf2mUrtpVBOnvWwCs3ExmibVmgNIaQrgqcM5jCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3141607ccac696826c2192c49cb94a85fc95321113bdb245ee73576e4c588a0","last_reissued_at":"2026-05-18T01:12:25.671212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:25.671212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04383","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-18T01:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mGnt79EOFPwUkNztZYOPePB6iwvYWnYU+rknrAMnozLdKb4BEHF4JGUYn3cJL5mJXQMx/uYOd2CSJAnUCgmGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:56:00.668820Z"},"content_sha256":"2ddfa8814ae4cac8819547ec0ffca091c076237ba91383a88bc0c78b13c21e20","schema_version":"1.0","event_id":"sha256:2ddfa8814ae4cac8819547ec0ffca091c076237ba91383a88bc0c78b13c21e20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4MKBMB6MVRUWQJWCDEWETS4UVB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Frank Fuhlbr\\\"uck, Gaurav Rattan, Johannes K\\\"obler, Sebastian Kuhnert, V. Arvind","submitted_at":"2016-06-14T14:19:09Z","abstract_excerpt":"In this paper we study the complexity of the following problems:\n  Given a colored graph X=(V,E,c), compute a minimum cardinality set S of vertices such that no nontrivial automorphism of X fixes all vertices in S. A closely related problem is computing a minimum base S for a permutation group G on [n] given by generators, i.e., a minimum cardinality subset S of [n] such that no nontrivial permutation in G fixes all elements of S. Our focus is mainly on the parameterized complexity of these problems. We show that when k=|S| is treated as parameter, then both problems are MINI[1]-hard. For the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04383","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-18T01:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AqXfMg5/ry+TSiP16e9TIXJfOODstrYVop9S7xOCh653CY3TPk+pz9XkJCJxGxqRvejTQ2Dqi8ePQpY6HckBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:56:00.669166Z"},"content_sha256":"1b9fde1294a7784e4d958ae14a5713868c0f395051d3817632f8d79884ac5a2a","schema_version":"1.0","event_id":"sha256:1b9fde1294a7784e4d958ae14a5713868c0f395051d3817632f8d79884ac5a2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MKBMB6MVRUWQJWCDEWETS4UVB/bundle.json","state_url":"https://pith.science/pith/4MKBMB6MVRUWQJWCDEWETS4UVB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MKBMB6MVRUWQJWCDEWETS4UVB/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-02T02:56:00Z","links":{"resolver":"https://pith.science/pith/4MKBMB6MVRUWQJWCDEWETS4UVB","bundle":"https://pith.science/pith/4MKBMB6MVRUWQJWCDEWETS4UVB/bundle.json","state":"https://pith.science/pith/4MKBMB6MVRUWQJWCDEWETS4UVB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MKBMB6MVRUWQJWCDEWETS4UVB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4MKBMB6MVRUWQJWCDEWETS4UVB","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":"02f31b971a711a1ec7466d7eb5a5d50e70d256de17faa36833938eeb86ac9300","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-14T14:19:09Z","title_canon_sha256":"967b9fad3a15c646adb46d6e1faf1bff9e26075fc49ef8d644376ca0f08ef493"},"schema_version":"1.0","source":{"id":"1606.04383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04383","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04383v1","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04383","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"4MKBMB6MVRUW","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4MKBMB6MVRUWQJWC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4MKBMB6M","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:1b9fde1294a7784e4d958ae14a5713868c0f395051d3817632f8d79884ac5a2a","target":"graph","created_at":"2026-05-18T01:12:25Z","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":"In this paper we study the complexity of the following problems:\n  Given a colored graph X=(V,E,c), compute a minimum cardinality set S of vertices such that no nontrivial automorphism of X fixes all vertices in S. A closely related problem is computing a minimum base S for a permutation group G on [n] given by generators, i.e., a minimum cardinality subset S of [n] such that no nontrivial permutation in G fixes all elements of S. Our focus is mainly on the parameterized complexity of these problems. We show that when k=|S| is treated as parameter, then both problems are MINI[1]-hard. For the ","authors_text":"Frank Fuhlbr\\\"uck, Gaurav Rattan, Johannes K\\\"obler, Sebastian Kuhnert, V. Arvind","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-14T14:19:09Z","title":"The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04383","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:2ddfa8814ae4cac8819547ec0ffca091c076237ba91383a88bc0c78b13c21e20","target":"record","created_at":"2026-05-18T01:12:25Z","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":"02f31b971a711a1ec7466d7eb5a5d50e70d256de17faa36833938eeb86ac9300","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-14T14:19:09Z","title_canon_sha256":"967b9fad3a15c646adb46d6e1faf1bff9e26075fc49ef8d644376ca0f08ef493"},"schema_version":"1.0","source":{"id":"1606.04383","kind":"arxiv","version":1}},"canonical_sha256":"e3141607ccac696826c2192c49cb94a85fc95321113bdb245ee73576e4c588a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3141607ccac696826c2192c49cb94a85fc95321113bdb245ee73576e4c588a0","first_computed_at":"2026-05-18T01:12:25.671212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:25.671212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"96kVQfj4NjkpxgXIi5xs/EdL6acDBmlaECewMF8ot4H44gdSf2mUrtpVBOnvWwCs3ExmibVmgNIaQrgqcM5jCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:25.671539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ddfa8814ae4cac8819547ec0ffca091c076237ba91383a88bc0c78b13c21e20","sha256:1b9fde1294a7784e4d958ae14a5713868c0f395051d3817632f8d79884ac5a2a"],"state_sha256":"4422f332be90d58bd40714ec2773cd516bc14a136d8198f96af5fea87cbfc7bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Z1knqxyAHeYUpiF9QW+NTtH755CFon5/uVFTbjcjBgXKviYSnibYi0KjpMY2vzhh/bZjg5yVKZ4s5KjWpFdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:56:00.671140Z","bundle_sha256":"3bdaba05c9e3a918c9c0903c33e2c6ceb8c9f1af6560b8c50d95a56765b457a4"}}