{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7VEI23YFBN3U3IXQTCXKCTHWOJ","short_pith_number":"pith:7VEI23YF","schema_version":"1.0","canonical_sha256":"fd488d6f050b774da2f098aea14cf67247085e15350e6148662d5b9e82cf431c","source":{"kind":"arxiv","id":"1604.03861","version":1},"attestation_state":"computed","paper":{"title":"New results on metric-locating-dominating sets of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antonio Gonz\\'alez, Carmen Hernando, Merc\\`e Mora","submitted_at":"2016-04-13T16:37:27Z","abstract_excerpt":"A dominating set $S$ of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of $S$, and the minimum cardinality of such a set is called the metric-location-domination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominating sets to other special sets: resolving sets, dominating sets, locating-dominating sets and doubly resolving sets. We first characterize classes of trees according to certain relationships between their metric-location-dominatio"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1604.03861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-13T16:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"9b36b828f0b1c51fa448acaf50c12367c9bce86e2b93eb6c3934ae3b711aea5f","abstract_canon_sha256":"701b9de18e18361c5b0bdff1b84b31922bd75aa93867f9a6283aa5bfc5d8cdab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:10.854994Z","signature_b64":"lLvJedoQF27xU7nzkjaZCs5khVA8pOApupRrQoKio9LK2v5WPVLBRYGKTX+xOPFrPS7/nQyvfhPMncR0XwoDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd488d6f050b774da2f098aea14cf67247085e15350e6148662d5b9e82cf431c","last_reissued_at":"2026-05-18T01:17:10.854247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:10.854247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New results on metric-locating-dominating sets of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antonio Gonz\\'alez, Carmen Hernando, Merc\\`e Mora","submitted_at":"2016-04-13T16:37:27Z","abstract_excerpt":"A dominating set $S$ of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of $S$, and the minimum cardinality of such a set is called the metric-location-domination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominating sets to other special sets: resolving sets, dominating sets, locating-dominating sets and doubly resolving sets. We first characterize classes of trees according to certain relationships between their metric-location-dominatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03861","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.03861","created_at":"2026-05-18T01:17:10.854372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03861v1","created_at":"2026-05-18T01:17:10.854372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03861","created_at":"2026-05-18T01:17:10.854372+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VEI23YFBN3U","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VEI23YFBN3U3IXQ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VEI23YF","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ","json":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ.json","graph_json":"https://pith.science/api/pith-number/7VEI23YFBN3U3IXQTCXKCTHWOJ/graph.json","events_json":"https://pith.science/api/pith-number/7VEI23YFBN3U3IXQTCXKCTHWOJ/events.json","paper":"https://pith.science/paper/7VEI23YF"},"agent_actions":{"view_html":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ","download_json":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ.json","view_paper":"https://pith.science/paper/7VEI23YF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03861&json=true","fetch_graph":"https://pith.science/api/pith-number/7VEI23YFBN3U3IXQTCXKCTHWOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7VEI23YFBN3U3IXQTCXKCTHWOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/action/storage_attestation","attest_author":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/action/author_attestation","sign_citation":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/action/citation_signature","submit_replication":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/action/replication_record"}},"created_at":"2026-05-18T01:17:10.854372+00:00","updated_at":"2026-05-18T01:17:10.854372+00:00"}