{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FA3RMQ2CXRDHPRUVLSNYG43GGC","short_pith_number":"pith:FA3RMQ2C","canonical_record":{"source":{"id":"1401.0342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T22:44:25Z","cross_cats_sorted":[],"title_canon_sha256":"f076696b2bbc2834a70800feee55db7a369b1d07b12c588fd8761545f54e524f","abstract_canon_sha256":"2340ab6c4b2d1e90a1c23ae04f843fdbae23bd09f03748d80370cf55342f1e41"},"schema_version":"1.0"},"canonical_sha256":"2837164342bc4677c6955c9b8373663081abb05466f1477b30bb18f180a5f509","source":{"kind":"arxiv","id":"1401.0342","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0342","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0342v2","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0342","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"pith_short_12","alias_value":"FA3RMQ2CXRDH","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FA3RMQ2CXRDHPRUV","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FA3RMQ2C","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FA3RMQ2CXRDHPRUVLSNYG43GGC","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T22:44:25Z","cross_cats_sorted":[],"title_canon_sha256":"f076696b2bbc2834a70800feee55db7a369b1d07b12c588fd8761545f54e524f","abstract_canon_sha256":"2340ab6c4b2d1e90a1c23ae04f843fdbae23bd09f03748d80370cf55342f1e41"},"schema_version":"1.0"},"canonical_sha256":"2837164342bc4677c6955c9b8373663081abb05466f1477b30bb18f180a5f509","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:13.534217Z","signature_b64":"B93iaQrXtMe1Dc+2qSaZ2+yhZaG6kjR5ESoBEGxCofUgZ9bH21XFEB7CuCoUycelmb0Xdasq0wQ41UQRz/HDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2837164342bc4677c6955c9b8373663081abb05466f1477b30bb18f180a5f509","last_reissued_at":"2026-05-18T01:29:13.533627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:13.533627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0342","source_version":2,"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:29:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35et2UZvSbzWLixYCaSdVqUodJyXGToD/QksWhNRP0ev0u4oGAnBhvCQTup3hA7sIvvhtpm272qTWCgjs86sDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:19:32.640133Z"},"content_sha256":"3ae63176a4c26567624a892c2f1eb58490d1048848587b8031715cf7ae4570ab","schema_version":"1.0","event_id":"sha256:3ae63176a4c26567624a892c2f1eb58490d1048848587b8031715cf7ae4570ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FA3RMQ2CXRDHPRUVLSNYG43GGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of computing the $k$-metric dimension of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alejandro Estrada-Moreno, Ismael G. Yero, Juan A. Rodriguez-Velazquez","submitted_at":"2014-01-01T22:44:25Z","abstract_excerpt":"Given a connected graph $G=(V,E)$, a set $S\\subseteq V$ is a $k$-metric generator for $G$ if for any two different vertices $u,v\\in V$, there exist at least $k$ vertices $w_1,...,w_k\\in S$ such that $d_G(u,w_i)\\ne d_G(v,w_i)$ for every $i\\in \\{1,...,k\\}$. A metric generator of minimum cardinality is called a $k$-metric basis and its cardinality the $k$-metric dimension of $G$. We study some problems regarding the complexity of some $k$-metric dimension problems. For instance, we show that the problem of computing the $k$-metric dimension of graphs is $NP$-Complete. However, the problem is solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0342","kind":"arxiv","version":2},"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:29:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cEzdK6TsdTrcfy+a4XdT/jVHyt3vqkneo394iNdb8RiIEPB/sK/DI7VPzfLKuFjoDt4cTYhZPP4dr6ypdXH0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:19:32.640508Z"},"content_sha256":"01ad89218a171da985bbb3291e61cc0a17e20f29af5bec41f6201a2815f24b6f","schema_version":"1.0","event_id":"sha256:01ad89218a171da985bbb3291e61cc0a17e20f29af5bec41f6201a2815f24b6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/bundle.json","state_url":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/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-23T03:19:32Z","links":{"resolver":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC","bundle":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/bundle.json","state":"https://pith.science/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FA3RMQ2CXRDHPRUVLSNYG43GGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FA3RMQ2CXRDHPRUVLSNYG43GGC","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":"2340ab6c4b2d1e90a1c23ae04f843fdbae23bd09f03748d80370cf55342f1e41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T22:44:25Z","title_canon_sha256":"f076696b2bbc2834a70800feee55db7a369b1d07b12c588fd8761545f54e524f"},"schema_version":"1.0","source":{"id":"1401.0342","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0342","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0342v2","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0342","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"pith_short_12","alias_value":"FA3RMQ2CXRDH","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FA3RMQ2CXRDHPRUV","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FA3RMQ2C","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:01ad89218a171da985bbb3291e61cc0a17e20f29af5bec41f6201a2815f24b6f","target":"graph","created_at":"2026-05-18T01:29:13Z","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":"Given a connected graph $G=(V,E)$, a set $S\\subseteq V$ is a $k$-metric generator for $G$ if for any two different vertices $u,v\\in V$, there exist at least $k$ vertices $w_1,...,w_k\\in S$ such that $d_G(u,w_i)\\ne d_G(v,w_i)$ for every $i\\in \\{1,...,k\\}$. A metric generator of minimum cardinality is called a $k$-metric basis and its cardinality the $k$-metric dimension of $G$. We study some problems regarding the complexity of some $k$-metric dimension problems. For instance, we show that the problem of computing the $k$-metric dimension of graphs is $NP$-Complete. However, the problem is solv","authors_text":"Alejandro Estrada-Moreno, Ismael G. Yero, Juan A. Rodriguez-Velazquez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T22:44:25Z","title":"On the complexity of computing the $k$-metric dimension of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0342","kind":"arxiv","version":2},"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:3ae63176a4c26567624a892c2f1eb58490d1048848587b8031715cf7ae4570ab","target":"record","created_at":"2026-05-18T01:29:13Z","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":"2340ab6c4b2d1e90a1c23ae04f843fdbae23bd09f03748d80370cf55342f1e41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-01T22:44:25Z","title_canon_sha256":"f076696b2bbc2834a70800feee55db7a369b1d07b12c588fd8761545f54e524f"},"schema_version":"1.0","source":{"id":"1401.0342","kind":"arxiv","version":2}},"canonical_sha256":"2837164342bc4677c6955c9b8373663081abb05466f1477b30bb18f180a5f509","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2837164342bc4677c6955c9b8373663081abb05466f1477b30bb18f180a5f509","first_computed_at":"2026-05-18T01:29:13.533627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:13.533627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B93iaQrXtMe1Dc+2qSaZ2+yhZaG6kjR5ESoBEGxCofUgZ9bH21XFEB7CuCoUycelmb0Xdasq0wQ41UQRz/HDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:13.534217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0342","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae63176a4c26567624a892c2f1eb58490d1048848587b8031715cf7ae4570ab","sha256:01ad89218a171da985bbb3291e61cc0a17e20f29af5bec41f6201a2815f24b6f"],"state_sha256":"881bcaf277bfff8e30e6e2e8e78715ac19d1bbe0397cccc8a66efd1f262b98bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWDNyZ1TWgDRw1dNcAXXdC07outWH4kN6S3lLL39fv6Ls3kuTTNi2UX1g9ANVTbhetPS2uzEScbEdr6iMmuMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T03:19:32.642616Z","bundle_sha256":"eabe41638a17aad7af7588e3f6d98c7695aa1b8488205d778914a7a662c24ece"}}